On the coveting radius of extremal self-dual codes
Edward F. Assmus, Vera S. Pless · IEEE Transactions on Information Theory · 1983
It is known that every self-dual binary code which is not doubly even is a "child" of a doubly even parent. It will be shown that an(n-2,(n-2)/2)child of an(n,n/2,d)doubly even parent has covering radius\geq d-1. Every extremal doubly even(32,16,8)code has covering radius6and every extremal doubly even(48,24,12)code has covering radius8. The complete coset weight distribution of the(32,16,8)quadratic residue code is given, as well as bounds or exact values for the covering radii of all extremai doubly even codes of length less than or equal to96.