Trellis codes for recording

The author describes a method of combining trellis-coded (or coset-coded) modulation concepts with those from the design of run-length limited coding. The method is referred to as the trellis-constrained, run-length code approach. It is shown that this approach, which introduces redundancy in the transition sequence, provides improved noise immunity and can be used in recording systems to increase the data density while maintaining data integrity, without increasing the density of transition.<<ETX>>

[1]  A. Robert Calderbank,et al.  Binary convolutional codes with application to magnetic recording , 1986, IEEE Trans. Inf. Theory.

[2]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[3]  N. J. A. Sloane,et al.  New trellis codes based on lattices and cosets , 1987, IEEE Trans. Inf. Theory.

[4]  Brian H. Marcus,et al.  State splitting for variable-length graphs , 1986, IEEE Trans. Inf. Theory.

[5]  Jack K. Wolf,et al.  On runlength codes , 1988, IEEE Trans. Inf. Theory.

[6]  Don Coppersmith,et al.  Algorithms for sliding block codes - An application of symbolic dynamics to information theory , 1983, IEEE Trans. Inf. Theory.