A new approach to constructing optimal block codes for runlength-limited channels

DOI10.1109/18.335889MaRDI QIDQ4838632zbMATH OpenOpenAlexFDO

Authors Jian Gu, Thomas E. Fuja

Publication date 15 November 1995

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

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

zbMATH Keywords

\((d,k)\)-constrained channelsfixed-length block codesmagnetic recordingoptical recordingrunlength codes

Mathematics Subject Classification ID

Source coding (94A29) Prefix, length-variable, comma-free codes (94A45) Other types of codes (94B60)

Recommendations

• Optimal block codes for M-ary runlength-constrained channels
• scientific article; zbMATH DE number 4207992
• Constructions of almost block-decodable runlength-limited codes
• Constructions of error-correcting DC-free block codes
• Constructing efficient DC-free runlength-limited block codes for recording channels

Cited in

(13)

• The enumeration of certain run length sequences
• scientific article; zbMATH DE number 4207992 (Why is no real title available?)
• Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity
• Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing
• Optimal Parsing Trees for Run-Length Coding of Biased Data
• scientific article; zbMATH DE number 65168 (Why is no real title available?)
• Enumerable multitrack (d, k) block codes
• Optimal block codes for M-ary runlength-constrained channels
• Constructing efficient DC-free runlength-limited block codes for recording channels
• On the principal state method for run-length limited sequences
• Constructions of almost block-decodable runlength-limited codes
• A rate 4/6 (d=1, k=11) block-decodable runlength-limited code
• Block codes for a class of constrained noiseless channels

This page was built for publication: A new approach to constructing optimal block codes for runlength-limited channels

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