Capacity-achieving M-ary runlength-limited codes

Steven W. McLaughlin

doi:10.1117/12.228235

8 December 1995 Capacity-achieving M-ary runlength-limited codes

Steven W. McLaughlin

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

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.

Citation Download Citation

Steven W. McLaughlin "Capacity-achieving M-ary runlength-limited codes", Proc. SPIE 2605, Coding and Signal Processing for Information Storage, (8 December 1995); https://doi.org/10.1117/12.228235

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available