Rothaus, O. S. On “bent” functions. (English) Zbl 0336.12012 J. Comb. Theory, Ser. A 20, 300-305 (1976). Author’s summary: Let \(P(x)\) be a function from \(\mathrm{GF}(2^n)\) to \(\mathrm{GF}(2)\). \(P(x)\) is called “bent” if all Fourier coefficients of \((-1)^{P(x)}\) are \(\pm 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. Reviewer: John H. Hodges Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 10 ReviewsCited in 300 Documents MSC: 11T71 Algebraic coding theory; cryptography (number-theoretic aspects) 05A15 Exact enumeration problems, generating functions Keywords:bent functions; polynomial degree; Fourier coeffients \(\pm 1\) PDF BibTeX XML Cite \textit{O. S. Rothaus}, J. Comb. Theory, Ser. A 20, 300--305 (1976; Zbl 0336.12012) Full Text: DOI References: [1] McFarland, R, A family of difference sets in noncyclic groups, J. combinatorial theory, ser. A, 15, 1-10, (1973) · Zbl 0268.05011 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.