English
Related papers

Related papers: Higher and extended Jacobi polynomials for codes

200 papers

A two-variable generalization of the Big $-1$ Jacobi polynomials is introduced and characterized. These bivariate polynomials are constructed as a coupled product of two univariate Big $-1$ Jacobi polynomials. Their orthogonality measure is…

Classical Analysis and ODEs · Mathematics 2015-06-18 Vincent X. Genest , Jean-Michel Lemay , Luc Vinet , Alexei Zhedanov

We introduce a new multivariate orthogonal polynomial which is a 2-parameter deformation of the spherical polynomial by harmonic analysis on symmetric cone. This is also regarded as a multivariate analogue of the circular Jacobi polynomial.…

Classical Analysis and ODEs · Mathematics 2014-05-27 Genki Shibukawa

In this paper, we consider codes over finite fields, finite abelian groups, and finite Frobenius rings. For such codes, the complete weight enumerator and the Hamming weight enumerator serve as powerful tools. These two types of weight…

Information Theory · Computer Science 2025-11-03 S. T. Dougherty , C. Fernández-Córdoba

We investigate the differential equation for the Jacobi-type polynomials which are orthogonal on the interval $[-1,1]$ with respect to the classical Jacobi measure and an additional point mass at one endpoint. This scale of higher-order…

Classical Analysis and ODEs · Mathematics 2017-04-25 Clemens Markett

In the 1960s, MacWilliams proved that the Hamming weight enumerator of a linear code over a finite field completely determines, and is determined by, the Hamming weight enumerator of its dual code. In particular, if two linear codes have…

Information Theory · Computer Science 2026-01-07 Jay A. Wood

The aim of this paper is to develop a $(q,m)$-polymatroidal approach to higher supports and higher rank-weight enumerators of rank-metric codes. In this framework, we establish analogs of several fundamental results known for matroids and…

Combinatorics · Mathematics 2026-05-25 Koji Imamura , Shinya Kawabuchi , Keisuke Shiromoto

The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However,…

Information Theory · Computer Science 2023-10-19 Chao Liu , Dabin Zheng , Wei Lu , Xiaoqiang Wang

In this paper, we study higher derivations of Jacobian type in positive characteristic. We give a necessary and sufficient condition for $(n-1)$-tuples of polynomials to be extendable in the polynomial ring in $n$ variables over an integral…

Algebraic Geometry · Mathematics 2019-08-27 Takanori Nagamine

We express a weighted generalization of the Delannoy numbers in terms of shifted Jacobi polynomials. A specialization of our formulas extends a relation between the central Delannoy numbers and Legendre polynomials, observed over 50 years…

Combinatorics · Mathematics 2009-12-24 Gábor Hetyei

We construct new examples of exceptional Hahn and Jacobi polynomials. Exceptional polynomials are orthogonal polynomials with respect to a measure which are also eigenfunctions of a second order difference or differential operator. The most…

Classical Analysis and ODEs · Mathematics 2021-04-06 Antonio J. Durán

Orthogonal polynomials on the real line always satisfy a three-term recurrence relation. The recurrence coefficients determine a tridiagonal semi-infinite matrix (Jacobi matrix) which uniquely characterizes the orthogonal polynomials. We…

Classical Analysis and ODEs · Mathematics 2009-09-25 André Ronveaux , Walter Van Assche

We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of…

Number Theory · Mathematics 2011-11-11 Noam D. Elkies , Scott Duke Kominers

In this paper, for an odd prime power $q$, we extend the construction of Xie et al. \cite{XOYM2023} to propose two classes of linear codes $\mathcal{C}_{Q}$ and $\mathcal{C}_{Q}'$ over the finite field $\mathbb{F}_{q}$ with at most four…

Information Theory · Computer Science 2025-12-17 Xiumei Li , Xiaotong Sun , Min Sha

In this paper we present a systematic way to describe exceptional Jacobi polynomials via two partitions. We give the construction of these polynomials and restate the known aspects of these polynomials in terms of their partitions. The aim…

Classical Analysis and ODEs · Mathematics 2018-12-24 Niels Bonneux

We study the generalized rank weight distribution of a linear code. First, we provide a MacWilliams-type identity which relates the distributions of a code and its dual. Then, we give a formula for the enumerator polynomial. Finally, we…

Information Theory · Computer Science 2026-02-12 Julien Molina

Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…

Information Theory · Computer Science 2024-05-31 Wei Lu , Qingyao Wang , Xiaoqiang Wang , Dabin Zheng

Jacobi polynomials are mapped onto the continuous Hahn polynomials by the Fourier transform and the orthogonality relations for the continuous Hahn polynomials then follow from the orthogonality relations for the Jacobi polynomials and the…

Classical Analysis and ODEs · Mathematics 2009-09-25 Erik Koelink

We find all spectral type differential equations satisfied by the symmetric generalized ultraspherical polynomials which are orthogonal on the interval [-1,1] with respect to the classical symmetric weight function for the Jacobi…

Classical Analysis and ODEs · Mathematics 2007-05-23 J. Koekoek , R. Koekoek

The number-theoretic codes are a class of codes defined by single or multiple congruences. These codes are mainly used for correcting insertion and deletion errors, and for correcting asymmetric errors. This paper presents a formula for a…

Information Theory · Computer Science 2022-10-25 Takayuki Nozaki

In 1997 Rosenthal and York defined generalized Hamming weights for convolutional codes, by regarding a convolutional code as an infinite dimensional linear code endowed with the Hamming metric. In this paper, we propose a new definition of…

Information Theory · Computer Science 2022-07-26 Elisa Gorla , Flavio Salizzoni