Related papers: Evaluation codes from linear systems of conics
Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…
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…
Two families of certain nonsymmetric generalized Jacobi polynomials with negative integer indexes are used for solving third- and fifth-order two point boundary value problems subject to homogeneous and nonhomogeneous boundary conditions…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental…
In this paper, a linear $\ell$-intersection pair of codes is introduced as a generalization of linear complementary pairs of codes. Two linear codes are said to be a linear $\ell$-intersection pair if their intersection has dimension…
We investigate the zonal polynomials, a family of symmetric polynomials that appear in many mathematical contexts, such as multivariate statistics, differential geometry, representation theory, and combinatorics. We present two computer…
The projective space $\mathbb{P}_q(n)$, i.e. the set of all subspaces of the vector space $\mathbb{F}_q^n$, is a metric space endowed with the subspace distance metric. Braun, Etzion and Vardy argued that codes in a projective space are…
We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology…
In this manuscript, we introduce (symmetric) Tetranacci polynomials $\xi_j$ as a twofold generalization of ordinary Tetranacci numbers, by considering both non unity coefficients and generic initial values in their recursive definition. The…
An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length $\ell^tp^s$ are characterized, where $p$ is the characteristic of the finite…
For arbitrary $\beta > 0$, we use the orthogonal polynomials techniques developed by R. Killip and I. Nenciu to study certain linear statistics associated with the circular and Jacobi $\beta$ ensembles. We identify the distribution of these…
We analyze polarization-adjusted convolutional codes using the algebraic representation of polar and Reed-Muller codes. We define a large class of codes, called generalized polynomial polar codes which include PAC codes and Reverse PAC…
In this paper, we introduce Jacobi polynomial generalizations of several classical invariants in coding theory over finite fields, specifically, the higher and extended weight enumerators, and we establish explicit correspondences between…
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…
The use of partial geometries to construct parity-check matrices for LDPC codes has resulted in the design of successful codes with a probability of error close to the Shannon capacity at bit error rates down to $10^{-15}$. Such…
A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…
We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…
A modification of the symmetry approach for the classification of integrable differential-difference equations of the form $$ u_{n,t} = f_n(u_{n-1}, u_n, u_{n+1}), $$ where $n$ is a discrete integer variable, is presented (the well-known…
We study a family of PDEs, which was derived as an approximation of an extended Lotka-Volterra system, from the point of view of symmetries. Also, by performing the self adjoint classification on that family we offer special cases…
A "meta-analysis" is a method for comparison and combination of nonperturbative parton distribution functions (PDFs) in a nucleon obtained with heterogeneous procedures and assumptions. Each input parton distribution set is converted into a…