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

DOI10.1109/18.556684MaRDI QIDQ3129476zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

boundsinput-constrained channelsliding-block decoderstate-splitting technique

Mathematics Subject Classification ID

Decoding (94B35)

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

Cited in

(9)

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

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)