New covering radius of Reed-Muller codes for t-resilient functions
In this paper, we introduce a new covering radius of RM (r, n) from cryptography viewpoint. It is defined as the maximum distance between t-resilient functions and the rth order Reed-Muller code RM (r, n). We next derive its lower and upper bounds. We further present a table of numerical data of our bounds.
covering radius reed-muller code t-resilient function nonlinearity stream cipher