DocumentCode
2087902
Title
Asymptotically efficient, binary-compatible block codes for M-ary runlength-limited constraints
Author
McLaughlin, Steven W. ; Datta, Suparna
Author_Institution
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
fYear
1998
fDate
22-26 Jun 1998
Firstpage
88
Lastpage
89
Abstract
We present a new result on the capacity of M-ary runlength limited constraints and use it to construct asymptotically efficient block codes. The codes are constructed from permutation codes and are scalable with respect to M. The codes are useful in high-rate constrained coding and nonbinary optical recording systems that achieve both high density and backward compatibility to binary recording
Keywords
binary codes; block codes; optical storage; runlength codes; M-ary runlength-limited constraints; asymptotically efficient block codes; backward compatibility; binary codes; binary recording; binary-compatible block codes; capacity; high density recording; high-rate constrained coding; nonbinary codes; nonbinary optical recording systems; parallel encoding; permutation codes; Binary codes; Binary sequences; Block codes; Encoding; Hafnium; Optical recording; Probability distribution; Prototypes; Random variables;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 1998
Conference_Location
Killarney
Print_ISBN
0-7803-4408-1
Type
conf
DOI
10.1109/ITW.1998.706448
Filename
706448
Link To Document