A New Approach to Constructing Optimal Block Codes for Runlength-Limited Channels

IEEE Transactions on Information Theory

Volumn 40, Issue 3, 1994, Pages 774-785

  Gu, Jian ^a   Fuja, Thomas E ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

block codes; constrained channels; magnetic recording; optical recording; Runlength codes

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); CONSTRAINT THEORY; DATA COMMUNICATION SYSTEMS; DATA RECORDING; DECODING; ENCODING (SYMBOLS); FINITE AUTOMATA; MAGNETIC STORAGE; OPTICAL RECORDING; STATE ASSIGNMENT;

CONSTRAINED CHANNELS; FINITE STATE TRANSITION DIAGRAM; MAGNETIC RECORDING; OPTIMAL BLOCK CODES; RUNLENGTH CODES;

CODES (SYMBOLS);

EID: 0028428759     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.335889     Document Type: Article

References (19)

1. B. Marcus, P. H. Siegel, and J. K. Wolf, “Finite-state modulation codes for data storage,” IEEE J. Select. Areas Commun., vol. 10, pp. 5-37, Jan. 1992.
2. A. Khayrallah and D. Neuhoff, “Subshift models and finite-state codes for input-constrained noiseless channels: A tutorial,” preprint, 1990.
3. K. A. Schouhamer Immink, “Block-decodable runlength-limited codes via look-ahead technique,” Philips J. Res., vol. 46, no. 6, pp. 293-310, June 1992.
4. P. A. Franaszek, “Sequence-state coding for digital transmission,” Bell Syst. Tech. J., vol. 47, pp. 143-157, Jan. 1968.
5. P. A. Franaszek, “On synchronous variable length coding for discrete noiseless channels,” Inf. Control, vol. 15, pp. 155-164, 1969.
6. G. F. M. Beenker and K. A. Schouhamer Immink, “A generalized method for encoding and decoding run-length-limited binary sequences,” IEEE Trans. Inform. Theory, vol. 29, no. 5, pp. 751-754, Sept. 1983.
7. K. A. Schouhamer Immink, Coding Techniques for Digital Recorders. Englewood Cliffs, NJ: Prentice Hall International Ltd., 1991.
8. Ø. Ytrehus, “Runlength-limited codes for mixed-error channels,” IEEE Trans. Inform. Theory, vol. 37, no. 6, pp. 1577-1585, Nov. 1991.
9. Ø. Ytrehus, “Upper bounds on error-correcting runlength-limited block codes,” IEEE Trans. Inform. Theory, vol. 37, no. 3, pp. 941-945, May 1991.
10. M. Blaum, “Combining ECC with modulation: Performance comparisons,” IEEE Trans. Inform. Theory, vol. 37, no. 3, pp. 945-949, May 1991.
11. K. M. Cheung, “Error-correction coding for data storage systems,” Ph.D. dissertation, California Institute of Technology, 1987.
12. Patrick Lee and J. K. Wolf, “A general error-correcting code construction for run-length limited binary channels,” IEEE Trans. Inform. Theory, vol. 35, no. 6, pp. 1330-1335, Nov. 1989.
13. F. Pollara, R. J. McEliece, and K. Abdel-Ghaffar, “Finite-state codes,” IEEE Trans. Inform. Theory, vol. 34, no. 5, pp. 1083-1089 Sept. 1988.
14. P. A. Franaszek, “Sequence-state methods for run-length-limited coding,” IBM J. Res. Dev., vol. 14, pp. 376-383, July 1970.
15. C. V. Freiman and A. D. Wyner, “Optimum block codes for noiseless input restricted channels,” Inf. Control, vol. 7, pp. 398-415, 1964.
16. J. Gu, “New results on coding for constrained channels,” Ph.D. thesis, Univ. of Maryland, 1993.
17. J. Gu and T. Fuja, “Joint runlength/error-control codes based on set-concatenable collections,” presented at the 1993 IEEE Int. Symp. Inf. Theory, San Antonio, TX, Jan. 17-22, p. 122.
18. T. Tjalkens, “Glueless runlength limited sequences,” in Proc. Thirteenth Symp. Inf. Theory in the Benelux (Enschede, The Netherlands), June 1-2, 1992, pp. 57-64.
19. T. Tjalkens, “On the principal state method for runlength limited sequences,” in Proc. 1993 IEEE Int. Symp. Inform. Theory, (San Antonio, TX), Jan. 1993, p. 121.