Reliable communication over channels with insertions, deletions, and substitutions

Authors:
M. C. Davey;D. J.C. Mackay
Affiliations:
Cooperative Res. Centre for Enterprise Distrib. Syst., Brisbane, Qld.;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 17

Construction of deletion correcting codes using generalized Reed---Solomon codes and their subcodes

Designs, Codes and Cryptography
Text luminance modulation for hardcopy watermarking

Signal Processing
Keyboards and covert channels

USENIX-SS'06 Proceedings of the 15th conference on USENIX Security Symposium - Volume 15
A Survey of Results for Deletion Channels and Related Synchronization Channels

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Simplification of packet-symbol decoding with errors, deletions, misordering of packets, and no sequence numbers

IEEE Transactions on Information Theory
Moment balancing templates: constructions to add insertion/deletion correction capability to error correcting or constrained codes

IEEE Transactions on Information Theory
Convolutional decoding in the presence of synchronization errors

IEEE Journal on Selected Areas in Communications
Soft feature-based watermark decoding with insertion/deletion correction

IH'07 Proceedings of the 9th international conference on Information hiding
Undetected errors in quasi-cyclic LDPC codes caused by receiver symbol slips

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Achievable information rates for channels with insertions, deletions, and intersymbol interference with i.i.d. inputs

IEEE Transactions on Communications
Codes for deletion and insertion channels with segmented errors

IEEE Transactions on Information Theory
Audio watermarking scheme robust against desynchronization based on the dyadic wavelet transform

EURASIP Journal on Advances in Signal Processing
Correcting deletions using linear and cyclic codes

IEEE Transactions on Information Theory
Low Disruption Transformations on Cyclic Automata

Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Spectrum of Sizes for Perfect Deletion-Correcting Codes

SIAM Journal on Discrete Mathematics
New constructive approach to covert channel modeling and channel capacity estimation

ISC'05 Proceedings of the 8th international conference on Information Security
Enforcing dynamic spectrum access with spectrum permits

Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing

Quantified Score

Hi-index	755.08

Visualization

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