DocumentCode
2291046
Title
On the capacity of M-ary run-length-limited codes
Author
McLaughlin, Steven W. ; Luo, Jian ; Xie, Qun
Author_Institution
Dept. of Electr. Eng., Rochester Inst. of Technol., NY, USA
fYear
1995
fDate
17-22 Sep 1995
Firstpage
200
Abstract
We present two results on the Shannon capacity of M-ary (d,k) codes. First we show that 100-percent 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, we show that (unlike the binary case) for k=∞, there exist an infinite number of 100-percent efficient M-ary (d,k) codes and we construct one such code
Keywords
channel capacity; runlength codes; M-ary run-length-limited codes; Shannon capacity; binary case; fixed-rate codes; Eigenvalues and eigenfunctions; Magnetic recording; Optical recording; Saturation magnetization; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location
Whistler, BC
Print_ISBN
0-7803-2453-6
Type
conf
DOI
10.1109/ISIT.1995.531874
Filename
531874
Link To Document