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.

The authors thank Manabu Oura for helpful discussions. The authors would also like to thank the anonymous reviewers for their beneficial comments on an earlier version of the manuscript. The second named author is supported by JSPS KAKENHI (18K03217).

Authors and Affiliations

1. Graduate School of Natural Science and Technology, Kanazawa University, Ishikawa, 920-1192, Japan

   Himadri Shekhar Chakraborty

2. Department of Mathematics, Shahjalal University of Science and Technology, Sylhet, 3114, Bangladesh

   Himadri Shekhar Chakraborty

3. Faculty of Science and Engineering, Waseda University, Tokyo, 169-8555, Japan

   Tsuyoshi Miezaki

Corresponding author

Correspondence toHimadri Shekhar Chakraborty.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This is one of several papers published inDesigns, Codes and Cryptography comprising the “Special Issue: On Coding Theory and Combinatorics: In Memory of Vera Pless”

Reprints and permissions