An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder

DOI10.1109/18.312155zbMath0808.94028OpenAlexW2155316710MaRDI QIDQ4308768

Hiroshige Inazumi, Shigeichi Hirasawa, Toshimitsu Kaneko, Toshihisa Nishijima

Publication date: 10 October 1994

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

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

zbMATH Keywords

linear block codesmaximum-likelihood decodingsoft decoding algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Soft decoding of short/medium length codes using ordered statistics for quantum key distribution ⋮ Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations

This page was built for publication: An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder