An upper bound on the number of iterations for transforming a Boolean function of degree greater or equal than 4 to a function of degree 3

DOI10.1023/A:1011279406162zbMath1006.94033MaRDI QIDQ5960285

Horacio Tapia-Recillas, Gerardo Vega

Publication date: 15 April 2002

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

degreeBoolean functionHamming weightmultilinear form

Mathematics Subject Classification ID

Boolean functions (06E30)

This page was built for publication: An upper bound on the number of iterations for transforming a Boolean function of degree greater or equal than 4 to a function of degree 3