By Topic

Construction of fixed-length insertion/deletion correcting runlength-limited codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
A. H. Bours ; Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands

An algorithm is presented for the construction of fixed-length insertion/deletion correcting runlength-limited (RLL) codes. In this construction binary (d,k)-constrained codewords are generated by codewords of a q-ary Lee metric based code. It is shown that this new construction always yields better codes than known constructions. The use of a q-ary Lee (1987) metric code (q odd) is based on the assumption that an error (insertion, deletion, or peak-shift) has maximal size (q-1)/2. It is shown that a decoding algorithm for the Lee metric code can be extended so that it can also be applied to insertion/deletion correcting RLL codes. Furthermore, such an extended algorithm can also correct some error patterns containing errors of size more than (q-1)/2. As a consequence, if s denotes the maximal size of an error, then in some cases the alphabet size of the generating code can be s+1 instead of 2·s+1

Published in:

IEEE Transactions on Information Theory  (Volume:40 ,  Issue: 6 )