Error-erasure decoding of product codes (Corresp.)
- 1 November 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 18 (6), 821-823
- https://doi.org/10.1109/tit.1972.1054922
Abstract
Two error-erasure decoding algorithms for product codes that correct all the error-erasure patterns guaranteed correctable by the minimum Hamming distance of the product code are given. The first algorithm works when at least one of the component codes is majority-logic decodable. The second algorithm works for any product code. Both algorithms use the decoders of the component codes.Keywords
This publication has 10 references indexed in Scilit:
- Random error and burst correction by iterated codesIEEE Transactions on Information Theory, 1972
- Decoding binary block codes onQ-ary output channelsIEEE Transactions on Information Theory, 1971
- On decoding iterated codesIEEE Transactions on Information Theory, 1970
- Further results on cyclic product codesIEEE Transactions on Information Theory, 1970
- Further results on product codesIEEE Transactions on Information Theory, 1970
- Cascade Decoding of Cyclic Product CodesIEEE Transactions on Communications, 1968
- Generalized minimum distance decodingIEEE Transactions on Information Theory, 1966
- Cyclic product codesIEEE Transactions on Information Theory, 1965
- THRESHOLD DECODINGPublished by Defense Technical Information Center (DTIC) ,1963
- Error-free CodingTransactions of the IRE Professional Group on Information Theory, 1954