Related papers: Higher and extended Jacobi polynomials for codes
In this paper, we derive novel formulas and identities connecting Cauchy numbers and polynomials with both ordinary and generalized Stirling numbers, binomial coefficients, central factorial numbers, Euler polynomials, $r$-Whitney numbers,…
We use the relations between quadrics, trace codes and algebraic curves to construct algebraic curves over finite fields with many points and to compute generalized Hamming weights of codes.
The Equivalence Theorem states that, for a given weight on the alphabet, every linear isometry between linear codes extends to a monomial transformation of the entire space. This theorem has been proved for several weights and alphabets,…
Morphisms in the linear category A of Jacobi diagrams in handlebodies give rise to interesting contravariant functors on the category gr of finitely-generated free groups, encoding part of the composition structure of the category A. These…
We prove pointwise bounds for two-parameter families of Jacobi polynomials. Our bounds imply estimates for a class of functions arising from the spectral analysis of distinguished Laplacians and sub-Laplacians on the unit sphere in…
In this paper we present the generalization of the higher order q-Euler numbers and q-Genocchi numbers and w-Genocchi numbers and polynomials of high order using the multivariate fermionic p-adic integral on Zp. We have the interpolation…
For every linear binary code $C$, we construct a geometric triangular configuration $\Delta$ so that the weight enumerator of $C$ is obtained by a simple formula from the weight enumerator of the cycle space of $\Delta$. The triangular…
Some new bounds for the extreme zeroes of Jacobi polynomials are obtained with an elementary approach. A feature of these bounds is their simple forms, which make them easy to work with. Despite their simplicity, our lower bounds for the…
A semi-infinite weighted Hankel matrix with entries defined in terms of basic hypergeometric series is explicitly diagonalized as an operator on $\ell^{2}(\mathbb{N}_{0})$. The approach uses the fact that the operator commutes with a…
In this paper, we consider the problem of representing any polynomial in terms of the degenerate Bernoulli polynomials and more generally of the higher-order degenerate Bernoulli polynomials. We derive explicit formulas with the help of…
The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we…
We develop an algorithm to compute Fourier expansions of vector valued modular for Weil representations. As an application, we compute explicit linear equivalences of special divisors on modular varieties of orthogonal type. We define three…
The code equivalence problem is central in coding theory and cryptography. While classical invariants are effective for Hamming and rank metrics, the sum-rank metric, which unifies both, introduces new challenges. This paper introduces new…
In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain first and second order differential equations for the orthogonal polynomials and associated functions with a weight on the unit circle. We…
In this paper, we study linear codes over $\mathbb{Z}_k$ based on lattices and theta functions. We obtain the complete weight enumerators MacWilliams identity and the symmetrized weight enumerators MacWilliams identity based on the theory…
The main theorem in this paper is a far-reaching generalization of Gleason's theorem on the weight enumerators of codes which applies to arbitrary-genus weight enumerators of self-dual codes defined over a large class of finite rings and…
We prove two new forms of Jacobi-type J-fraction expansions generating the binomial coefficients, $\binom{x+n}{n}$ and $\binom{x}{n}$, over all $n \geq 0$. Within the article we establish new forms of integer congruences for these binomial…
As is well known the kernel of the orthogonal projector onto the polynomials of degree $n$ in $L^2(w_{\a,\b}, [-1, 1])$ with $w_{\a,\b}(t) = (1-t)^\a(1+t)^\b$ can be written in terms of Jacobi polynomials. It is shown that if the…
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we determine the explicit complete weight enumerators of two classes of linear codes over $\mathbb{F}_p$ and they…
The computation of the entries of Jacobi operators associated with orthogonal polynomials has important applications in numerical analysis. From truncating the operator to form a Jacobi matrix, one can apply the Golub--Welsh algorithm to…