Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes

DOI10.1109/18.259636zbMath0802.94024OpenAlexW2798847826MaRDI QIDQ4307363

Carlos R. P. Hartmann, Chih-Chieh Chen, Yunghsiang Sam Han

Publication date: 3 October 1994

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

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

zbMATH Keywords

linear block codestrellisgeneralized Dijkstra algorithmmaximum-likelihood soft- decision decoding algorithmpriority-first searchsoft-decision

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (2)

Soft decoding of short/medium length codes using ordered statistics for quantum key distribution ⋮ Iterative reconfigurable tree search detection of MIMO systems

This page was built for publication: Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes