Related papers: Higher and extended Jacobi polynomials for codes
This work proposes a higher-order iterative framework for solving matrix equations, inspired by the structure and functionality of neural networks. A modification of the classical Jacobi iterative method is introduced to compute…
It is well known that there is a deep relationship between codes and lattices. Concepts from coding theory are related to concepts of lattice theory as, for example, weight enumerators to theta series, MacWilliams identity to Jacobi…
Persymmetric Jacobi matrices are invariant under reflection with respect to the anti-diagonal. The associated orthogonal polynomials have distinctive properties that are discussed. They are found in particular to be also orthogonal on the…
Determining the weight distribution of a code is an old and fundamental topic in coding theory that has been thoroughly studied. In 1977, Helleseth, Kl{\o}ve, and Mykkeltveit presented a weight enumerator polynomial of the lifted code over…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
We define and study Jacobians of Hodge structures with weight greater than 1. Jacobians of weight 2 naturally come up in the context of the Brauer group and the Tate conjecture. They were previously studied in a special case by Beauville in…
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we solve one more special case. The problem of finding the weight distribution is transformed into a…
We study the bispectrality of Jacobi type polynomials, which are eigenfunctions of higher-order differential operators and can be defined by taking suitable linear combinations of a fixed number of consecutive Jacobi polynomials. Jacobi…
Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid $M$. Our main result is that these polynomials are determined by Betti numbers associated with graded…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
Sequences of orthogonal polynomials that are alternative to the Jacobi polynomials on the interval $[0,1]$ are defined and their properties are established. An $(\alpha,\beta)$-parameterized system of orthogonal polynomials of the…
Limiting cases are studied of the Koornwinder-Macdonald multivariable generalization of the Askey-Wilson polynomials. We recover recently and not so recently introduced families of hypergeometric orthogonal polynomials in several variables…
We look for spectral type differential equations satisfied by the generalized Jacobi polynomials which are orthogonal on the interval [-1,1] with respect to a weight function consisting of the classical Jacobi weight function together with…
We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…
In this paper, we introduce higher rank generalizations of Macdonald polynomials. The higher rank non-symmetric Macdonald polynomials are Laurent polynomials in several sets of variables which form weight bases for higher rank polynomial…
We discuss computing with hierarchies of families of (potentially weighted) semiclassical Jacobi polynomials which arise in the construction of multivariate orthogonal polynomials. In particular, we outline how to build connection and…
In this paper, we discuss the generalized Hamming weights of a class of linear codes associated with non-degenerate quadratic forms. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting…
We construct a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. The results show that they are at most three-weight codes and they are suitable for applications…
A hierarchy of matrix-valued polynomials which generalize the Jacobi polynomials is found. Defined by a Rodrigues formula, they are also products of a sequence of differential operators. Each class of polynomials is complete, satisfies a…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…