相关论文: Bounds on ordered codes and orthogonal arrays
We develop a unified construction of matrix-valued orthogonal polynomials associated with discrete weights, yielding bispectral sequences as eigenfunctions of second-order difference operators. This general framework extends the discrete…
This paper delves into the Terwilliger algebra associated with the ordered Hamming scheme, which extends from the wreath product of one-class association schemes and was initially introduced by Delsarte as a natural expansion of the Hamming…
Consider the collection of hyperplanes in $\mathbb{R}^n$ whose defining equations are given by $\{x_i + x_j = 0\mid 1\leq i<j\leq n\}$. This arrangement is called the threshold arrangement since its regions are in bijection with labeled…
We characterize mixed-level orthogonal arrays in terms of algebraic designs in a special multigraph. We prove a mixed-level analog of the Bierbrauer-Friedman (BF) bound for pure-level orthogonal arrays and show that arrays attaining it are…
We provide two new characterizations of bounded orthogonally additive polynomials from a uniformly complete vector lattice into a convex bornological space using harmonic means and completely partitioned weighted geometric means. Our result…
Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…
Sum-rank codes have wide applications in multishot network coding, distributed storage and the construction of space-time codes. Asymptotically good sequences of linearized algebraic geometry sum-rank codes, exceeding the…
Binary self-orthogonal codes and balanced incomplete block designs are two combinatorial configurations that have been much studied because of their wide areas of application. In this paper, we have shown the distribution of (16; 6;…
We introduce a linear programming method to obtain bounds on the cardinality of codes in Grassmannian spaces for the chordal distance. We obtain explicit bounds, and an asymptotic bound that improves on the Hamming bound. Our approach…
Motivated by the similarities between the theory of spherical $t$-designs and that of $t$-designs in $Q$-polynomial association schemes, we study two versions of relative $t$-designs, the counterparts of Euclidean $t$-designs for $P$-…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
We consider the problem of deriving upper bounds on the parameters of sum-rank-metric codes, with focus on their dimension and block length. The sum-rank metric is a combination of the Hamming and the rank metric, and most of the available…
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…
An explicit expression for the general bivariate Krawtchouk polynomials is obtained in terms of the standard Krawtchouk and dual Hahn polynomials. The bivariate Krawtchouk polynomials occur as matrix elements of the unitary reducible…
We design new polynomials for representing threshold functions in three different regimes: probabilistic polynomials of low degree, which need far less randomness than previous constructions, polynomial threshold functions (PTFs) with…
We generalize the polynomial-time solvability of $k$-\textsc{Diverse Minimum s-t Cuts} (De Berg et al., ISAAC'23) to a wider class of combinatorial problems whose solution sets have a distributive lattice structure. We identify three…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…
An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamming spaces.