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. © 1970, IEEE. All rights reserved.
Cite
CITATION STYLE
APA
Reddy, S. M. (1970). On Decoding Iterated Codes. IEEE Transactions on Information Theory, 16(5), 624–627. https://doi.org/10.1109/TIT.1970.1054504
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free