Explicit subspace designs
暂无分享,去创建一个
[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.