Construction of encoders with small decoding look-ahead for input-constrained channels

DOI10.1109/18.370118MaRDI QIDQ4840872zbMATHOpenAlexFDO

Authors Jonathan J. Ashley, Brian Marcus, Ron M. Roth

Publication date 17 September 1995

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/ca6f246419cf12a3a0bc6a18e0a2475a65babd7d

zbMATH Keywords

input-constrained channelsliding-block decoder

Mathematics Subject Classification ID

Applications of graph theory (05C90) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• A linear bound for sliding-block decoder window size. II
• The construction of M-ary (d,∞) codes that achieve capacity and have the fewest number of encoder states
• On the decoding delay of encoders for input-constrained channels
• Lower bounds on the anticipation of encoders for input-constrained channels
• Complexity and sliding-block decodability

Cited in

(5)

• Stabilization of Block-Type-Decodability Properties for Constrained Systems
• Lower bounds on the anticipation of encoders for input-constrained channels
• On Future-Dependent Block Coding for Input-Restricted Channels
• The method of poles: a coding method for constrained channels
• How to find small AI-systems for antiblocking decoding

This page was built for publication: Construction of encoders with small decoding look-ahead for input-constrained channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840872)