8 December 1995 Capacity-achieving M-ary runlength-limited codes
Author Affiliations +
Proceedings Volume 2605, Coding and Signal Processing for Information Storage; (1995) https://doi.org/10.1117/12.228235
Event: Photonics East '95, 1995, Philadelphia, PA, United States
We consider class of M-ary runlength-limited codes that achieve capacity and have the fewest number of encoder states. The codes apply to all M-ary (d,k) constraints with rational capacity. The codes have finite state encoders and sliding block with sliding block window size d plus 1.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Steven W. McLaughlin, Steven W. McLaughlin, } "Capacity-achieving M-ary runlength-limited codes", Proc. SPIE 2605, Coding and Signal Processing for Information Storage, (8 December 1995); doi: 10.1117/12.228235; https://doi.org/10.1117/12.228235

Back to Top