4 problems

Binary-splitting decoding complexity conjecture. To find no false negatives, the decoding algorithm must examine subtrees of depth

Let a code ensemble be used with message-passing decoding over a large class of channels, and let its designed rate be a fraction $1-\epsilon$ of the channel capacity. McEliece's c…

Let $\boldsymbol{u}^k\stackrel{\triangle}{=}u_1u_2\cdots u_k$ be the transmitted information sequence. In the generalized Viterbi algorithm, let $\nu$ be the encoder constraint len…

Subsumption conjecture. Most of the existing structured linear space-time codes should be subsumed by the class of DDCs, and hence should be capable of exploiting the low decoding-…