相关论文: On the Sparseness of Certain MRD Codes
For a high-dimensional parameter of interest, tests based on quadratic statistics are known to have low power against subsets of the parameter space (henceforth, parameter subspaces). In addition, they typically involve an inverse…
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…
Dimension reduction and data quantization are two important methods for reducing data complexity. In the paper, we study the methodology of first reducing data dimension by random projection and then quantizing the projections to ternary or…
The mds (maximum distance separable) conjecture claims that a nontrivial linear mds $[n,k]$ code over the finite field $GF(q)$ satisfies $n \leq (q + 1)$, except when $q$ is even and $k = 3$ or $k = q- 1$ in which case it satisfies $n \leq…
Let $q$ be a power of $2$ and let $\mathbb{F}_q$ be the finite field with $q$ elements. For a positive integer $n$, the polynomial $X^n-1\in\mathbb{F}_q[X]$ is called $3$-sparse over $\mathbb{F}_q$ if every monic irreducible factor of…
Developing computationally-efficient codes that approach the Shannon-theoretic limits for communication and compression has long been one of the major goals of information and coding theory. There have been significant advances towards this…
Several recent papers have considered the Ramsey-theoretic problem of how large a subset of integers can be without containing any 3-term geometric progressions. This problem has also recently been generalized to number fields, determining…
For any admissible value of the parameters $n$ and $k$ there exist $[n,k]$-Maximum Rank distance ${\mathbb F}_q$-linear codes. Indeed, it can be shown that if field extensions large enough are considered, almost all rank distance codes are…
Let $X$ be a quasi-projective variety over a number field, admitting (after passage to $\mathbb{C}$) a geometric variation of Hodge structure whose period mapping has zero-dimensional fibers. Then the integral points of $X$ are sparse: the…
Partial-MDS (PMDS) codes are a family of locally repairable codes, mainly used for distributed storage. They are defined to be able to correct any pattern of $s$ additional erasures, after a given number of erasures per locality group have…
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of…
This paper presents a novel approach at the intersection of machine learning and number theory, focusing on the classification of prime and non-prime numbers. At the core of our research is the development of a highly sparse encoding…
We present simple constructions of optimal erasure-correcting LRC codes by exhibiting their parity-check matrices. When the number of local parities in a parity group plus the number of global parities is smaller than the size of the parity…
Super-resolution theory aims to estimate the discrete components lying in a continuous space that constitute a sparse signal with optimal precision. This work investigates the potential of recent super-resolution techniques for spectral…
We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…
Sum-rank metric codes, as a generalization of Hamming codes and rank metric codes, have important applications in fields such as multi-shot linear network coding, space-time coding and distributed storage systems. The purpose of this study…
Guruswami and Xing introduced subspace designs in 2013 to give the first construction of positive rate rank metric codes list-decodable beyond half the distance. In this paper we provide bounds involving the parameters of a subspace design,…
For several computational procedures such as finding radicals and Noether normalizations, it is important to choose as sparse as possible a system of parameters in a polynomial ideal or modulo a polynomial ideal. We describe new strategies…
Semidefinite programming (SDP) problems are challenging to solve because of their high dimensionality. However, solving sparse SDP problems with small tree-width are known to be relatively easier because: (1) they can be decomposed into…
The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Local Reconstruction Codes (LRCs) have emerged as the codes of choice for these…