Computing Affine Equivalence Classes of Boolean Functions by Group Isomorphism

DOI10.1109/TC.2016.2557329zbMATH Open1360.94485OpenAlexW2344561532MaRDI QIDQ2985151FDOQ2985151

Juling Zhang, Yan Zhang, Guowu Yang, William N. N. Hung

Publication date: 16 May 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2016.2557329

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05) Boolean functions (06E30) Boolean functions (94D10)

Cited In (5)

• The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions
• Testing Boolean Functions Properties
• A new pairwise NPN Boolean matching algorithm based on structural difference signature
• Computing the number of affine equivalent classes on \(\mathcal{R}(s,n)/\mathcal{R}(k,n)\)
• A group algebraic approach to NPN classification of Boolean functions

This page was built for publication: Computing Affine Equivalence Classes of Boolean Functions by Group Isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985151)