Article thumbnail

On “bent” functions

By O.S Rothaus


AbstractLet P(x) be a function from GF(2n) to GF(2). P(x) is called “bent” if all Fourier coefficients of (−1)P(x) are ±1. The polynomial degree of a bent function P(x) is studied, as are the properties of the Fourier transform of (−1)P(x), and a connection with Hadamard matrices

Publisher: Published by Elsevier Inc.
Year: 1976
DOI identifier: 10.1016/0097-3165(76)90024-8
OAI identifier:

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

Suggested articles