Abstract
In this work, 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 shall also extend a result due to Zehavi and Wolf (1988) on the capacity of binary (d, k) constraints to M-ary channels. Finally, we present examples of template codes: remarkably low-complexity (M,d,k) block codes which achieve the optimal rate without the use of enumeration.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
