Title :
Optimal block codes for M-ary runlength-limited channels
Author :
McLaughlin, Steven W. ; Datta, Supama
Author_Institution :
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
Abstract :
In this paper we consider the analysis and design of optimal block-decodable M-ary runlength-limited (RLL) codes. We present two general construction methods: one based on permutation codes due to Datta and McLaughlin (1999), and the other a nonbinary generalization of the binary enumeration methods of Patrovics and Immink (1996), and Gu and Fuja (1994). The construction based on permutation codes is simple and asymptotically (in block-length) optimal, while the other construction is optimal in the sense that the resulting codes have the highest rate among all block-decodable codes for any block-length. In the process, we also prove a new result on the capacity of(M,d,k) constraints. Finally, we present examples of remarkably low-complexity (M,d,k) block codes which achieve the optimal rate without the use of enumeration
Keywords :
block codes; channel capacity; channel coding; runlength codes; M-ary runlength-limited channels; RLL codes; asymptotically optimal construction; binary enumeration methods; block-decodable codes; capacity; low-complexity (M,d,k) block codes; nonbinary generalization; optimal block codes; permutation codes; Algorithm design and analysis; Artificial intelligence; Binary sequences; Block codes; Decoding; Design engineering; Information rates; Optical recording; Random variables; Table lookup;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866438