Decoding Multivariate Multiplicity Codes on Product Sets
暂无分享,去创建一个
[1] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[2] Alexander Barg,et al. Discrete Geometry and Algebraic Combinatorics , 2014, Discrete Geometry and Algebraic Combinatorics.
[3] Swastik Kopparty,et al. Decoding Reed-Muller Codes over Product Sets , 2015, Theory Comput..
[4] Shubhangi Saraf,et al. Improved Decoding of Folded Reed-Solomon and Multiplicity Codes , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[5] Swastik Kopparty. Some remarks on multiplicity codes , 2013, Discrete Geometry and Algebraic Combinatorics.
[6] Shubhangi Saraf,et al. The method of multiplicities , 2011 .
[7] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[8] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[9] 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.
[10] Shubhangi Saraf,et al. High-rate codes with sublinear-time decoding , 2014, Electron. Colloquium Comput. Complex..
[11] Venkatesan Guruswami,et al. Explicit subspace designs , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[12] Alin Bostan,et al. Wronskians and Linear Independence , 2010, Am. Math. Mon..
[13] Venkatesan Guruswami,et al. Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes , 2013, IEEE Transactions on Information Theory.
[14] Richard J. Lipton,et al. A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..
[15] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[16] Xin-Wen Wu,et al. List decoding of q-ary Reed-Muller codes , 2004, IEEE Transactions on Information Theory.
[17] Ramprasad Saptharishi,et al. Derandomization from Algebraic Hardness: Treading the Borders , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).