Designs, Intersecting Families, and Weight of Boolean Functions

Authors:
Eric Filiol
Affiliations:
-
Venue:
Proceedings of the 7th IMA International Conference on Cryptography and Coding
Year:
1999

Citing 7
Cited 2

Design theory

Design theory
Partially-bent functions

Designs, Codes and Cryptography
Cumulative balance testing of logic circuits

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Balance testing and balance-testable design of logic circuits

Journal of Electronic Testing: Theory and Applications
Extremal set systems

Handbook of combinatorics (vol. 2)
Restriction, terms and nonlinearity of Boolean functions

Theoretical Computer Science - Special issue: cryptography
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights

Quantum Information Processing
Computing the weight of a boolean function from its algebraic normal form

SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Determining the weight of Boolean functions is of exponential complexity. By using combinatorial results, it is proved that from their algebraic normal form (ANF), it is possible to have polynomial time results on the weight, for some classes of functions. As a result, the structure of the majority functions MAJ2q-1 is given.