On Boolean functions with the sum of every two of them being bent
- 110 Downloads
A set of Boolean functions is called a bent set if the sum of any two distinct members is a bent function. We show that any bent set yields a homogeneous system of linked symmetric designs with the same design parameters as those systems derived from Kerdock sets. Further we observe that there are bent sets of size equal to the square root of the Kerdock set size which consist of Boolean functions with arbitrary degrees.
KeywordsBent function Kerdock set System of linked symmetric designs Association scheme
AMS Classifications11T71 05B05
Unable to display preview. Download preview PDF.
- 1.Bending T.D., Fon-Der-Flaas D.: Crooked functions, bent functions, and distance regular graphs. Electron. J. Combin. 5 (1998) Research Paper 34, 14 pp (electronic).Google Scholar
- 5.Carlet C.: Vectorial Boolean functions for cryptography. In: Crama Y., Hammer P. (eds.) Boolean Methods and Models. Cambridge University Press (to appear).Google Scholar
- 6.Carlet C.: Boolean functions for cryptography and error correcting codes. In: Crama Y., Hammer P. (eds.) Boolean Methods and Models. Cambridge University Press (to appear).Google Scholar
- 8.Delsarte P.: An algebraic approach to the association schemes of coding theory. Phillips Res. Repts. Suppl. 10 (1973).Google Scholar