On decoding iterated codes
- 1 September 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 16 (5), 624-627
- https://doi.org/10.1109/tit.1970.1054504
Abstract
Algorithms to decode iterated codes when at least one of the "component codes" is majority decodable are given. The decoding algorithms allow the use of the decoders of the component codes and still make it possible to correct all error patterns guaranteed to be correctable by the minimum distance of the iterated code.Keywords
This publication has 6 references indexed in Scilit:
- The equivalence of L-step orthogonalization and a Reed decoding procedure (Corresp.)IEEE Transactions on Information Theory, 1969
- A decoding algorithm for some convolutional codes constructed from block codesInformation and Control, 1968
- Cascade Decoding of Cyclic Product CodesIEEE Transactions on Communications, 1968
- 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