An Innnite Class of Counterexamples to a Conjecture concerning Non-linear Resilient Functions
暂无分享,去创建一个
[1] Franco P. Preparata. A Class of Optimum Nonlinear Double-Error-Correcting Codes , 1968, Inf. Control..
[2] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[3] Anthony M. Kerdock,et al. Erratum: "A Class of Low-Rate Nonlinear Binary Codes" , 1972, Inf. Control..
[4] Jean-Marie Goethals,et al. Nearly perfect binary codes , 1972, Discret. Math..
[5] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[6] Oded Goldreich,et al. The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[7] Tom Verhoeff,et al. An updated table of minimum-distance bounds for binary linear codes , 1987, IEEE Trans. Inf. Theory.
[8] Gilles Brassard,et al. Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..
[9] Andries E. Brouwer,et al. A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters , 1993, Des. Codes Cryptogr..
[10] Ueli Maurer,et al. Local randomness in pseudorandom sequences , 2004, Journal of Cryptology.
[11] P. Delsarte. AN ALGEBRAIC APPROACH TO THE ASSOCIATION SCHEMES OF CODING THEORY , 2011 .
[12] D. Stinson,et al. Resilient functions and large sets of orthogonal arrays , 2022 .