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

DOI10.1109/18.42214zbMATH Open0683.94012OpenAlexW2083351442MaRDI QIDQ4733828FDOQ4733828

Authors: Jakov Snyders, Yair Be'ery 

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

Recommendations

• scientific article; zbMATH DE number 493101
• On maximum likelihood soft-decision decoding of binary linear codes
• Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
• Fast algorithms for decoding the (23, 12) binary Golay code with four-error-correcting capability
• Efficient maximum likelihood decoding of linear block codes using a trellis

zbMATH Keywords

computational complexitybinary codesGolay codelinear block codesForney- Chase algorithmsMaximum likelihood soft decision decodingWagner rule

Mathematics Subject Classification ID

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

Cited In (7)

• Constrained designs for maximum likelihood soft decoding of \(\text{RM} (2,m)\) and the extended Golay codes
• Iterative decoding of parallel concatenated block codes and coset based MAP decoding algorithm for F24 code
• Title not available (Why is that?)
• Bounds on the dimension of codes and subcodes with prescribed contraction index
• Soft decoding of short/medium length codes using ordered statistics for quantum key distribution
• On maximum likelihood soft-decision decoding of binary linear codes
• Fast Essentially Maximum Likelihood Decoding of the Golden Code

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

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