Suboptimal decoding of linear codes: partition technique

DOI10.1109/18.556688MaRDI QIDQ3129481zbMATH OpenOpenAlexFDO

Authors I. I. Dumer

Publication date 27 April 1997

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

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

zbMATH Keywords

shortest pathstrellis complexitytrellissymmetric channelsoutput-matched weightssuboptimal decoding algorithms

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 493106
• Decoding linear block codes using a priority-first search: performance analysis and suboptimal version
• Suboptimum decoding of decomposable block codes

Cited in

(5)

• An efficient attack on all concrete KKS proposals
• scientific article; zbMATH DE number 493106 (Why is no real title available?)
• On the complexity of suboptimal decoding for list and decision feedback schemes
• Suboptimum decoding of decomposable block codes
• Tables of coverings for decoding by \(S\)-sets

This page was built for publication: Suboptimal decoding of linear codes: partition technique

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