Variants of Jacobi polynomials in coding theory

DOI10.1007/S10623-021-00923-2zbMATH Open1506.94090arXiv2102.06369OpenAlexW3197812658MaRDI QIDQ2109384FDOQ2109384

Authors: H. S. Chakraborty, Tsuyoshi Miezaki 

Publication date: 21 December 2022

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: In this paper, we introduce the notion of the complete joint Jacobi polynomial of two linear codes of length $n$ over $mathbb{F}_q$ and $mathbb{Z}_k$. We give the MacWilliams type identity for the complete joint Jacobi polynomials of codes. We also introduce the concepts of the average Jacobi polynomial and the average complete joint Jacobi polynomial over $mathbb{F}_q$ and $mathbb{Z}_k$. We give a representation of the average of the complete joint Jacobi polynomials of two linear codes of length $n$ over $mathbb{F}_q$ and $mathbb{Z}_k$ in terms of the compositions of $n$ and its distribution in the codes. Further we present a generalization of the representation for the average of the $(g+1)$-fold complete joint Jacobi polynomials of codes over $mathbb{F}_q$ and $mathbb{Z}_k$. Finally, we give the notion of the average Jacobi intersection number of two codes.

Full work available at URL: https://arxiv.org/abs/2102.06369

Recommendations

• On the notion of Jacobi polynomials for codes
• scientific article; zbMATH DE number 3965972
• Jacobi polynomials, type II codes, and designs.
• Generalised Jacobians in Cryptography and Coding Theory
• Applications of Jacobsthal and Jacobsthal-Lucas numbers in coding theory
• scientific article; zbMATH DE number 4155150
• Jacobi polynomials for singly even self-dual codes and the covering radius problems
• Ternary codes and Jacobi forms
• Permutation polynomials and applications to coding theory
• Encoding through generalized polynomial codes

zbMATH Keywords

codesJacobi polynomialsweight enumerators

Mathematics Subject Classification ID

Holomorphic modular forms of integral weight (11F11) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Cites Work

• Generalizations of Gleason's theorem on weight enumerators of self-dual codes
• The average of joint weight enumerators
• Note on the \(g\)-fold joint weight enumerators of self-dual codes over \({\mathbb Z}_k\)
• Jacobi polynomials, type II codes, and designs.
• On the notion of Jacobi polynomials for codes
• Algebraic Coding Theory Over Finite Commutative Rings
• The average intersection number of a pair of self-dual codes
• Average of complete joint weight enumerators and self-dual codes
• On the cycle index and the weight enumerator
• Weight enumerators, intersection enumerators, and Jacobi polynomials

Cited In (7)

• Ternary codes and Jacobi forms
• Jacobi polynomials for the first-order generalized Reed-Muller codes
• Generalised Jacobians in Cryptography and Coding Theory
• Jacobi polynomials and design theory. II
• Jacobi polynomials and design theory I
• A coding theoretical interpretation of Gaussian-Pell polynomials
• Average of complete joint weight enumerators and self-dual codes

This page was built for publication: Variants of Jacobi polynomials in coding theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109384)