Enumerable Multitrack (d, k) Block Codes

IEEE Transactions on Information Theory

Volumn 39, Issue 5, 1993, Pages 1738-1744

  Orcutt, Edward K ^a,b   Marcellin, Michael W ^a  

^a UNIVERSITY OF ARIZONA   (United States)

^b MOTOROLA INC   (United States)

Author keywords

(d,k) codes recording codes; Constrained channels; constrained codes

Indexed keywords

CODES (SYMBOLS); CONSTRAINT THEORY; MAGNETIC STORAGE; MATRIX ALGEBRA; MODULATION; OPTICAL DATA STORAGE; RECORDING;

CONSTRAINED CHANNELS; CONSTRAINED CODES; MULTITRACK BLOCK CODES;

INFORMATION THEORY;

EID: 0027664288     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.259664     Document Type: Article

References (9)

1. M. W. Marcellin and H. J. Weber, “Two-dimensional modulation codes,” IEEE J. Select. Areas Commun., vol. 10, pp. 254–266, Jan. 1992.
2. T. M. Cover, “Enumerative source encoding,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 73–77, Jan. 1973.
3. D. T. Tang and L. R. Bahl, “Block codes for a class of constrained noiseless channels,” Inform. Contr., vol. 17, pp. 436–461, 1970.
4. G. Beenker and K. S. Immink, “A generalized method for encoding and decoding run-length-limited binary sequences,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 751–754, 1983.
5. B. Fitingof, “Enumerative coding for constrained noiseless channels and modulation coding,” in Abstracts of Papers, Int. Symp. Inform. Theory, San Diego, CA, Jan. 1990.
6. I. F. Blake, “The enumeration of certain run length sequences,” Inform. and Contr., vol. 55, pp. 222–237, 1982.
7. C. V. Freiman and A. D.Wyner, “Optimum block codes for noiseless input restricted channels,” Inform. and Contr., vol. 7, pp. 398–415, 1964.
8. R. E. Blahut, Principles and Practice of Information Theory. Reading, MA: Addison-Wesley, 1987.
9. P. Lee and J. K. Wolf, “A general error-correcting code construction for run-length limited binary channels,” IEEE Trans. Inform. Theory, vol. 35, pp. 1330–1335, Nov. 1989.