On Multi-Point Local Decoding of Reed-Muller Codes
暂无分享,去创建一个
[1] Venkatesan Guruswami,et al. Efficient list decoding of punctured Reed-Muller codes , 2015, ArXiv.
[2] Noga Alon,et al. Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.
[3] Sergey Yekhanin,et al. Locally Decodable Codes , 2012, Found. Trends Theor. Comput. Sci..
[4] Shubhangi Saraf,et al. High-rate codes with sublinear-time decoding , 2014, Electron. Colloquium Comput. Complex..
[5] Mihir Bellare,et al. Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[6] Shachar Lovett,et al. List decoding Reed-Muller codes over small fields , 2014, Electron. Colloquium Comput. Complex..
[7] Or Meir,et al. Locally Correctable and Testable Codes Approaching the Singleton Bound , 2014, Electron. Colloquium Comput. Complex..
[8] Venkatesan Guruswami,et al. Hitting Sets for Low-Degree Polynomials with Optimal Density , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[9] Juliane Hahn,et al. Algebraic Geometric Codes , 2016 .
[10] Henning Stichtenoth,et al. Algebraic function fields and codes , 1993, Universitext.
[11] Ronald Cramer. The Arithmetic Codex: Theory and Applications , 2011, EUROCRYPT.
[12] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[13] H. Stichtenoth,et al. A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound , 1995 .
[14] Alan Guo,et al. High-Rate Locally Correctable Codes via Lifting , 2013, IEEE Transactions on Information Theory.
[15] Alan Guo,et al. New affine-invariant codes from lifting , 2012, ITCS '13.
[16] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[17] Parikshit Gopalan,et al. A Fourier-Analytic Approach to Reed–Muller Decoding , 2010, IEEE Transactions on Information Theory.
[18] Ignacio Cascudo,et al. The arithmetic codex , 2012, 2012 IEEE Information Theory Workshop.
[19] Hao Chen,et al. Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields , 2006, CRYPTO.
[20] Xin-Wen Wu,et al. List decoding of q-ary Reed-Muller codes , 2004, IEEE Transactions on Information Theory.
[21] Eli Ben-Sasson,et al. A new family of locally correctable codes based on degree-lifted algebraic geometry codes , 2013, STOC '13.
[22] Shachar Lovett,et al. The List Decoding Radius for Reed–Muller Codes Over Small Fields , 2018, IEEE Transactions on Information Theory.
[23] Ramprasad Saptharishi,et al. Efficiently Decoding Reed–Muller Codes From Random Errors , 2015, IEEE Transactions on Information Theory.
[24] Ivan Damgård,et al. Secure Multiparty Computation and Secret Sharing , 2015 .
[26] G. David Forney,et al. Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.
[27] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.