Modified sliding block code for limiting error propagation

Claim 2

A code translation device for transferring data between two differently coded binary representations in respective codes thereof, being a (d,k) constrained code, a first code being unconstrained, characterized in that the "d" constraint is violated by a bit inversion adjacent each naturally coded singleton bit of the opposite denomination to reduce error propogation.

Claim 3

In a code translation device for translating code bits between a first code on a second code as set forth in claim 1, the improvement including, in combination: said first code being an unconstrained code and said second code being a constrained code of the d,k type having a rate of m/n, zeros representing a first code state and ones representing a second code state in both said first and second codes, d and k indicating the minimum number of zeros and maximum number of zeros in a string, respectively, said d and k values giving the constrained code predetermined channel characteristics including error propagation; a sequential state machine having first and second means to respectively operate on said first code in m bit groups and on said second code in n bit groups; code translating means coupled to said first and second means for operating on the code groups such that a one of said m bit groups is encodable into a small number of said n bit groups in a sliding block manner, with a minimum number of ones in a string being any two ones; and error stop means in the code translating means operative to violate the d value by limiting the minimum number of ones in a string to j, where j is not less than two, by substituting a one not found in the d,k code for an adjacent zero to each of said single ones for reducing said predetermined error propagation characteristics of the constrained code while maintaining the remaining predetermined characteristics of said constrained d,k code.

Claim 4

Apparatus as set forth in claim 2, further means to said error stop means operative to limit the minimum number of successive ones to d-1 ones.

Claim 5

In a recording medium having a track for storing data in a series of signals wherein one state is represented by zeros and a second state is represented by ones, the improvement including, in combination: a recorded set of strings of zeros and ones encoded as a d,k code wherein the d,k code can have a string of single-ton one and a minimum limit of d zeros in succession and a maximum of k zeros in succession, d and k being integers; and said recorded set of strings violating the d,k code in that a limit of a number of ones in any string cannot appear as less than j number of ones in succession, wherein j is an integer greater than one, and adjacent predetermined ones of said j number of ones the value d is reduced by d-j in an immediately adjacent string of successive zeros.

Claim 6

In a recording medium having a track for storing data in a series of signals wherein one state is represented by zeros and a second state is represented by ones, the improvement including, in combination: a recorded set of strings of zeros and ones encoded as a d,k code wherein the d,k code can have a string of single-ton one and a minimum limit of d zeros in succession and a maximum of k zeros in succession, d and k being integers; and said recorded set of strings violating the d,k code in that a limit of a number of ones in any string cannot appear as less than j number of ones in succession, wherein j is an integer greater than one, and adjacent predetermined ones of said j number of ones the value d is reduced by d-j in an immediately adjacent string of successive zeros.

Claim 9

In a method of translating data between an unconstrained code and a constrained code as set forth in claim 5, the steps of: dividing all of the unconstrained code data into m bit groups, wherein m is an integer greater than one; dividing all of the constrained coded data into n bit groups wherein n is an integer greater than m; representing each of the m bit groups in a plurality of said n bit groups in a sliding block manner such that the code relationship of successively handled m code groups are represented in the successive n bit groups as a sequence of bits in a d,k code wherein the d,k code rules are altered for each three bit pattern of 010 to include a doublet of adjacent ones in the three bit pattern and the d number of zeros is reduced from d to at least d-1; and selecting the d value to represent the minimum number of successive zeros in the n bit group and k the maximum number of successive zeros in the n bit group bit sequences.