Weight enumerators, intersection enumerators and Jacobi polynomials II

2021/11/19 by Himadri Shekhar Chakraborty, Chakraborty, Himadri Shekhar, Tsuyoshi Miezaki +3 · 1 citation
Computer Science · Mathematics · #11F11 #Advanced Algebra and Geometry #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Number Theory (math.NT) #Primary 94B05 #Secondary 11T71

paper · pdf · doi:10.48550/arxiv.2111.10162

openalex publication_date 2021/11/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In the present paper, we introduce the concepts of Jacobi polynomials and intersection enumerators of codes over \mathbbF_q and ℤ_k for arbitrary genus g. We also discuss the interrelation among them. Finally, we give the MacWilliams type identities for Jacobi polynomials.

Cited by

• Higher and extended Jacobi polynomials for codes

Related

• Higher and extended Jacobi polynomials for codes
• Jacobi polynomials, invariant rings, and generalized t-designs
• Variants of Jacobi polynomials in coding theory
• Jacobi polynomials and harmonic weight enumerators of the first-order Reed--Muller codes and the extended Hamming codes
• Harmonic higher and extended weight enumerators