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

DOI10.1109/TIT.1976.1055617zbMath0336.94006OpenAlexW2115198523MaRDI QIDQ4103435

Luther D. Rudolph, Carlos R. P. Hartmann

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)

Related Items (4)

A survey on fast correlation attacks ⋮ Unnamed Item ⋮ Bit-optimal decoding of codes whose Tanner graphs are trees ⋮ Vectorial approach to fast correlation attacks

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