Related papers: Evaluation codes from linear systems of conics
While studying some properties of linear operators in a Euclidean Jordan algebra, Gowda, Sznajder and Tao have introduced generalized lattice operations based on the projection onto the cone of squares. In two recent papers of the authors…
Double Toeplitz (DT) codes are codes with a generator matrix of the form $(I,T)$ with $T$ a Toeplitz matrix, that is to say constant on the diagonals parallel to the main. When $T$ is tridiagonal and symmetric we determine its spectrum…
We provide a full classification scheme for exceptional Jacobi operators and polynomials. The classification contains six degeneracy classes according to whether $\alpha,\beta$ or $\alpha\pm\beta$ assume integer values. Exceptional Jacobi…
A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it…
Quickly convergent series are given to compute polyzeta numbers. The formula involves an intricate combination of (generalized) polylogarithms at 1/2. However, the combinatorics has a very simple geometric interpretation: it corresponds…
Preconditioning is essential in iterative methods for solving linear systems. It is also the implicit objective in updating approximations of Jacobians in optimization methods, e.g.,in quasi-Newton methods. Motivated by the latter, we study…
This paper investigates linear-time decoding algorithms for two classes of error-correcting codes. One of the classes is monotone codes which are known as single deletion codes. The other is azinv codes which are known as single balanced…
A straightforward algorithm for the symbolic computation of higher-order symmetries of nonlinear evolution equations and lattice equations is presented. The scaling properties of the evolution or lattice equations are used to determine the…
Strong asymptotics on the whole complex plane of a sequence of monic Jacobi polynomials $P_n^{(\alpha_n, \beta_n)}$ is studied, assuming that $$ \lim_{n\to\infty} \frac{\alpha_n}{n}=A, \qquad \lim_{n\to\infty} \frac{\beta _n}{n}=B, $$ with…
Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first…
We introduce a new method for studying universality of random matrices. Let T_n be the Jacobi matrix associated to the Dyson beta ensemble with uniformly convex polynomial potential. We show that after scaling, T_n converges to the…
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we provide a slightly different approach toward the general problem and use it to solve one more special…
Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…
The derivation of zonal polynomials involves evaluating the integral \[ \exp\left( - \frac{1}{2} \operatorname{tr} D_{\beta} Q D_{l} Q \right) \] with respect to orthogonal matrices \(Q\), where \(D_{\beta}\) and \(D_{l}\) are diagonal…
Hulls of linear codes have been of interest and extensively studied due to their rich algebraic structures and wide applications. In this paper, alternative characterizations of hulls of linear codes are given as well as their applications.…
This article is devoted to the computation of Jack connection coefficients, a generalization of the connection coefficients of two classical commutative subalgebras of the group algebra of the symmetric group: the class algebra and the…
Let $q$ be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on $\mathbb F_q[x_1,\dots,x_m]$ combined with the ideas in (M. Datta and T. Johnsen, 2022). Compared with…
The unique real root of cos(x) = x, recently referred to as the Dottie number, is expressed as an iteral of cosine. Using the derivatives of iterals, it is shown why this number is achieved starting from any real number, when the iterates…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
Association schemes are central objects in algebraic combinatorics, with the classical schemes lying at their core. These classical association schemes essentially consist of the Hamming and Johnson schemes, and their $q$-analogs: bilinear…