Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing

DOI10.1109/TIT.2007.901203MaRDI QIDQ3548912zbMATH OpenFDO

Authors Yogesh Sankarasubramaniam, Steven W. McLaughlin

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• High-Rate Maximum Runlength Constrained Coding Schemes Using Nibble Replacement
• On a class of efficient error-limiting variable-length codes
• Runlength-limited codes for mixed-error channels
• Almost Instantaneous Fixed-to-Variable Length Codes
• scientific article; zbMATH DE number 2102735
• Bounds on the Rate of 2-D Bit-Stuffing Encoders
• A general error-correcting code construction for run-length limited binary channels
• Efficient error-limiting variable-length codes
• A new approach to constructing optimal block codes for runlength-limited channels
• Construction of fixed-length insertion/deletion correcting runlength-limited codes

Cited in

(4)

• Short <inline-formula> <tex-math notation="TeX">\(Q\) </tex-math></inline-formula>-Ary Fixed-Rate WOM Codes for Guaranteed Rewrites and With Hot/Cold Write Differentiation
• An Improvement to the Bit Stuffing Algorithm
• Bit-Stuffing Algorithms and Analysis for Run-Length Constrained Channels in Two and Three Dimensions
• A rate 4/6 (d=1, k=11) block-decodable runlength-limited code

This page was built for publication: Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing

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