Reliability-based code-search algorithms for maximum-likelihood decoding of block codes

DOI10.1109/18.567691MaRDI QIDQ4336300zbMATH OpenOpenAlexFDO

Authors David Gazelle, Jakov Snyders

Publication date 12 May 1997

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

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

zbMATH Keywords

block codescode-search algorithmscomplexityefficient suboptimal decodersmaximum likelihood decodingML soft decoding algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 493101
• Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes
• An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder
• Reliability-based syndrome decoding of linear block codes

Cited in

(6)

• scientific article; zbMATH DE number 2127881 (Why is no real title available?)
• Complementary reliability-based decodings of binary linear block codes
• Reliability-based syndrome decoding of linear block codes
• scientific article; zbMATH DE number 2081151 (Why is no real title available?)
• An adaptive two-stage algorithm for ML and sub-ML decoding of binary linear block codes
• Soft decoding of short/medium length codes using ordered statistics for quantum key distribution

This page was built for publication: Reliability-based code-search algorithms for maximum-likelihood decoding of block codes

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