Name
Abstract | ||
|---|---|---|
Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where only one affine Boolean function belongs to each class. Two different methods are proposed to achieve this classification. The first method is a recursive procedure that uses the Cartesian product of sets starting from the set of 1-variable Boolean function and in the second method classification is achieved through a set of invariant bit positions with respect to an affine function belonging to that class. The invariant bit positions also provide information concerning the size and symmetry properties of the classes/sub-classes, such that the members of classes/sub-classes satisfy certain similar properties. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1155/2013/270424 | CoRR |
Field | DocType | Volume |
Boolean network,Boolean function,Affine transformation,Discrete mathematics,Cartesian product,Parity function,Standard Boolean model,Boolean expression,Recursion,Mathematics | Journal | abs/1303.3527 |
Citations | PageRank | References |
3 | 0.43 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ranjeet Kumar Rout | 1 | 10 | 3.23 |
| Pabitra Pal Choudhury | 2 | 69 | 28.27 |
| Sudhakar Sahoo | 3 | 51 | 13.13 |