Generalization of the Norse Bounds to Codes
The Norse bounds state that all codes (resp. all self-complementary codes) of strength 1 (resp. 2) and length n have covering radius at most n/2 (resp. n-√n / 2). We generalize this to arbitrary even values of strength, still assuming self-complementarity, and to odd strengths without this hypothesis. Our proof techniques are probabilistic.
Sole, P. and Mehrotra, Kishan, "Generalization of the Norse Bounds to Codes" (1989). Electrical Engineering and Computer Science - Technical Reports. 58.