login
If C is a doubly-even binary code of length N=24m+n, 1 <= n <= 24, then the minimum distance of C^perp is bounded above by 4m+a(n).
1

%I #7 May 13 2019 00:40:24

%S 1,1,1,2,1,2,3,4,1,2,2,2,2,3,3,4,4,4,3,4,5,6,7,8

%N If C is a doubly-even binary code of length N=24m+n, 1 <= n <= 24, then the minimum distance of C^perp is bounded above by 4m+a(n).

%C Coincides with beginning of A066016, although of course that sequence is infinite.

%H E. M. Rains, <a href="https://doi.org/10.1006/ffta.1999.0258">Bounds for self-dual codes over Z_4</a>, Finite Fields Appl. 6 (2000), 146-163.

%K nonn,fini,full

%O 1,4

%A _N. J. A. Sloane_, Sep 13 2004