Suboptimal decoding of linear codes: partition technique

DOI10.1109/18.556688zbMath0876.94049OpenAlexW2137815176MaRDI QIDQ3129481

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 channelssuboptimal decoding algorithmsoutput-matched weights

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (3)

Tables of coverings for decoding by S-sets ⋮ On the complexity of suboptimal decoding for list and decision feedback schemes ⋮ An Efficient Attack on All Concrete KKS Proposals

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