A survey of error-correcting codes for channels with symbol synchronization errors
Authors:
Top Cited Papers
- 1 January 2010
- journal article
- review article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Surveys & Tutorials
- Vol. 12 (1) , 87-96
Abstract
We present a comprehensive survey of error-correcting codes for channels corrupted by synchronization errors. We discuss potential applications as well as the obstacles that need to be overcome before such codes can be used in practical systems.Keywords
This publication has 89 references indexed in Scilit:
- Some combinatorial constructions for optimal perfect deletion-correcting codesDesigns, Codes and Cryptography, 2008
- Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codesDesigns, Codes and Cryptography, 2008
- Construction of deletion correcting codes using generalized Reed–Solomon codes and their subcodesDesigns, Codes and Cryptography, 2006
- Constructions for Perfect 5-Deletion-Correcting Codes of Length$7$IEEE Transactions on Information Theory, 2006
- On perfect deletion‐correcting codesJournal of Combinatorial Designs, 2003
- Insertion/deletion correcting coding schemes based on convolution codingElectronics Letters, 2002
- On the construction of perfect deletion-correcting codes using design theoryDesigns, Codes and Cryptography, 1995
- A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codesIEEE Transactions on Information Theory, 1993
- On perfect codes in deletion and insertion metricDiscrete Mathematics and Applications, 1992
- Bit loss and gain correction codeIEEE Transactions on Information Theory, 1962