On the capacity of M-ary runlength-limited codes

DOI10.1109/18.412712MaRDI QIDQ4859780zbMATH OpenOpenAlexFDO

Authors Steven W. McLaughlin, Jian Luo, Qun Xie

Publication date 8 February 1996

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

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

zbMATH Keywords

runlength-limited codesShannon capacity

Mathematics Subject Classification ID

Modulation and demodulation in information and communication theory (94A14) Coding theorems (Shannon theory) (94A24) Prefix, length-variable, comma-free codes (94A45) Other types of codes (94B60)

Recommendations

• A note on the Shannon capacity of run-length-limited codes (Corresp.)
• Shannon capacity of M-ary redundant multitrack runlength limited codes
• Almost-Certainly Runlength-Limiting Codes
• Runlength-limited codes for mixed-error channels
• Optimal block codes for M-ary runlength-constrained channels
• scientific article; zbMATH DE number 4207992
• Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis
• Constructions of almost block-decodable runlength-limited codes
• Some new runlength-limited convolutional codes
• An upper bound on the entropy of run-length coding (Corresp.)

Cited in

(7)

• A note on the Shannon capacity of run-length-limited codes (Corresp.)
• On runlength codes
• The construction of M-ary (d,∞) codes that achieve capacity and have the fewest number of encoder states
• Shannon capacity of M-ary redundant multitrack runlength limited codes
• Optimal block codes for M-ary runlength-constrained channels
• A rate 4/6 (d=1, k=11) block-decodable runlength-limited code
• New Bounds on the Capacity of Multidimensional Run-Length Constraints

This page was built for publication: On the capacity of M-ary runlength-limited codes

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