Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 524 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2004 |
| Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: 27 Jun 2004 → 2 Jul 2004 |