Succinct Representation of Codes with Applications to Testing
暂无分享,去创建一个
[1] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[2] Noga Alon,et al. Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.
[3] Simon Litsyn,et al. Long Extended BCH Codes Are Spanned by Minimum Weight Words , 2006, AAECC.
[4] Dana Ron,et al. Testing polynomials over general fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[5] Jacques Wolfman. Polynomial description of binary linear codes and related properties , 2005, Applicable Algebra in Engineering, Communication and Computing.
[6] Henning Stichtenoth,et al. Algebraic function fields and codes , 1993, Universitext.
[7] Simon Litsyn,et al. On the Distance Distributions of BCH Codes and Their Duals , 2001, Des. Codes Cryptogr..
[8] Wolfgang M. Schmidt,et al. Bounds for exponential sums , 1984 .
[9] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[10] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..
[11] Yuan Zhou. Introduction to Coding Theory , 2010 .
[12] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[13] Simon Litsyn,et al. Almost orthogonal linear codes are locally testable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[14] Pascale Charpin,et al. Studying the locator polynomials of minimum weight codewords of BCH codes , 1992, IEEE Trans. Inf. Theory.
[15] Shachar Lovett,et al. New Extension of the Weil Bound for Character Sums with Applications to Coding , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[16] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[17] Atri Rudra,et al. Testing low-degree polynomials over prime fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[18] Elena Grigorescu. Symmetries in algebraic Property Testing , 2010 .
[19] Madhu Sudan,et al. Sparse Random Linear Codes are Locally Decodable and Testable , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[20] Tali Kaufman,et al. Explicit Low-Weight Bases for BCH Codes , 2012, IEEE Transactions on Information Theory.
[21] Jean Bourgain,et al. Mordell's exponential sum estimate revisited , 2005 .
[22] A. Weil. Sur les courbes algébriques et les variétés qui s'en déduisent , 1948 .
[23] D. Shanks. Solved and Unsolved Problems in Number Theory , 1964 .
[24] J. Bourgain,et al. Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order , 2003 .
[25] J. Bourgain,et al. Some Arithmetical Applications of the Sum-Product Theorems in Finite Fields , 2007 .
[26] Madhu Sudan,et al. Succinct Representation of Codes with Applications to Testing , 2009, SIAM J. Discret. Math..
[27] Terence Tao,et al. A sum-product estimate in finite fields, and applications , 2003, math/0301343.
[28] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[29] Jean Bourgain,et al. A Gauss sum estimate in arbitrary finite fields , 2006 .
[30] S. Wagstaff. Divisors of Mersenne numbers , 1983 .