Construction of insertion/deletion correcting RLL codes

P.A.H. Bours

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


An algorithm is presented for the construction of fixed length insertion/ deletion correcting RLL codes. This algorithm uses one or more fixed length q-ary cod:s with given Lee-distance to generate fixed length binary (d, k)-constrained codewords. This construction can be used for all possible (d, k)-constraints.
Original languageEnglish
Title of host publicationProceedings 1993 IEEE international symposium on information theory, ISIT 1993, San Antonio TX, USA, January 17-22, 1993
Publication statusPublished - 1993


Dive into the research topics of 'Construction of insertion/deletion correcting RLL codes'. Together they form a unique fingerprint.

Cite this