Variants of Jacobi polynomials in coding theory
From MaRDI portal
Publication:2109384
DOI10.1007/s10623-021-00923-2zbMath1506.94090arXiv2102.06369OpenAlexW3197812658MaRDI QIDQ2109384
H. S. Chakraborty, Tsuyoshi Miezaki
Publication date: 21 December 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.06369
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Holomorphic modular forms of integral weight (11F11)
Related Items (3)
Jacobi polynomials and design theory. II ⋮ Jacobi polynomials and design theory I ⋮ Average of complete joint weight enumerators and self-dual codes
Cites Work
- The average of joint weight enumerators
- The average intersection number of a pair of self-dual codes
- Jacobi polynomials, type II codes, and designs.
- Average of complete joint weight enumerators and self-dual codes
- Weight enumerators, intersection enumerators, and Jacobi polynomials
- On the cycle index and the weight enumerator
- On the notion of Jacobi polynomials for codes
- Algebraic Coding Theory Over Finite Commutative Rings
- Generalizations of Gleason's theorem on weight enumerators of self-dual codes
- Note on the \(g\)-fold joint weight enumerators of self-dual codes over \({\mathbb Z}_k\)
This page was built for publication: Variants of Jacobi polynomials in coding theory