Optimal block-type-decodable encoders for constrained systems

DOI10.1109/TIT.2003.810634MaRDI QIDQ4680085zbMATH OpenOpenAlexFDO

Authors Panu Chaichanavong, Brian Marcus

Publication date 1 June 2005

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

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

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60) Bounds on codes (94B65)

Recommendations

• Stabilization of Block-Type-Decodability Properties for Constrained Systems
• Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity
• An Analysis on Optimal Rates of BDB Encoders for RLL and MTR Systems
• Complexity and sliding-block decodability
• Bounds on the number of states in encoder graphs for input-constrained channels

Cited in

(7)

• Optimization models for complex recovery block schemes
• An Analysis on Optimal Rates of BDB Encoders for RLL and MTR Systems
• Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity
• Lower bounds on the anticipation of encoders for input-constrained channels
• On the principal state method for run-length limited sequences
• Stabilization of Block-Type-Decodability Properties for Constrained Systems
• How to find small AI-systems for antiblocking decoding

This page was built for publication: Optimal block-type-decodable encoders for constrained systems

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