A linear bound for sliding-block decoder window size

DOI10.1109/18.6020MaRDI QIDQ3803034zbMATH OpenOpenAlexFDO

Authors Jonathan J. Ashley

Publication date 1988

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

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

zbMATH Keywords

codingdecidable theoryfree algebrasn-ary sequences

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Decoding (94B35)

Recommendations

• A linear bound for sliding-block decoder window size. II
• Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity
• Complexity and sliding-block decodability
• On the decoding delay of encoders for input-constrained channels
• Sliding block codes between constrained systems

Cited in

(2)

• Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity
• 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

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