Nonlinearity of Some Invariant Boolean Functions |
| |
| Authors: | P.?Langevin mailto:langevin@univ-tln.fr" title=" langevin@univ-tln.fr" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author,J.-P.?Zanotti |
| |
| Affiliation: | (1) Grim, Universite De Toulon – Var, B.P. 132, 83957, La Garde, Cedex, France |
| |
| Abstract: | ![]()
One of the hardest problems in coding theory is to evaluate the covering radius of first order Reed–Muller codes RM(1,m), and more recently the balanced covering radius for crypto graphical purposes. The aim of this paper is to present some new results on this subject. We mainly study boolean functions invariant under the action of some finite groups, following the idea of Patterson and Wiedemann [The covering radius of the (1, 15) Reed-Muller Code is atleast 16276. IEEE Trans Inform Theory. Vol. 29 (1983) 354.]. Our method is Fourier transforms and our results are both theoretical and numerical. |
| |
| Keywords: | nonlinearity finite groups characters Fourier transforms Reed– Muller codes boolean functions covering radius cryptography. |
| 本文献已被 SpringerLink 等数据库收录！ |
|
