| Summary: | Consider a linear code defined as a mapping between vector spaces of dimensions k and n. Let β* denote the minimal (relative) weight among all images of input vectors of full Hamming weight k. Operationally, β* characterizes the threshold for adversarial (erasure) noise beyond which decoder is guaranteed to produce estimate of k-input with 100% symbol error rate (SER). This paper studies the relation between β* and δ, the minimum distance of the code, which gives the threshold for 0 % SER. An optimal tradeoff between β* and δ is obtained (over large alphabets) and all linear codes achieving β* = 1 are classified: they are repetition-like. More generally, a design criteria is proposed for codes with favorable graceful degradation properties. As an example, it is shown that in an overdetermined system of n homogeneous linear equations in k variables (over a field) it is always possible to satisfy some k-1 equations with non-zero assignments to every unknown, provided that any subset of k equations is linearly independent. This statement is true if and only if n ≥ 2k - 1. Keywords: Linear codes; degradation; error correction codes; noise level; null space; hamming weight; error statistics
|
|---|
