TY - JOUR
T1 - On boolean functions with the sum of every two of them being bent
AU - Bey, Christian
AU - Kyureghyan, Gohar M.
PY - 2008/12/1
Y1 - 2008/12/1
N2 - A set of Boolean functions is called a bent set if the sum of any two distinct members is a bent function. We show that any bent set yields a homogeneous system of linked symmetric designs with the same design parameters as those systems derived from Kerdock sets. Further we observe that there are bent sets of size equal to the square root of the Kerdock set size which consist of Boolean functions with arbitrary degrees.
AB - A set of Boolean functions is called a bent set if the sum of any two distinct members is a bent function. We show that any bent set yields a homogeneous system of linked symmetric designs with the same design parameters as those systems derived from Kerdock sets. Further we observe that there are bent sets of size equal to the square root of the Kerdock set size which consist of Boolean functions with arbitrary degrees.
UR - http://www.scopus.com/inward/record.url?scp=51349150264&partnerID=8YFLogxK
U2 - 10.1007/s10623-008-9196-4
DO - 10.1007/s10623-008-9196-4
M3 - Journal articles
AN - SCOPUS:51349150264
SN - 0925-1022
VL - 49
SP - 341
EP - 346
JO - Designs, Codes, and Cryptography
JF - Designs, Codes, and Cryptography
IS - 1-3
ER -