A note on the Shannon capacity of run-length-limited codes (Corresp.)

DOI10.1109/TIT.1987.1057326MaRDI QIDQ3768801zbMATH OpenOpenAlexFDO

Authors Jonathan J. Ashley, Paul Siegel

Publication date 1987

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

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

zbMATH Keywords

binary Shannon capacityfixed-rate codes

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Recommendations

• On the capacity of M-ary runlength-limited codes
• Capacity bounds for the three-dimensional (0,1) run length limited channel
• Shannon capacity of M-ary redundant multitrack runlength limited codes
• On runlength codes
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Cited in

(8)

• Improved lower bound on the Shannon capacity of C₇
• New lower bounds for the Shannon capacity of odd cycles
• Algorithmic and explicit determination of the Lovász number for certain circulant graphs
• Shannon capacity of M-ary redundant multitrack runlength limited codes
• Maximizing the Shannon Capacity of Constrained Systems with Two Constraints
• A limit theorem for the Shannon capacities of odd cycles. II
• On the capacity of M-ary runlength-limited codes
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

This page was built for publication: A note on the Shannon capacity of run-length-limited codes (Corresp.)

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