Variants of Jacobi polynomials in coding theory

From MaRDI portal
Publication:2109384




Abstract: In this paper, we introduce the notion of the complete joint Jacobi polynomial of two linear codes of length n over mathbbFq and mathbbZk. 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 mathbbFq and mathbbZk. We give a representation of the average of the complete joint Jacobi polynomials of two linear codes of length n over mathbbFq and mathbbZk 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 mathbbFq and mathbbZk. Finally, we give the notion of the average Jacobi intersection number of two 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)