Bent functions and their connections to combinatorics

DOI10.1017/CBO9781139506748.004zbMath1315.11099OpenAlexW21811610MaRDI QIDQ2875856

Alexander Kholosha, Tor Helleseth

Publication date: 12 August 2014

Published in: Surveys in Combinatorics 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/cbo9781139506748.004

zbMATH Keywords

strongly regular graphspartial difference setsrelative difference setsdifference setspartial spreadBent functionsplanar functionsweakly regularMaiorana-McFarlandAB functions

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Cryptography (94A60) Polynomials over finite fields (11T06) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Boolean functions (06E30) Combinatorial codes (94B25)

Related Items (4)

Some general properties of modified bent functions through addition of indicator functions ⋮ The graph of minimal distances of bent functions and its properties ⋮ Four decades of research on bent functions ⋮ Linear codes with few weights from weakly regular bent functions based on a generic construction

This page was built for publication: Bent functions and their connections to combinatorics