The covering radius of extremal self-dual code D11 and its application
Han-Ping Tsai · IEEE Transactions on Information Theory · 1997
D11, constructed by Conway and Sloane, is an extremal self-dual [56,28,12]-code with weight enumerator 1+8190y/sup 12/+622314y/sup 16/+11699688y/sup 20/+... . We find that the covering radius of D11 is 10. This shows that the inequality R(C/sub 56/)/spl les/10 cannot be improved any more, where R(C/sub 56/) is the covering radius of any extremal doubly even [56,28,12]-code C/sub 56/ and we use it to get ten new [58,29,10]-codes.