相关论文: Schubert Varieties, Linear Codes and Enumerative C…
We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes beyond the reach of techniques for classical codes capable of even capturing the true minimum distance for some cases. These bounds are…
We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…
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…
Linear programming approaches have been applied to derive upper bounds on the size of classical codes and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance, including nonadditive…
The self-dual spaces of polynomials are related to Bethe vectors in the Gaudin model associated to the Lie algebras of types B and C. In this paper, we give lower bounds for the numbers of real self-dual spaces in intersections of Schubert…
We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all…
Recent interest on permutation rank modulation shows the Kendall tau metric as an important distance metric. This note documents our first efforts to obtain upper bounds on optimal code sizes (for said metric) ala Delsarte's approach. For…
Let $\Gamma(n,k)$ be the Grassmann graph formed by the $k$-dimensional subspaces of a vector space of dimension $n$ over a field $\mathbb F$ and, for $t\in \mathbb{N}\setminus \{0\}$, let $\Delta_t(n,k)$ be the subgraph of $\Gamma(n,k)$…
The problem of finding code distance has been long studied for the generic ensembles of linear codes and led to several algorithms that substantially reduce exponential complexity of this task. However, no asymptotic complexity bounds are…
The matrix representations of linear codes have been well-studied for use as disjunct matrices. However, no connection has previously been made between the properties of disjunct matrices and the parity-check codes obtained from them. This…
We introduce univariate bicycle (UB) codes, a structured subclass of generalized bicycle (GB) quantum low-density parity-check (LDPC) codes obtained via a Frobenius relation. This construction reduces the code design space from a…
We characterize by pattern avoidance the Schubert varieties for GL_n which are local complete intersections (lci). For those Schubert varieties which are local complete intersections, we give an explicit minimal set of equations cutting out…
We generalize classical triangular Schubert puzzles to puzzles with convex polygonal boundary. We give these puzzles a geometric Schubert calculus interpretation and derive novel combinatorial commutativity statements, using purely…
The classical way of extending an $[n, k, d]$ linear code $\C$ is to add an overall parity-check coordinate to each codeword of the linear code $\C$. This extended code, denoted by $\overline{\C}(-\bone)$ and called the standardly extended…
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…
The Bounded Height Conjecture of Bombieri, Masser, and Zannier states that for any sufficiently generic algebraic subvariety of a semiabelian $\overline{\mathbb{Q}}$-variety $G$ there is an upper bound on the Weil height of the points…
In this manuscript, we introduce a new class of linear codes, called affine symplectic Grassmann codes, and determine their parameters, automorphism group, minimum distance codewords, dual code and other key features. These linear codes are…
In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a…
We realise the Bott-Samelson resolutions of type A Schubert varieties as quiver Grassmannians. In order to explicitly describe this isomorphism, we introduce the notion of a \textit{geometrically compatible} decomposition for any…
We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n,k. Among these new codes there is an optimal ternary…