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

DOI10.1109/18.567691zbMATH Open0878.94059OpenAlexW2170125046MaRDI QIDQ4336300FDOQ4336300

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

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

zbMATH Keywords

complexitymaximum likelihood decodingblock codescode-search algorithmsefficient suboptimal decodersML soft decoding algorithms

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Soft decoding of short/medium length codes using ordered statistics for quantum key distribution
• Complementary reliability-based decodings of binary linear block codes
• An adaptive two-stage algorithm for ML and sub-ML decoding of binary linear block codes
• Title not available (Why is that?)

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)