A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Learning polynomials with queries: The highly noisy case
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
List decoding of q-ary Reed-Muller codes
IEEE Transactions on Information Theory
Recursive decoding and its performance for low-rate Reed-Muller codes
IEEE Transactions on Information Theory
Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
IEEE Transactions on Information Theory
On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
On the lower bounds of the second order nonlinearities of some Boolean functions
Information Sciences: an International Journal
A Lower Bound of the Second-order Nonlinearities of Boolean Bent Functions
Fundamenta Informaticae
On Second-order Nonlinearities of Some D 0 Type Bent Functions
Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
| Hi-index | 0.00 |
We propose an algorithm which is an improved version of the Kabatiansky---Tavernier list decoding algorithm for the second order Reed---Muller code RM(2, m), of length n = 2 m , and we analyse its theoretical and practical complexity. This improvement allows a better theoretical complexity. Moreover, we conjecture another complexity which corresponds to the results of our simulations. This algorithm has the strong property of being deterministic and this fact drives us to consider some applications, like determining some lower bounds concerning the covering radius of the RM(2, m) code.