On the Capacity of Binary and Gaussian Channels with Run-Length-Limited Inputs

IEEE Transactions on Communications

Volumn 38, Issue 5, 1990, Pages 584-594

 

^a Shitz), Shlomo   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY--FINITE AUTOMATA; CODES, SYMBOLIC--ENCODING; COMPUTER METATHEORY--BINARY SEQUENCES; DATA STORAGE, MAGNETIC;

ADDITIVE GAUSSIAN CHANNELS; BINARY SYMMETRIC CHANNELS; MAGNETIC RECORDING DENSITY; RUN LENGTH LIMITED CODES;

INFORMATION THEORY;

EID: 0025433824     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.54971     Document Type: Article

References (15)

1. P. H. Siegel, “Recording codes for digital magnetic storage,” IEEE Trans. Magn., vol. MAG-21, pp. 1344–1349, Sept. 1985.
2. M. G. Pelchat and J. M. Geist, “Surprising properties of two-level bandwidth compaction codes,” IEEE Trans. Commun., vol. COM-23, pp. 878–883, Sept. 1975.
3. K. A. S. Immink, “Some statistical properties of maxentropic runlength-limited sequences,” Philips J. Res., vol. 38, no. 3, pp. 138–149, 1983.
4. E. Zehavi and J. K. Wolf, “On run-length-codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 45–54, Jan. 1988.
5. C. A. French, “Signal processing for digital magnetic recording channels,” Ph.D. dissertation, Univ. California, San Diego, 1987.
6. C. A. French, J. K. Wolf, and G. S. Dixon, “Signaling with special run length constraints for a digital recording channel,” IEEE Trans. Magn., vol. 24, pp. 2092–2097, May 1988.
7. K. Norris and D. S. Bloomberg, “Channel capacity of charge-constrained run-length limited codes,” IEEE Trans. Magn., vol. MAG-17, pp. 3452–3455, Nov. 1981.
8. D. Larson and T. Howell, “Does the binary symmetric channel with error probability 0.1 and (0, 1) input constraint have capacity 0.4021937655?,” IBM Res., Almaden Res. Cen., San Jose, CA, unpublished rep., 1986.
9. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., no. 27, part 1, pp. 379–429, July 1948.
10. J. J. Ashley and P. H. Siegel, “A note on the Shannon capacity of run-length-limited codes,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 601–605, July 1987.
11. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
12. N. Chayat and S. Shamai (Shitz), “Extension of an entropy property for binary input memoryless symmetric channels,” IEEE Trans. Inform. Theory, vol. 35, pp. 1077–1079, Sept. 1989.
13. A. D. Wyner and J. Ziv, “A theorem of the entropy of certain binary sequences and applications: Part I,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 769–772, Nov. 1973.
14. R. Ash, Information Theory. New York: Wiley, 1967.
15. T. M. Apostol, Mathematical Analysis. Reading, MA: Addison-Wesley, 1978.