Construction of insertion/deletion correcting RLL codes

P.A.H. Bours

doi:10.1109/ISIT.1993.748442

Construction of insertion/deletion correcting RLL codes

P.A.H. Bours

Mathematics and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

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 language	English
Title of host publication	Proceedings 1993 IEEE international symposium on information theory, ISIT 1993, San Antonio TX, USA, January 17-22, 1993
Pages	127-
DOIs	https://doi.org/10.1109/ISIT.1993.748442
Publication status	Published - 1993

Access to Document

10.1109/ISIT.1993.748442

Cite this

@inproceedings{e56c2182008946ac86361f29317788fd,

title = "Construction of insertion/deletion correcting RLL codes",

abstract = "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.",

author = "P.A.H. Bours",

year = "1993",

doi = "10.1109/ISIT.1993.748442",

language = "English",

pages = "127--",

booktitle = "Proceedings 1993 IEEE international symposium on information theory, ISIT 1993, San Antonio TX, USA, January 17-22, 1993",

}

TY - GEN

T1 - Construction of insertion/deletion correcting RLL codes

AU - Bours, P.A.H.

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT.1993.748442

DO - 10.1109/ISIT.1993.748442

M3 - Conference contribution

SP - 127-

BT - Proceedings 1993 IEEE international symposium on information theory, ISIT 1993, San Antonio TX, USA, January 17-22, 1993

ER -

Construction of insertion/deletion correcting RLL codes

Abstract

Access to Document

Fingerprint

Cite this