You are looking at a specific version 20150810:142128 of this paper.
See the latest version.
Paper 2015/790
On weak and strong 2^k-bent Boolean functions
Pantelimon Stanica
Abstract
In this paper we introduce a sequence of discrete Fourier transforms and define new versions of bent functions, which we shall call (weak, strong) octa/hexa/2^k-bent functions. We investigate relationships between these classes and completely characterize the octabent and hexabent functions in terms of bent functions.
Metadata
- Available format(s)
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Contact author(s)
- pstanica @ nps edu
- History
- 2015-08-10: received
- Short URL
- https://ia.cr/2015/790
- License
-
CC BY