Simplified correlation decoding by selecting possible codewords using erasure information (Corresp.)

DOI10.1109/TIT.1983.1056725zbMATH Open0512.94017MaRDI QIDQ3657915FDOQ3657915

Authors: Hatsukazu Tanaka, Koji Kakigahara 

Publication date: 1983

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• Class of algorithms for decoding block codes with channel measurement information
• Decoding algorithms with input quantization and maximum error correction capability
• A novel approach to soft decision decoding of threshold decodable codes (Corresp.)
• Bounded distance+1 soft-decision Reed-Solomon decoding
• Quasioptimal methods of correlational reception of Reed-Solomon codes

zbMATH Keywords

computer simulationerror-correcting codessoft-decision decodingerasure informationinformation digitsminimum block-error probability

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15) Decoding (94B35) Error probability in coding theory (94B70)

Cited In (2)

• Decoding algorithms with input quantization and maximum error correction capability
• Decay of Correlations for Sparse Graph Error Correcting Codes

This page was built for publication: Simplified correlation decoding by selecting possible codewords using erasure information (Corresp.)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3657915)