Reliable communication over channels with insertions, deletions, and substitutions
Top Cited Papers
- 1 February 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 47 (2) , 687-698
- https://doi.org/10.1109/18.910582
Abstract
A new block code is introduced which is capable of correcting multiple insertion, deletion, and substitution errors. The code consists of nonlinear inner codes, which we call "watermark"" codes, concatenated with low-density parity-check codes over nonbinary fields. The inner code allows probabilistic resynchronization and provides soft outputs for the outer decoder, which then completes decoding. We present codes of rate 0.7 and transmitted length 5000 bits that can correct 30 insertion/deletion errors per block. We also present codes of rate 3/14 and length 4600 bits that can correct 450 insertion/deletion errors per block.Keywords
This publication has 21 references indexed in Scilit:
- Codes for data synchronization and timingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Evaluation of Gallager Codes for Short Block Length and High Rate ApplicationsPublished by Springer Nature ,2001
- Asymptotically good codes correcting insertions, deletions, and transpositionsIEEE Transactions on Information Theory, 1999
- Low-density parity check codes over GF(q)IEEE Communications Letters, 1998
- Nonbinary codes, correcting single deletion or insertion (Corresp.)IEEE Transactions on Information Theory, 1984
- On a family of error-correcting and synchronizable codes (Corresp.)IEEE Transactions on Information Theory, 1969
- On the capabilities of codes to correct synchronization errorsIEEE Transactions on Information Theory, 1967
- Comma-free error-correcting codesIEEE Transactions on Information Theory, 1965
- Bit loss and gain correction codeIEEE Transactions on Information Theory, 1962