Optimal block codes for M-ary runlength-constrained channels

DOI10.1109/18.930945MaRDI QIDQ4544650zbMATH OpenOpenAlexFDO

Authors Suparna Datta, Steven W. McLaughlin

Publication date 4 August 2002

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

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

zbMATH Keywords

binary optical recordingenumerative codingoptimal block-decodable codespermutation codesrunlength-limited codestemplate codes

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• A new approach to constructing optimal block codes for runlength-limited channels
• Constructing efficient DC-free runlength-limited block codes for recording channels
• On the capacity of M-ary runlength-limited codes
• Constructions of error-correcting DC-free block codes
• The construction of M-ary (d,∞) codes that achieve capacity and have the fewest number of encoder states

Cited in

(7)

• scientific article; zbMATH DE number 4207992 (Why is no real title available?)
• The construction of M-ary (d,∞) codes that achieve capacity and have the fewest number of encoder states
• An enumerative method for runlength-limited codes: permutation codes
• Constructing efficient DC-free runlength-limited block codes for recording channels
• A new approach to constructing optimal block codes for runlength-limited channels
• On the capacity of M-ary runlength-limited codes
• A rate 4/6 (d=1, k=11) block-decodable runlength-limited code

This page was built for publication: Optimal block codes for M-ary runlength-constrained channels

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