相关论文: Bounds and Genericity of Sum-Rank-Metric Codes
Let $\mathrm{Sym}_q(m)$ be the space of symmetric matrices in $\mathbb{F}_q^{m\times m}$. A subspace of $\mathrm{Sym}_q(m)$ equipped with the rank distance is called a symmetric rank-metric code. In this paper we study the covering…
This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory…
We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a…
This paper provides new and improved Singleton-like bounds for Lee metric codes over integer residue rings. We derive the bounds using various novel definitions of generalized Lee weights based on different notions of a support of a linear…
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…
We extend the notion of locality from the Hamming metric to the rank and subspace metrics. Our main contribution is to construct a class of array codes with locality constraints in the rank metric. Our motivation for constructing such codes…
Universal security over a network with linear network coding has been intensively studied. However, previous linear codes used for this purpose were linear over a larger field than that used on the network. In this work, we introduce new…
We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As…
In this work, maximum sum-rank distance (MSRD) codes and linearized Reed-Solomon codes are extended to finite chain rings. It is proven that linearized Reed-Solomon codes are MSRD over finite chain rings, extending the known result for…
We study limit distributions of independent random matrices as well as limit joint distributions of their blocks under normalized partial traces composed with classical expectation. In particular, we are concerned with the ensemble of…
In this paper, we establish the list-decoding capacity theorem for sum-rank metric codes. This theorem implies the list-decodability theorem for random general sum-rank metric codes: Any random general sum-rank metric code with a rate not…
We present multi-point algebraic geometric codes overstepping the Gilbert-Varshamov bound. The construction is based on the generalized Hermitian curve introduced by A. Bassa, P. Beelen, A. Garcia, and H. Stichtenoth. These codes are…
We consider the Riemannian random wave model of Gaussian linear combinations of Laplace eigenfunctions on a general compact Riemannian manifold. With probability one with respect to the Gaussian coefficients, we establish that, both for…
We introduce and explore a new concept of evasive subspace with respect to a collection of subspaces sharing a common dimension, most notably partial spreads. We show that this concept generalises known notions of subspace scatteredness and…
Mixed codes, which are error-correcting codes in the Cartesian product of different-sized spaces, model degrading storage systems well. While such codes have previously been studied for their algebraic properties (e.g., existence of perfect…
We study the density of the weights of Generalized Reed--Muller codes. Let $RM_p(r,m)$ denote the code of multivariate polynomials over $\F_p$ in $m$ variables of total degree at most $r$. We consider the case of fixed degree $r$, when we…
The coordinates along any fixed direction(s), of points on the sphere $S^{n-1}(\sqrt{n})$, roughly follow a standard Gaussian distribution as $n$ approaches infinity. We revisit this classical result from a nonstandard analysis perspective,…
We speed up existing decoding algorithms for three code classes in different metrics: interleaved Gabidulin codes in the rank metric, lifted interleaved Gabidulin codes in the subspace metric, and linearized Reed-Solomon codes in the…
Which integer sequences are sequences of generalized weights of a linear code? In this paper, we answer this question for linear block codes, rank-metric codes, and more generally for sum-rank metric codes. We do so under an existence…
Metric (graph) bundles generalize the notion of fiber bundles to the context of geometric group theory and were introduced by Mj and Sardar. Suppose $X$ is a metric (graph) bundle over $B$ such that the fibers are (uniformly) hyperbolic,…