A characterization of bent functions in terms of strongly regular graphs
From MaRDI portal
Publication:4571343
DOI10.1109/12.954512zbMath1392.94964OpenAlexW2164430260MaRDI QIDQ4571343
Anna Bernasconi, Jeffrey M. Vanderkam, Bruno Codenotti
Publication date: 9 July 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4ae03b92fd3536de2b1e6f8e0de662206d6255a5
Related Items
Bent and vectorial bent functions, partial difference sets, and strongly regular graphs ⋮ A survey on \(p\)-ary and generalized bent functions ⋮ Graphs of vectorial plateaued functions as difference sets ⋮ Relationship between homogeneous bent functions and Nagy graphs ⋮ A survey of metaheuristic algorithms for the design of cryptographic Boolean functions ⋮ Generalized bent Boolean functions and strongly regular Cayley graphs ⋮ Constructions of strongly regular Cayley graphs derived from weakly regular bent functions ⋮ Vectorial bent functions and partial difference sets ⋮ A link between combinatorial designs and three-weight linear codes ⋮ Unnamed Item ⋮ Unnamed Item