DocumentCode
1230884
Title
On the capacity of M-ary runlength-limited codes
Author
McLaughlin, Steven W. ; Luo, Jian ; Xie, Qun
Author_Institution
Dept. of Electr. Eng., Rochester Inst. of Technol., NY, USA
Volume
41
Issue
5
fYear
1995
fDate
9/1/1995 12:00:00 AM
Firstpage
1508
Lastpage
1511
Abstract
Presents two results on the Shannon capacity of M-ary (d,k) codes. First the authors show that 100% efficient fixed-rate codes are impossible for all values of (M,d,k), 0⩽d<k<∞, M<∞, thereby extending a result of Ashley and Siegel (1987) to M-ary channels. Second, they show that for k=∞, there exist an infinite number of 100% efficient M-ary (d,k) codes, and they construct three such capacity-achieving codes
Keywords
binary sequences; channel capacity; runlength codes; (d,k) codes; M-ary channels; M-ary runlength-limited codes; Shannon capacity; capacity-achieving codes; fixed-rate codes; Autocorrelation; Binary sequences; Combinatorial mathematics; Equations; Galois fields; Magnetic recording; Optical recording; Polynomials; Saturation magnetization; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.412712
Filename
412712
Link To Document