On the notion of Jacobi polynomials for codes
The connection between theta functions and weight enumerators is well known [see e.g. \textit{W. Ebeling}, Lattices and codes. Braunschweig: Vieweg Verlag (1994; Zbl 0805.11048)]. The author introduces Jacobi polynomials in correspondence to Jacobi theta functions [see \textit{M. Eichler} and \textit{D. Zagier}, The theory of Jacobi forms. Boston etc.: Birkhäuser Verlag (1985; Zbl 0554.10018)]. The Jacobi polynomial of the code \(C\subseteq \mathbb F_q^n\) with respect to \(v\in \mathbb F_q^n\) is the polynomial \[ \text{Jac} (C,v\mid X,Z):= \sum_{u\in C}X^{u*u} Z^{u*v}, \] where \(u*v\) is number of components of \(u,v\) with \(u_iv_i\neq 0\). The author proves an identity which generalizes the MacWilliams identity and some further properties of these polynomials.
- Modular invariance property of association schemes, type II codes over finite rings and finite abelian groups and reminiscences of François Jaeger (a survey)
- Jacobi polynomials, type II codes, and designs.
- Type II codes over \(\mathbb F_2+ u\mathbb F_2\) and applications to Hermitian modular forms
- 3-colored 5-designs and \(\mathbb{Z}_4\)-codes
- A Gleason formula for Ozeki polynomials
- On the ring of simultaneous invariants for the Gleason-MacWilliams group
- Ternary codes and Jacobi forms
- Codes and Siegel modular forms
- Construction of Jacobi forms from certain combinatorial polynomials
- On covering radii and coset weight distributions of extremal binary self-dual codes of length 40
- Formal weight enumerators and Chebyshev polynomials
- Variants of Jacobi polynomials in coding theory
- Weight enumerators, intersection enumerators, and Jacobi polynomials
- Divisible formal weight enumerators and extremal polynomials not satisfying the Riemann hypothesis
- Broué-Enguehard maps and Atkin-Lehner involutions
- Weight enumerators, intersection enumerators and Jacobi polynomials. II
- Jacobi polynomials and design theory I
- Duality of codes and theta functions.
- Generalised Jacobians in Cryptography and Coding Theory
- Ozeki polynomials and Jacobi forms.
- Self-dual codes over $\mathbb {Z}_{4}$ and half-integral weight modular forms
- Rankin-Cohen brackets and invariant theory
- On the covering radius problem for ternary self-dual codes
- Exceptional designs in some extended quadratic residue codes
- Jacobi polynomials and design theory. II
- A note on t-designs in isodual codes
- Jacobi polynomials and harmonic weight enumerators of the first-order Reed–Muller codes and the extended Hamming codes
- Jacobi polynomials for the first-order generalized Reed-Muller codes
- Infinite series of 3-designs in the extended quadratic residue code
- 5-design and counter 5-design in the binary Golay code of length 24
- Jacobi polynomials, invariant rings, and generalized t-designs
- On some families of certain divisible polynomials and their zeta functions
- Zeta functions for formal weight enumerators and the extremal property
- An abundance of invariant polynomials satisfying the Riemann hypothesis
This page was built for publication: On the notion of Jacobi polynomials for codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4357734)
