On Runlength Codes

IEEE Transactions on Information Theory

Volumn 34, Issue 1, 1988, Pages 45-54

  Zehavi, Ephraim ^a   Wolf, Jack K ^b  

^a QUALCOMM INC   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY - FINITE AUTOMATA; DIGITAL COMMUNICATION SYSTEMS; INFORMATION THEORY - CHANNEL CAPACITY; PROBABILITY;

BINARY SYMMETRIC CHANNEL; RUNLENGTH CODES;

CODES, SYMBOLIC;

EID: 0023830310     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.2600     Document Type: Article

References (6)

1. J. L,. Lawson and G. W. Uhlenbeck, Threshold Signals. Boston, MA: Boston Technical Publisher, Inc., 1964
2. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., no. 27, pp. 379–423 (part 1) and pp. 623–656 (part 2), 1948.
3. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
4. J. Ashley and P. Siegel, “A note on the capacity of run length-limited codes,” IBM Res. Rep. RJ 5189 (53809), June 1986.
5. W. Feller, An Introduction To Probability Theory And Its Applications, vol. 1, 2nd ed. New York: Wiley, 1950.
6. L. A. Zadeh and C. A. Desoer, Linear System Theory, The State Space Approach. New York: McGraw-Hill, 1963.