An optimum symbol-by-symbol decoding rule for linear codes

DOI10.1109/TIT.1976.1055617MaRDI QIDQ4103435zbMATH OpenOpenAlexFDO

Authors Carlos R. P. Hartmann, Luther D. Rudolph

Publication date 1976

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

Full work available at URL https://doi.org/10.1109/tit.1976.1055617

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(4)

• Bit-optimal decoding of codes whose Tanner graphs are trees
• A survey on fast correlation attacks
• Vectorial approach to fast correlation attacks
• LDPC codes: A group algebra formulation

This page was built for publication: An optimum symbol-by-symbol decoding rule for linear codes

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