Share Email Print

Proceedings Paper

Capacity-achieving M-ary runlength-limited codes
Author(s): Steven W. McLaughlin
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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.

Paper Details

Date Published: 8 December 1995
PDF: 10 pages
Proc. SPIE 2605, Coding and Signal Processing for Information Storage, (8 December 1995); doi: 10.1117/12.228235
Show Author Affiliations
Steven W. McLaughlin, Rochester Institute of Technology (United States)

Published in SPIE Proceedings Vol. 2605:
Coding and Signal Processing for Information Storage
Raghuveer M. Rao; Soheil A. Dianat; Steven W. McLaughlin; Martin Hassner, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?