A linear bound for sliding-block decoder window size, II

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 1, 1996, Pages 1913-1924

  Ashley, Jonathan J ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Bounds; Input constrained channel; Sliding block decoder

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); CONSTRAINT THEORY; DATA STORAGE EQUIPMENT; ENCODING (SYMBOLS); GRAPH THEORY;

FINITE STATE ENCODERS; INPUT CONSTRAINED CHANNELS; SLIDING BLOCK DECODER;

DECODING;

EID: 0030287969     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556684     Document Type: Article

References (7)

1. J. J. Ashley, "A linear bound for sliding-block decoder window size," IEEE Trans. Inform. Theory, vol. 34, pp. 389-399, 1988.
2. J. J. Ashley, B. H. Marcus, and R. M. Roth, "Construction of encoders with small decoding look-ahead for input-constrained channels," IEEE Trans. Inform. Theory, vol. 41, pp. 55-76, 1995.
3. 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, pp. 5-22, 1983.
4. R. Fisher, "Sofie systems and graphs," Monats, für Math., vol. 80, pp. 179-186, 1975.
5. "Graphs and symbolic dynamics," Bôlyai, Topics in Inform. Theory, vol. 16, pp. 229-242, 1975.
6. H. Mine, Nonnegative Matrices. New York: Wiley, 1988.
7. JT. J. Ashley and B. H. Marcus, "Cannonical encoders for sliding block decoders," SIAM J. Discr. Math., vol. 8, pp. 555-605, 1995.