4 research outputs found
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs
We introduce a simple logical inference structure we call a spanoid (generalizing the notion of a matroid), which captures well-studied problems in several areas. These include combinatorial geometry (point-line incidences), algebra (arrangements of hypersurfaces and ideals), statistical physics (bootstrap percolation), network theory (gossip / infection processes) and coding theory. We initiate a thorough investigation of spanoids, from computational and structural viewpoints, focusing on parameters relevant to the applications areas above and, in particular, to questions regarding Locally Correctable Codes (LCCs).
One central parameter we study is the rank of a spanoid, extending the rank of a matroid and related to the dimension of codes. This leads to one main application of our work, establishing the first known barrier to improving the nearly 20-year old bound of Katz-Trevisan (KT) on the dimension of LCCs. On the one hand, we prove that the KT bound (and its more recent refinements) holds for the much more general setting of spanoid rank. On the other hand we show that there exist (random) spanoids whose rank matches these bounds. Thus, to significantly improve the known bounds one must step out of the spanoid framework.
Another parameter we explore is the functional rank of a spanoid, which captures the possibility of turning a given spanoid into an actual code. The question of the relationship between rank and functional rank is one of the main questions we raise as it may reveal new avenues for constructing new LCCs (perhaps even matching the KT bound). As a first step, we develop an entropy relaxation of functional rank to create a small constant gap and amplify it by tensoring to construct a spanoid whose functional rank is smaller than rank by a polynomial factor. This is evidence that the entropy method we develop can prove polynomially better bounds than KT-type methods on the dimension of LCCs.
To facilitate the above results we also develop some basic structural results on spanoids including an equivalent formulation of spanoids as set systems and properties of spanoid products. We feel that given these initial findings and their motivations, the abstract study of spanoids merits further investigation. We leave plenty of concrete open problems and directions
Visible Rank and Codes with Locality
We propose a framework to study the effect of local recovery requirements of
codeword symbols on the dimension of linear codes, based on a combinatorial
proxy that we call \emph{visible rank}. The locality constraints of a linear
code are stipulated by a matrix of 's and 's (which we call a
"stencil"), whose rows correspond to the local parity checks (with the
's indicating the support of the check). The visible rank of is the
largest for which there is a submatrix in with a unique
generalized diagonal of 's. The visible rank yields a field-independent
combinatorial lower bound on the rank of and thus the co-dimension of the
code.
We prove a rank-nullity type theorem relating visible rank to the rank of an
associated construct called \emph{symmetric spanoid}, which was introduced by
Dvir, Gopi, Gu, and Wigderson~\cite{DGGW20}. Using this connection and a
construction of appropriate stencils, we answer a question posed in
\cite{DGGW20} and demonstrate that symmetric spanoid rank cannot improve the
currently best known upper bound on the
dimension of -query locally correctable codes (LCCs) of length .
We also study the -Disjoint Repair Group Property (-DRGP) of codes
where each codeword symbol must belong to disjoint check equations. It is
known that linear -DRGP codes must have co-dimension . We
show that there are stencils corresponding to -DRGP with visible rank as
small as . However, we show the second tensor of any -DRGP
stencil has visible rank , thus recovering the
lower bound for -DRGP. For -LCC, however, the 'th tensor power for
is unable to improve the upper
bound on the dimension of -LCCs by a polynomial factor.Comment: 22 pages; Appeared in RANDOM'21; The current version includes Theorem
5, which is a solution to Question 2 that was asked in the earlier versio
Recommended from our members
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs
We introduce a simple logical inference structure we call a “spanoid" (generalizing the notion of a matroid), which captures well-studied problems in several areas. These include combinatorial geometry (point-line incidences), algebra (arrangements of hypersurfaces and ideals), statistical physics (bootstrap percolation), network theory (gossip/infection processes) and coding theory. We initiate a thorough investigation of spanoids, from computational and structural viewpoints, focusing on parameters relevant to the applications areas above and, in particular, to questions regarding locally correctable codes (LCCs). One central parameter we study is the “rank" of a spanoid, extending the rank of a matroid and related to the dimension of codes. This leads to one main application of our work, establishing the first known barrier to improving the nearly 20-year old bound of Katz--Trevisan (KT) on the dimension of LCCs. On the one hand, we prove that the KT bound (and its more recent refinements) holds for the much more general setting of spanoid rank. On the other hand we show that there exist (random) spanoids whose rank matches these bounds. Thus, to significantly improve the known bounds one must step out of the spanoid framework. Another parameter we explore is the “functional rank" of a spanoid, which captures the possibility of turning a given spanoid into an actual code. The question of the relationship between rank and functional rank is one of the main questions we raise as it may reveal new avenues for constructing new LCCs (perhaps even matching the KT bound). As a first step, we develop an entropy relaxation of functional rank to create a small constant gap and amplify it by tensoring to construct a spanoid whose functional rank is smaller than rank by a polynomial factor. This is evidence that the entropy method we develop can prove polynomially better bounds than KT-type methods on the dimension of LCCs. To facilitate the above results we also develop some basic structural results on spanoids including an equivalent formulation of spanoids as set systems and properties of spanoid products. We feel that given these initial findings and their motivations, the abstract study of spanoids merits further investigation. We leave plenty of concrete open problems and directions