Abstract
Syndrome treillis is shown to be minimal. A simple proof of a lower bound to a code treillis nodes number is given. Complexity exponents bounds of maximal verisimilitude for soft decoding in a treillis is obtained. Though almost all codes satisfying the Varshamoff bound are at the upper complexity bound, the block codes obtained by cutting convolution codes have exponentially less complexity in a treillis. The hypothesis for exactitude of Varshamoff bound for binary codes being hold, the block codes decoding complexity is the minimal possible one.
| Original language | English |
|---|---|
| Pages (from-to) | 3-9 |
| Number of pages | 7 |
| Journal | Problemy Peredachi Informatsii |
| Issue number | 3 |
| State | Published - Jul 1993 |