Suboptimal decoding of linear codes: partition technique

DOI10.1109/18.556688zbMATH Open0876.94049OpenAlexW2137815176MaRDI QIDQ3129481FDOQ3129481

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)

Cited In (5)

• Tables of coverings for decoding by S-sets
• An Efficient Attack on All Concrete KKS Proposals
• Title not available (Why is that?)
• Suboptimum decoding of decomposable block codes
• On the complexity of suboptimal decoding for list and decision feedback schemes

   Recommendations

• Title not available (Why is that?) 👍 👎
• Decoding linear block codes using a priority-first search: performance analysis and suboptimal version 👍 👎
• Suboptimum decoding of decomposable block codes 👍 👎

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)