State Splitting for Variable-Length Graphs

IEEE Transactions on Information Theory

Volumn 32, Issue 1, 1986, Pages 108-113

  Adler, Roy ^a   Kitchens, Bruce ^a   Friedman, Joel ^b   Marcus, Brian H ^c,d  

^a IBM RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

^d UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC - ENCODING; INFORMATION THEORY;

EIGENVECTORS; MODULATION CODE CONSTRUCTION TECHNIQUES; STATE SPLITTING ALGORITHM; VARIABLE-LENGTH GRAPHS;

MATHEMATICAL TECHNIQUES;

EID: 0022583054     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1986.1057125     Document Type: Article

References (6)

1. P. A. Franaszek, “Construction of bounded delay codes for discrete channels,” IBM J. Res. Devel., vol. 26, pp. 506–514, 1982.
2. A. Lempel and M. Cohn, “Look ahead coding for input restricted channels,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 933–937, 1982.
3. R. Adler, D. Coppersmith, and M. Hassner, “Algorithms for sliding block codes,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 5–22, 1983.
4. B. Marcus, “Sofic systems and encoding data,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 366–377, 1985.
5. C. Shannon, “The mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379-423; 623–656, 1948.
6. F. Gantmacher, The Theory of Matrices, vol. II. New York: Chelsea, 1959.