Construction of encoders with small decoding look-ahead for input-constrained channels
From MaRDI portal
Publication:4840872
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)