Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes

DOI10.1109/18.42214zbMath0683.94012OpenAlexW2083351442MaRDI QIDQ4733828

Yair Be'ery, Jakov Snyders

Publication date: 1989

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

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

zbMATH Keywords

computational complexitylinear block codesbinary codesGolay codeForney- Chase algorithmsMaximum likelihood soft decision decodingWagner rule

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15) Decoding (94B35)

Related Items (3)

Soft decoding of short/medium length codes using ordered statistics for quantum key distribution ⋮ Iterative decoding of parallel concatenated block codes and coset based MAP decoding algorithm for F24 code ⋮ Bounds on the dimension of codes and subcodes with prescribed contraction index

This page was built for publication: Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes