On runlength codes

DOI10.1109/18.2600MaRDI QIDQ3792616zbMATH OpenOpenAlexFDO

Authors Ephraim Zehavi, Jack Keil Wolf

Publication date 1988

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

Full work available at URL https://semanticscholar.org/paper/051979cba3d22110e4f020098e18ff33d0e9f653

zbMATH Keywords

capacityspectrumbinary symmetric channelbinary (d,k) codes

Mathematics Subject Classification ID

Information theory (general) (94A15)

Recommendations

• Runlength codes from source codes
• On the capacity of two-dimensional run-length constrained channels
• On the capacity of M-ary runlength-limited codes
• Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels
• A general error-correcting code construction for run-length limited binary channels

Cited in

(14)

• An upper bound on the entropy of run-length coding (Corresp.)
• Capacity achieving code constructions for two classes of (d,k) constraints
• Error-correcting codes with bounded running digital sum
• Asymptotics of input-constrained binary symmetric channel capacity
• On codes with local joint constraints
• A general error-correcting code construction for run-length limited binary channels
• A note on the Shannon capacity of run-length-limited codes (Corresp.)
• An entropy theorem for computing the capacity of weakly (d,k)-constrained sequences
• On the distribution of runs of ones in binary strings
• A new construction for n-track (d, k) codes with redundancy
• On codes that avoid specified differences
• Exact distributions of constrained (k, ) strings of failures between subsequent successes
• scientific article; zbMATH DE number 2135156 (Why is no real title available?)
• Bounds on the zero-error capacity of the input-constrained bit-shift channel

This page was built for publication: On runlength codes

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