Explicit subspace designs

A subspace design is a collection {H1, H2, ...,HM} of subspaces of $$\mathbb{F}_q^m$$ with the property that no low-dimensional subspace W of $$\mathbb{F}_q^m$$ intersects too many subspaces of the collection. Subspace designs were introduced by Guruswami and Xing (STOC 2013) who used them to give a randomized construction of optimal rate list-decodable codes over constant-sized large alphabets and sub-logarithmic (and even smaller) list size. Subspace designs are the only non-explicit part of their construction. In this paper, we give explicit constructions of subspace designs with parameters close to the probabilistic construction, and this implies the first deterministic polynomial time construction of list-decodable codes achieving the above parameters.Our constructions of subspace designs are natural and easily described, and are based on univariate polynomials over finite fields. Curiously, the constructions are very closely related to certain good list-decodable codes (folded RS codes and univariate multiplicity codes). The proof of the subspace design property uses the polynomial method (with multiplicities): Given a target low-dimensional subspace W, we construct a nonzero low-degree polynomial PW that has several roots for each Hi that non-trivially intersects W. The construction of PW is based on the classical Wronskian determinant and the folded Wronskian determinant, the latter being a recently studied notion that we make explicit in this paper. Our analysis reveals some new phenomena about the zeroes of univariate polynomials, namely that polynomials with many structured roots or many high multiplicity roots tend to be linearly independent.

[1]  Daniele Micciancio,et al.  Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction , 2012, Theory Comput..

[2]  Venkatesan Guruswami Cyclotomic function fields, Artin–Frobenius automorphisms, and list error correction with optimal rate , 2010 .

[3]  Venkatesan Guruswami,et al.  Explicit rank-metric codes list-decodable with optimal redundancy , 2013, Electron. Colloquium Comput. Complex..

[4]  Madhu Sudan,et al.  Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[5]  Venkatesan Guruswami,et al.  Folded codes from function field towers and improved optimal rate list decoding , 2012, STOC '12.

[6]  Venkatesan Guruswami,et al.  Explicit Subspace Designs , 2013, FOCS.

[7]  Venkatesan Guruswami,et al.  List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound , 2013, STOC '13.

[8]  José Felipe Voloch,et al.  Wronskians and linear independence in fields of prime characteristic , 1987 .

[9]  Frédérique E. Oggier,et al.  Self-Repairing Codes for distributed storage — A projective geometric construction , 2011, 2011 IEEE Information Theory Workshop.

[10]  Swastik Kopparty List-Decoding Multiplicity Codes , 2012, Theory Comput..

[11]  Amir Shpilka,et al.  On identity testing of tensors, low-rank recovery and compressed sensing , 2011, STOC '12.

[12]  Joachim Rosenthal,et al.  Spread codes and spread decoding in network coding , 2008, 2008 IEEE International Symposium on Information Theory.

[13]  Alexander Vardy,et al.  Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[14]  Alin Bostan,et al.  Wronskians and Linear Independence , 2010, Am. Math. Mon..

[15]  Venkatesan Guruswami,et al.  Optimal rate algebraic list decoding using narrow ray class fields , 2015, J. Comb. Theory, Ser. A.

[16]  Shachar Lovett,et al.  Subspace Evasive Sets , 2011, Electron. Colloquium Comput. Complex..

[17]  Venkatesan Guruswami,et al.  Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.

[18]  Thomas Muir,et al.  A Treatise on the Theory of Determinants , 2015 .

[19]  Venkatesan Guruswami,et al.  Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes , 2013, IEEE Transactions on Information Theory.