Prefixing method for correcting repetition errors
Dolecek, L.
Anantharam, V.
EECS Dept., Massachusetts Inst. of Technol., Cambridge, MA;
This paper appears in: Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Publication Date: 6-11 July 2008
On page(s): 965-969
Location: Toronto, ON,
ISBN: 978-1-4244-2256-2
INSPEC Accession Number: 10156550
Digital Object Identifier: 10.1109/ISIT.2008.4595130
Current Version Published: 2008-08-08
Abstract
We develop a prefixing method for correcting any prescribed number r of repetition errors in an arbitrary binary block code. The proposed method constructs a prefix for each codeword such that the resulting strings are all of the same length and despite any r repetitions in the concatenation of the prefix and the codeword, the original codeword can be recovered. Further, the prefix length scales logarithmically with the blocklength of the original code, so the added redundancy is asymptotically negligible.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
