Constructions of almost block-decodable runlength-limited codes

DOI10.1109/18.370099MaRDI QIDQ4840894zbMATH OpenOpenAlexFDO

Authors Kees Schouhamer Immink

Publication date 18 October 1995

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

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

zbMATH Keywords

encoderrunlength-limited codesrecording codeblock-decodable codes

Mathematics Subject Classification ID

Source coding (94A29) Other types of codes (94B60) Modulation and demodulation in information and communication theory (94A14)

Recommendations

• scientific article; zbMATH DE number 65168
• A rate 4/6 (d=1, k=11) block-decodable runlength-limited code
• A new approach to constructing optimal block codes for runlength-limited channels
• Almost-Certainly Runlength-Limiting Codes
• A block-decodable (1,8) runlength-limited rate 8/12 code

Cited in

(9)

• A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)
• Almost-Certainly Runlength-Limiting Codes
• Nested block decodable runlength-limited codes
• On the capacity of M-ary runlength-limited codes
• A block-decodable (1,8) runlength-limited rate 8/12 code
• scientific article; zbMATH DE number 65168 (Why is no real title available?)
• Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity
• A rate 4/6 (d=1, k=11) block-decodable runlength-limited code
• A new approach to constructing optimal block codes for runlength-limited channels

This page was built for publication: Constructions of almost block-decodable runlength-limited codes

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