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

DOI10.1109/18.556684zbMATH Open0868.94052OpenAlexW2165613172MaRDI QIDQ3129476FDOQ3129476

Authors: Jonathan J. Ashley 

Publication date: 12 June 1997

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

Full work available at URL: https://doi.org/10.1109/18.556684

Recommendations

• Construction of encoders with small decoding look-ahead for input-constrained channels
• On the decoding delay of encoders for input-constrained channels
• Lower bounds on the anticipation of encoders for input-constrained channels

zbMATH Keywords

boundsinput-constrained channelsliding-block decoderstate-splitting technique

Mathematics Subject Classification ID

Decoding (94B35)

Cited In (9)

• A note on the method of poles for code construction
• Asynchronous sliding block maps
• Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity
• A linear bound for sliding-block decoder window size
• Construction of encoders with small decoding look-ahead for input-constrained channels
• On Future-Dependent Block Coding for Input-Restricted Channels
• Lower bounds on the anticipation of encoders for input-constrained channels
• Canonical Encoders for Sliding Block Decoders
• On asymptotic optimality of a sliding window variation of Lempel-Ziv codes

This page was built for publication: A linear bound for sliding-block decoder window size. II

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