login
Molien series for complete weight enumerator of self-dual code over GF(4) containing 1^n.
0

%I #18 Jun 13 2015 00:49:09

%S 1,1,1,2,3,3,6,7,8,11,14,15,21,24,27,33,39,42,52,58,64,74,84,90,105,

%T 115,125,140,155,165,186,201,216,237,258,273,301,322,343,371,399,420,

%U 456,484,512,548,584,612,657,693

%N Molien series for complete weight enumerator of self-dual code over GF(4) containing 1^n.

%H G. Nebe, E. M. Rains and N. J. A. Sloane, <a href="http://neilsloane.com/doc/cliff2.html">Self-Dual Codes and Invariant Theory</a>, Springer, Berlin, 2006.

%H E. M. Rains and N. J. A. Sloane, Self-dual codes, pp. 177-294 of Handbook of Coding Theory, Elsevier, 1998 (<a href="http://neilsloane.com/doc/self.txt">Abstract</a>, <a href="http://neilsloane.com/doc/self.pdf">pdf</a>, <a href="http://neilsloane.com/doc/self.ps">ps</a>).

%H <a href="/index/Mo#Molien">Index entries for Molien series</a>

%H <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,-1,-1,2,-1,-1,0,1,1,-1)

%F G.f.: (1+x^6)/((1-x)*(1-x^3)*(1-x^4)*(1-x^6)). - _Ralf Stephan_, Apr 29 2014

%F a(n) ~ 1/216*n^3. - _Ralf Stephan_, Apr 29 2014

%F G.f.: ( 1-x^2+x^4 ) / ( (1-x+x^2)*(1+x)^2*(1+x+x^2)^2*(x-1)^4 ). - _R. J. Mathar_, Dec 18 2014

%p (1+x^12)/((1-x^2)*(1-x^6)*(1-x^8)*(1-x^12));

%K nonn

%O 0,4

%A _N. J. A. Sloane_.