%I A016729
%S A016729 1,2,2,2,3,4,3,4,4,4,5,6,5,6,6,6,7,8,7,8,8,8
%N A016729 Highest minimal Hamming distance of any Type 4^H+ Hermitian additive 
               self-dual code over GF(4) of length n.
%D A016729 P. Gaborit and A. Otmani, Experimental construction of self-dual codes, 
               Prepint.
%H A016729 G. Nebe, E. M. Rains and N. J. A. Sloane, <a href="http://www.research.att.com/
               ~njas/doc/cliff2.html">Self-Dual Codes and Invariant Theory</a>, 
               Springer, Berlin, 2006.
%H A016729 A. R. Calderbank, E. M. Rains, P. W. Shor and N. J. A. Sloane, <a href="http:/
               /arXiv.org/abs/quant-ph/9608006">Quantum error correction via codes 
               over GF(4)</a>, IEEE Trans. Inform. Theory, 44 (1998), 1369-1387.
%H A016729 P. Gaborit, <a href="http://www.unilim.fr/pages_perso/philippe.gaborit/
               SD/">Tables of Self-Dual Codes</a>
%H A016729 E. M. Rains and N. J. A. Sloane, Self-dual codes, pp. 177-294 of Handbook 
               of Coding Theory, Elsevier, 1998; (<a href="http://www.research.att.com/
               ~njas/doc/self.txt">Abstract</a>, <a href="http://www.research.att.com/
               ~njas/doc/self.pdf">pdf</a>, <a href="http://www.research.att.com/
               ~njas/doc/self.ps">ps</a>).
%Y A016729 Cf. A105674, A105675, A105676, A105677, A105678, A066016, A105681, A105682.
%Y A016729 A105687 gives the number of codes with this minimal distance.
%Y A016729 Sequence in context: A057748 A057747 A152803 this_sequence A060473 A055034 
               A112184
%Y A016729 Adjacent sequences: A016726 A016727 A016728 this_sequence A016730 A016731 
               A016732
%K A016729 nonn
%O A016729 1,2
%A A016729 N. J. A. Sloane (njas(AT)research.att.com). Entry revised May 06 2005
%E A016729 The sequence continues: a(23) = 8 or 9, a(24) = 8, 9 or 10, a(25) = 8 
               or 9, ...