Variable-Length State Splitting With Applications To Average Runlength-Constrained (Arc) Codes

IEEE Transactions on Information Theory

Volumn 37, Issue 3, 1991, Pages 759-777

  Heegard, Chris D ^a   Marcus, Brian H ^b   Siegel, Paul H ^b  

^a Department of Obstetrics Gynecology   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Magnetic recording; runlength limited codes; state splitting

Indexed keywords

CODES, SYMBOLIC - ENCODING; INFORMATION THEORY - CHANNEL CAPACITY; MATHEMATICAL TECHNIQUES - EIGENVALUES AND EIGENFUNCTIONS; PROBABILITY; SIGNAL PROCESSING - SIGNAL ENCODING;

AVERAGE RUNLENGTH-LIMITED CODES; MAGNETIC RECORDING; VARIABLE-LENGTH GRAPHS; VARIABLE-LENGTH STATE SPLITTING;

DATA STORAGE, MAGNETIC;

EID: 0026152323     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.79946     Document Type: Article

References (19)

1. C. Shannon, “The mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379–423; 623-656, 1948.
2. R. L. Adler, D. Coppersmith, and M. Hassner, “Algorithms for sliding block codes—An application of symbolic dynamics to information theory,” IEEE Trans. Inform. Theory, vol. IT-29, no. 1, pp. 5–22, Jan. 1983.
3. P. Franaszek, “Run-length-limited variable length coding with error propagation limitation,” U.S. Patent 3,689,899, 1972.
4. “Construction of bounded delay codes for discrete noiseless channels,” IBM J. Res. and Dev., vol. 26, no. 4, pp. 506–514, July 1982.
5. A. M. Patel, “Zero-modulation encoding in magnetic recording,” IBM J. Res. Dev., vol. 19, pp. 366–378, July 1975.
6. B. Marcus, “Factors and extensions of full shifts,” Monats. Math., vol. 88, pp. 239–247, 1979.
7. R. Adler, J. Friedman, B. Kitchens, and B. H. Marcus, “State splitting for variable-length graphs,” IEEE Trans. Inform. Theory, vol. IT-32, no. 1, pp. 108–113, Jan. 1986.
8. E. Zehavi and J. K. Wolf, “On run-length codes,” IEEE Trans. Inform. Theory, vol. IT-34, no. 1, pp. 45–54, Jan. 1988.
9. C. D. Heegard, “A pair of Information theoretic lemmas with application to runlength coding,” 25th Ann. Allerton Conf. Commun., Contr., and Comput., Allerton, IL, Sept. 30-Oct. 2, 1987.
10. G. S. Dixon, C. A. French and J. K. Wolf, “Results involving (D, K) constrained M-ary codes,” IEEE Trans. Magn., vol. MAG-23, pp. 3678–3680, 1987.
11. A. Gallopoulos, C. D. Heegard, and P. Siegel, “The power spectrum of runlength-limited codes,” IEEE Trans. Commun., vol. COM-37, no. 9, pp. 906–917, Sept. 1989.
12. I. Csiszar, T. Cover, and B.-S. Choi, “Conditional limiting theorems under Markov conditioning,” IEEE Trans. Inform. Theory, vol. IT-33, no. 6, pp. 788–801, Nov. 1987.
13. J. Justesen and T. Hoholdt, “Maxentropic Markov chains,” IEEE Trans. Inform. Theory, vol. 30, no. 4, pp. 665–667, July 1984.
14. R. Karabed, A. Khayrallah, and D. Neuhoff, “The capacity of costly noiseless channels,” IBM Res. Rep. RJ 6040, Jan. 1988.
15. B. Marcus and R. Roth, “Bounds on the number of states in encoder graphs for input-constrained channels,” IEEE Trans. Inform. Theory, vol. 37, no. 3, pt. II, pp. 742–758, May 1991.
16. J. Ashley and P. Siegel, “A note on the Shannon capacity of run-length-limited codes,” IEEE Trans. Inform. Theory, vol. 33, no. 4, pp. 601–605, July 1987.
17. F. Gantmacher, The Theory of Matrices, vol. II. New York: Chelsea, 1959.
18. R. Karabed and B. Marcus, “Sliding block coding for input restricted channels,” IEEE Trans. Inform. Theory, vol. 34, no. 2, pp. 2–26, Jan. 1988.
19. R. Blahut, Principles and Practice of Information Theory. Reading, MA: Addison-Wesley, 1972.