Decoding linear block codes using a priority-first search: performance analysis and suboptimal version
From MaRDI portal
Publication:4400346
DOI10.1109/18.669296zbMath0906.94023OpenAlexW2145969665MaRDI QIDQ4400346
Kishan G. Mehrotra, Carlos R. P. Hartmann, Yunghsiang Han
Publication date: 18 October 1998
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.669296
linear block codesbinary BCH codebinary extended quadratic residue codegeneralized Dijkstra's algorithmmaximum-likelihood soft-decision decoding algorithmsuboptimal decoding algorithm
This page was built for publication: Decoding linear block codes using a priority-first search: performance analysis and suboptimal version