Title :
Constructive codes with unequal error protection
Author :
Englund, Eva K. ; Hansson, Anders I.
Author_Institution :
Nat. Defence Res. Establ., Linkoping, Sweden
fDate :
3/1/1997 12:00:00 AM
Abstract :
An asymptotic lower bound on the rates of two-level binary codes with unequal error protection is presented. The bound is based on a class of codes that are constructive in the sense that the description complexity is polynomial in the codeword length. In some cases, the bound exceeds an upper bound for linear codes, proving the existence of constructive nonlinear UEP codes that are better than any linear codes
Keywords :
binary sequences; computational complexity; concatenated codes; error correction codes; polynomials; UEP code; asymptotic lower bound; codeword length; constructive codes; description complexity; nonlinear codes; polynomial; two-level binary codes; unequal error protection; Binary codes; Broadcasting; Computational complexity; Decoding; Degradation; Encoding; Error correction codes; Linear code; Linearity; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
