Trellis codes for (1,k) e2pr4ml with squared distance 18

IEEE Transactions on Magnetics

Volumn 32, Issue 5 PART 1, 1996, Pages 3995-3997

  McEwen, Peter A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MAGNETIC RECORDING; SIGNAL DETECTION; VECTORS;

ERROR EVENT; EUCLIDEAN DISTANCE; FINITE TRUNCATION DEPTH CODES; PARTIAL RESPONSE MAXIMUM LIKELIHOOD DETECTION;

TRELLIS CODES;

EID: 0030247863     PISSN: 00189464     EISSN: None     Source Type: Journal    
DOI: 10.1109/20.539242     Document Type: Article

References (4)

1. R. Karabed and P. H. Siegel, "Coding for higher order partial response channels", in Proceedings SPIE Conf. on Coding and Signal Processing for Inform. Storage, 1995, pp. 115-126.
2. L. Fredrickson, "Time-varying modulo N trellis codes for input restricted partial respouse channels", U. S. Patent 5,257,272, October 1993.
3. B.H. Marcus, P. H. Siegel, and J. K. Wolf, "Finite-state modulation codes for data storage", IEEE J. Select. Areas Commun. , vol. 10, no. 1, pp. 5-37, January 1992.
4. T. Horiguchi and K. Morita, "An optimization of modulation codes in digital recording", IEEE Trans. Magn. , vol. 12, no. 6, pp. 740-742, November 1976.