On the notion of Jacobi polynomials for codes
From MaRDI portal
Publication:4357734
DOI10.1017/S0305004196001399zbMATH Open0888.94028OpenAlexW2039713167MaRDI QIDQ4357734FDOQ4357734
Authors: Michio Ozeki 
Publication date: 28 September 1997
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0305004196001399
Recommendations
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Jacobi forms (11F50)
Cited In (32)
- Rankin-Cohen brackets and invariant theory
- Weight enumerators, intersection enumerators and Jacobi polynomials. II
- A Gleason formula for Ozeki polynomials
- Divisible formal weight enumerators and extremal polynomials not satisfying the Riemann hypothesis
- Ternary codes and Jacobi forms
- On covering radii and coset weight distributions of extremal binary self-dual codes of length 40
- Jacobi polynomials for the first-order generalized Reed-Muller codes
- Broué-Enguehard maps and Atkin-Lehner involutions
- Generalised Jacobians in Cryptography and Coding Theory
- Jacobi polynomials and design theory. II
- Modular invariance property of association schemes, type II codes over finite rings and finite abelian groups and reminiscences of François Jaeger (a survey)
- Infinite series of 3-designs in the extended quadratic residue code
- Ozeki polynomials and Jacobi forms.
- A note on \(t\)-designs in isodual codes
- On the ring of simultaneous invariants for the Gleason-MacWilliams group
- Codes and Siegel modular forms
- 5-design and counter 5-design in the binary Golay code of length 24
- Construction of Jacobi forms from certain combinatorial polynomials
- Exceptional designs in some extended quadratic residue codes
- Duality of codes and theta functions.
- On the covering radius problem for ternary self-dual codes
- 3-colored 5-designs and \(\mathbb{Z}_4\)-codes
- Jacobi polynomials and design theory I
- Jacobi polynomials and harmonic weight enumerators of the first-order Reed–Muller codes and the extended Hamming codes
- 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
- Type II codes over \(\mathbb F_2+ u\mathbb F_2\) and applications to Hermitian modular forms
- Self-dual codes over $\mathbb {Z}_{4}$ and half-integral weight modular forms
- Formal weight enumerators and Chebyshev polynomials
- Weight enumerators, intersection enumerators, and Jacobi polynomials
- Variants of Jacobi polynomials in coding theory
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)
