Weighted Generating Functions for Type II Lattices and Codes

Details Weighted Generating Functions for Type II Lattices and Codes Weighted Generating Functions for Type II Lattices and Codes

2011-11-10

arxiv.org/abs/1111.2392v1

Mathematics

Number Theory

34 pages

Scientific paper

We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of Euclidean lattices. Namely, we use the finite-dimensional representation theory of sl_2 to derive a decomposition theorem for the spaces of discrete homogeneous polynomials in terms of the spaces of discrete harmonic polynomials, and prove a generalized MacWilliams identity for harmonic weight enumerators. We then present several applications of harmonic weight enumerators, corresponding to some uses of weighted theta functions: an equivalent characterization of t-designs, the Assmus-Mattson Theorem in the case of extremal Type II codes, and configuration results for extremal Type II codes of lengths 8, 24, 32, 48, 56, 72, and 96.

Affiliated with

Also associated with

No associations

Rating

Weighted Generating Functions for Type II Lattices and Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Weighted Generating Functions for Type II Lattices and Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weighted Generating Functions for Type II Lattices and Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-727679