A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient

DOI10.1109/18.556690zbMATH Open0873.94023OpenAlexW2128746908MaRDI QIDQ3129483

Ba-Zhong Shen, C. Wang, Kenneth K. Tzeng

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.556690

zbMATH Keywords

decoding complexitygeneralized minimum distance decodingbounded-distance decodingeffective error coefficienterrors-and-erasures decodingGaussian noise channels

Mathematics Subject Classification ID

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

Related Items (2)

An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder ⋮ Title not available (Why is that?)

This page was built for publication: A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient

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