Generalization of the Norse bounds to codes of higher strength
Patrick Solé, K. Mehrotra · IEEE Transactions on Information Theory · 1991
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- square root 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.>