TY - JOUR

T1 - Minimum basis search algorithm for nearly maximum likelihood decoding of block codes

AU - Ben-Yishai, Michael

AU - Snyders, Jakov

PY - 2004

Y1 - 2004

N2 - With any parity check matrix H of a code C(n, k, d) one may associate a graph whose vertices represent distinct bases, i.e., sets of n-k independent columns of H. Such basis specifies a unique error pattern. A search is carried out over a limited part of the bases graph for an error pattern having the minimum confidence value. Properties of the bases graph are utilized to reduce the complexity of the search procedure. Bounds are derived for the worst case computational complexity as well as for the correct-decoding probability.

AB - With any parity check matrix H of a code C(n, k, d) one may associate a graph whose vertices represent distinct bases, i.e., sets of n-k independent columns of H. Such basis specifies a unique error pattern. A search is carried out over a limited part of the bases graph for an error pattern having the minimum confidence value. Properties of the bases graph are utilized to reduce the complexity of the search procedure. Bounds are derived for the worst case computational complexity as well as for the correct-decoding probability.

UR - http://www.scopus.com/inward/record.url?scp=5044245473&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:5044245473

SN - 2157-8097

SP - 524

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - Proceedings - 2004 IEEE International Symposium on Information Theory

Y2 - 27 June 2004 through 2 July 2004

ER -