Related papers: Maximum scattered linear sets and MRD-codes
Let $k,n,m \in \mathbb{Z}^+$ integers such that $k\leq n \leq m$, let $\mathrm{G}_{n,k}\in \mathbb{F}_{q^m}^n$ be a Delsarte-Gabidulin code. Wachter-Zeh proven that codes belonging to this family cannot be efficiently list decoded for any…
Many of the distributed localization algorithms are based on relaxed optimization formulations of the localization problem. These algorithms commonly rely on first-order optimization methods, and hence may require many iterations or…
In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…
The study of linear codes over a finite field of odd cardinality, derived from determinantal varieties obtained from symmetric matrices of bounded rank, was initiated in a recent paper by the authors. There, one found the minimum distance…
A $q$-ary $(n,k,r)$ locally repairable code (LRC) is an $[n,k,d]$ linear code over $\mathbb{F}_q$ such that every code symbol can be recovered by accessing at most $r$ other code symbols. The well-known Singleton-like bound says that $d \le…
Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. Besides a global level, they enable errors to be corrected locally, reducing the need for communication between storage nodes. There is a close…
In this work we present a new criterion to check if a given rank-metric code is a maximum rank distance (MRD) code. Moreover, we derive a criterion to check if a given MRD code is a generalized Gabidulin code. We then use these results to…
Recently, Croot, Lev, and Pach (Ann. of Math., 185:331--337, 2017.) and Ellenberg and Gijswijt (Ann. of Math., 185:339--443, 2017.) developed a new polynomial method and used it to prove upper bounds for three-term arithmetic progression…
In this paper, we will employ the technique used in the proof of classical Singleton bound to derive upper bounds for rank metric codes and Ferrers diagram rank metric codes. These upper bounds yield the rank distance Singleton bound and an…
Let $X$ be a smooth irreducible projective curve of genus $g \geq 2$ over a finite field $\F_{q}$ of characteristic $p$ with $q$ elements such that the function field $\F_{q}(X)$ is a geometric Galois extension of the rational function…
We give a complete conjectural formula for the number $e_r(d,m)$ of maximum possible ${\mathbb{F}}q$-rational points on a projective algebraic variety defined by $r$ linearly independent homogeneous polynomial equations of degree $d$ in…
Sum-rank metric codes are a natural extension of both linear block codes and rank-metric codes. They have several applications in information theory, including multishot network coding and distributed storage systems. The aim of this…
We examine the maximum dimension of a linear system of plane cubic curves whose $\mathbb{F}_q$-members are all geometrically irreducible. Computational evidence suggests that such a system has a maximum (projective) dimension of $3$. As a…
Zhang et. al. recently derived upper and lower bounds on the achievable diversity of an N_R x N_T i.i.d. Rayleigh fading multiple antenna system using transmit antenna selection, spatial multiplexing and a linear receiver structure. For the…
This paper presents new upper bounds on the rate of linear $k$-hash codes in $\mathbb{F}_q^n$, $q\geq k$, that is, codes with the property that any $k$ distinct codewords are all simultaneously distinct in at least one coordinate.
Left and right idealizers are important invariants of linear rank-distance codes. In the case of maximum rank-distance (MRD for short) codes in $\mathbb{F}_q^{n\times n}$ the idealizers have been proved to be isomorphic to finite fields of…
For a class $\mathcal C$ of graphs $G$ equipped with functions $f_G$ defined on subsets of $E(G)$ or $V(G)$, we say that $\mathcal{C}$ is $k$-scattered with respect to $f_G$ if there exists a constant $\ell$ such that for every graph $G\in…
The Etzion-Silberstein conjecture asserts that, for any finite field $\mathbb F$, Ferrers diagram $\mathcal D$, and integer $d$, there exists a linear matrix code supported on $\mathcal D$ with minimum rank distance $d$ that attains a…
We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…
In this article we survey recent results on the explicit construction of finite point sets and infinite sequences with optimal order of $\mathcal{L}_q$ discrepancy. In 1954 Roth proved a lower bound for the $\mathcal{L}_2$ discrepancy of…