اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWeighted Generating Functions for Type II Lattices and Codes
154
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
We prove configuration results for extremal Type II codes, analogous to the configuration results of Ozeki and of the second author for extremal Type II lattices. Specifically, we show that for $n in {8, 24, 32, 48, 56, 72, 96}$ every extremal Type I
I code of length $n$ is generated by its codewords of minimal weight. Where Ozeki and Kominers used spherical harmonics and weighted theta functions, we use discrete harmonic polynomials and harmonic weight enumerators. Along we way we introduce $tfrac12$-designs as a discrete analog of Venkovs spherical designs of the same name.
This paper is concerned with a class of partition functions $a(n)$ introduced by Radu and defined in terms of eta-quotients. By utilizing the transformation laws of Newman, Schoeneberg and Robins, and Radus algorithms, we present an algorithm to find
Ramanujan-type identities for $a(mn+t)$. While this algorithm is not guaranteed to succeed, it applies to many cases. For example, we deduce a witness identity for $p(11n+6)$ with integer coefficients. Our algorithm also leads to Ramanujan-type identities for the overpartition functions $overline{p}(5n+2)$ and $overline{p}(5n+3)$ and Andrews--Paules broken $2$-diamond partition functions $triangle_{2}(25n+14)$ and $triangle_{2}(25n+24)$. It can also be extended to derive Ramanujan-type identities on a more general class of partition functions. For example, it yields the Ramanujan-type identities on Andrews singular overpartition functions $overline{Q}_{3,1}(9n+3)$ and $ overline{Q}_{3,1}(9n+6)$ due to Shen, the $2$-dissection formulas of Ramanujan and the $8$-dissection formulas due to Hirschhorn.
We show that, if L is an extremal Type II lattice of rank 40 or 80, then L is generated by its vectors of norm min(L)+2. This sharpens earlier results of Ozeki, and the second author and Abel, which showed that such lattices L are generated by their vectors of norms min(L) and min(L)+2.
We give a new, purely coding-theoretic proof of Kochs criterion on the tetrad systems of Type II codes of length 24 using the theory of harmonic weight enumerators. This approach is inspired by Venkovs approach to the classification of the root syste
ms of Type II lattices in R^{24}, and gives a new instance of the analogy between lattices and codes.
New series of $2^{2m}$-dimensional universally strongly perfect lattices $Lambda_I $ and $Gamma_J $ are constructed with $$2BW_{2m} ^{#} subseteq Gamma _J subseteq BW_{2m} subseteq Lambda _I subseteq BW _{2m}^{#} .$$ The lattices are found by restric
ting the spin representations of the automorphism group of the Barnes-Wall lattice to its subgroup ${mathcal U}_m:={mathcal C}_m (4^H_{bf 1}) $. The group ${mathcal U}_m$ is the Clifford-Weil group associated to the Hermitian self-dual codes over ${bf F} _4$ containing ${bf 1}$, so the ring of polynomial invariants of ${mathcal U}_m$ is spanned by the genus-$m$ complete weight enumerators of such codes. This allows us to show that all the ${mathcal U}_m$ invariant lattices are universally strongly perfect. We introduce a new construction, $D^{(cyc)}$ for chains of (extended) cyclic codes to obtain (bounds on) the minimum of the new lattices.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
