Title :
Generalization of the Norse bounds to codes of higher strength
Author :
Solé, P. ; Mehrotra, K.G.
Author_Institution :
CNRS, Valbonne, France
fDate :
1/1/1991 12:00:00 AM
Abstract :
The Norse bounds state that all codes of strength 1 and length n have covering radius at most n/2 and all self-complementary codes of strength 2 and length n have covering radius at most (n-√n)/2. This is generalized to arbitrary even values of strength, still assuming self-complementarity, and to odd strengths without this hypothesis. The proof techniques used are probabilistic
Keywords :
codes; Norse bounds; binary codes; covering radius; even strengths; higher strength; odd strengths; probabilistic proof; self-complementary codes; Binary codes; Hamming weight; Information science; Random variables; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on