Journal article
Random error and burst correction by iterated codes
IEEE transactions on information theory, Vol.18(1), pp.182-185
01/1972
DOI: 10.1109/TIT.1972.1054747
Abstract
We give a decoding algorithm for iterated codes that can correct up to the number of errors guaranteed by the product minimum distance, rather than about half that number when the iterated codes are decoded independently. This result is achieved by adapting Forney's generalized minimum distance decoding for use with iterated codes. We derive results on the simultaneous burst- and random-error-correction capability of iterated codes that improve considerably on known results.
Details
- Title: Subtitle
- Random error and burst correction by iterated codes
- Creators
- S Reddy - University of IowaJ Robinson - University of Iowa
- Resource Type
- Journal article
- Publication Details
- IEEE transactions on information theory, Vol.18(1), pp.182-185
- Publisher
- IEEE
- DOI
- 10.1109/TIT.1972.1054747
- ISSN
- 0018-9448
- eISSN
- 1557-9654
- Language
- English
- Date published
- 01/1972
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984197228202771
Metrics
16 Record Views