Abstract: Disclosed is an error tolerant binary encoded synchronization mark concatenated with a known pattern, such as a VFO pattern, comprising an encoded pattern of a fixed plurality of bits, the encoded synchronization pattern being at maximum Hamming distance from the concatenated known pattern for the number of bits in the fixed plurality of bits. The error tolerant synchronization mark may also be concatenated with the VFO pattern seen in reverse, and the synchronization pattern additionally is at maximum Hamming distance from the concatenated known VFO pattern seen in reverse.

Abstract: A data recording disk drive has a plurality of servo sectors containing error-detectable and error-correctable servo timing marks (STMs). Each STM is represented as a pattern of n bits of digital information, with each track having a set of m unique STM patterns, and wherein each of the m unique STM patterns of n bits has a minimum sliding distance d to every other STM pattern in the set, where d is greater than one. The error-tolerant STMs are achieved by the use of a set or code of fixed STM bit patterns, where the STM patterns have a specified minimum Hamming distance against all the patterns in the search, called the sliding distance d. These STM patterns may include any bits associated with the servo sectors, such as bits indicating track index, servo sector number, and recording head number.

Abstract: A method and apparatus for encoding and detecting data which can be represented in a physical array of modules recorded on a medium. Information is encoded in "image-blocks". An image-block comprises a plurality of "sub-blocks". Sub-blocks comprise a plurality of "modules". A module is the smallest unit of information within the image-block. Discrete contiguous portions of each sub-block of an image-block taken together are encoded into an outer codeword. A plurality of these outer codewords are generated and recorded across each sub-block. A portion of the information that is to be recorded within each sub-block is encoded in a plurality of inner error detection and correction codewords, each preferably stored entirely within one corresponding sub-block. Accordingly, small scattered random errors can be corrected locally by using information entirely contained within the sub-block.

Abstract: Digital data is stored on a DASD by generating a parity block for a specified block of data items and storing the parity block at a selected location on the DASD. The parity block includes a parity computation calculated by applying a parity routine to the corresponding data. The parity block also includes a parity code that indicates either (1) the size of the corresponding data block, or (2) the number of data items contributing to the parity computation. The parity block may be stored adjacent to the corresponding data, or at an independent location. Among other things, the invention provides significantly increased robustness against data loss, and improved flexibility and efficiency in storing data.

Abstract: An error checking method and apparatus for appending a variable number of redundancy coding information at the end of each data message or packet transmitted over a multi-stage network for the purpose of protecting the data by using an error detecting code. The amount of additional redundancy coding information implemented is variable and increases with the size of the data message or packet to provide a consistent level of protection.

Abstract: A modulator apparatus for modulating arrays of input data V.sub.in to be stored in a holographic recording medium is disclosed wherein the final output data array V.sub.out has frequent transitions from light to dark and from dark to light in either dimension across the data page and has the total amount of illuminated regions throughout the entire data page held constant. These two constraints are achieved by a first set of control arrays obtained from two fixed sets of m.times.n binary arrays {A.sub.0, A.sub.1, . . . , A.sub.n } and {B.sub.0, B.sub.1, . . . , B.sub.m } which in turn are obtained from fixed sets of binary control vectors {a.sub.0, a.sub.1, . . . , a.sub.n }, {b.sub.0, b.sub.1, . . . , b.sub.m }, respectively. The control vectors a.sub.0, a.sub.1, . . . , a.sub.n are any n+1 fixed elements of the inverse mapping, .phi..sup.-1 (C.sub.1), of the (t-2) error-correcting code C.sub.1 of length m. The control vectors b.sub.0, b.sub.1, . . . , b.sub.

Abstract: An apparatus and method for detecting and locating up to two symbols in error or erasures in an n.times.m A(n,m,t) parity coded bit array previously recorded on a multi-track storage device where n is a prime number, m.ltoreq.n, wherein at least one non-zero syndrome of m rotated and column summed syndromes is derived. The method includes an iterative process using an incremented tracking variable and testing of the cyclic equivalence of three derived vectors to isolate the number and location of the array column or columns containing the error or errors. Each derived vector is the modulo 2 sum of a selected syndrome and a selected rotated vector. Cyclic equivalence of between a derived vector and a selected rotated one of the other derived vectors for any given iteration establishes the error or errors and their column location or locations. An extension is shown for detecting and locating up to three errors or erasures.