A note on symmetric boolean functions with maximum algebraic immunity in odd number of variablesLONGJIANG QU; CHAO LI; KEQIN FENG et al.IEEE transactions on information theory. 2007, Vol 53, Num 8, pp 2908-2910, issn 0018-9448, 3 p.Article

A Note on a Conjecture for Balanced Elementary Symmetric Boolean FunctionsWEI SU; XIAOHU TANG; POTT, Alexander et al.IEEE transactions on information theory. 2013, Vol 59, Num 1, pp 665-671, issn 0018-9448, 7 p.Article

Balanced 2p-variable rotation symmetric Boolean functions with maximum algebraic immunitySHAOJING FU; CHAO LI; MATSUURA, Kanta et al.Applied mathematics letters. 2011, Vol 24, Num 12, pp 2093-2096, issn 0893-9659, 4 p.Article

Almost security of cryptographic Boolean functionsKUROSAWA, Kaoru; MATSUMOTO, Ryutaroh.IEEE transactions on information theory. 2004, Vol 50, Num 11, pp 2752-2761, issn 0018-9448, 10 p.Article

Bent functions with 2^r niho exponentsLEANDER, Gregor; KHOLOSHA, Alexander.IEEE transactions on information theory. 2006, Vol 52, Num 12, pp 5529-5532, issn 0018-9448, 4 p.Article

A functional computation model for the duality of two-variable Lambda-Boolean functionsGÜYER, Tolga; MIRASYEDIOGLU, Seref.Applied mathematics and computation. 2006, Vol 182, Num 1, pp 879-887, issn 0096-3003, 9 p.Article

On the positive and the inversion complexity of Boolean functionsDICIUNAS, V.Informatique théorique et applications (Imprimé). 1993, Vol 27, Num 4, pp 283-293, issn 0988-3754Article

Simplification of boolean functions through petri netsHURA, G. S.Microelectronics and reliability. 1983, Vol 23, Num 3, pp 467-470, issn 0026-2714Article

Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean FunctionsLEI HU; XIANGYONG ZENG.Lecture notes in computer science. 2006, pp 402-416, issn 0302-9743, isbn 3-540-44523-4, 1Vol, 15 p.Conference Paper

Binary-decision graphs for implementation of boolean functionsSILVA, M; DAVID, R.IEE proceedings. Part E. Computers and digital techniques. 1985, Vol 132, Num 3, pp 175-184, issn 0143-7062Article

A Boolean function requiring 3n network sizeBLUM, N.Theoretical computer science. 1984, Vol 28, Num 3, pp 337-345, issn 0304-3975Article

Minimum self-dual decompositions of positive dual-minor Boolean functions : Boolean FunctionsBIOCH, J. C; IBARAKI, T; MAKINO, K et al.Discrete applied mathematics. 1999, Vol 96-97, pp 307-326, issn 0166-218XArticle

On the Construction of Boolean Functions With Optimal Algebraic ImmunityNA LI; LONGJIANG QU; QI, Wen-Feng et al.IEEE transactions on information theory. 2008, Vol 54, Num 3, pp 1330-1334, issn 0018-9448, 5 p.Article

Activities and sensitivities in Boolean network modelsSHMULEVICH, Ilya; KAUFFMAN, Stuart A.Physical review letters. 2004, Vol 93, Num 4, pp 048701.1-048701.4, issn 0031-9007Article

Toward a general correlation theoremKISHAN CHAND GUPTA; SARKAR, Palash.IEEE transactions on information theory. 2005, Vol 51, Num 9, pp 3297-3302, issn 0018-9448, 6 p.Article

Testing basic Boolean formulaePARNAS, Michal; RON, Dana; SAMORODNITSKY, Alex et al.SIAM journal on discrete mathematics (Print). 2003, Vol 16, Num 1, pp 20-46, issn 0895-4801, 27 p.Article

Fast Algebraic Attacks and Decomposition of Symmetric Boolean FunctionsMEICHENG LIU; DONGDAI LIN; DINGYI PEI et al.IEEE transactions on information theory. 2011, Vol 57, Num 7, pp 4817-4821, issn 0018-9448, 5 p.Article

Equivalence of operations with respect to discriminator clonesLEHTONEN, Erkko; SZENDREI, Agnes.Discrete mathematics. 2009, Vol 309, Num 4, pp 673-685, issn 0012-365X, 13 p.Article

New classes of almost bent and almost perfect nonlinear polynomialsBUDAGHYAN, Lilya; CARLET, Claude; POTT, Alexander et al.IEEE transactions on information theory. 2006, Vol 52, Num 3, pp 1141-1152, issn 0018-9448, 12 p.Article

Analysis of disjoint decomposition of balanced Boolean functions through the Walsh spectrumFALKOWSKI, B. J; KANNURAO, S.IEE proceedings. Computers and digital techniques. 2001, Vol 148, Num 2, pp 71-78, issn 1350-2387Article

On the PMEPR of Binary Golay Sequences of Length 2ⁿZILONG WANG; PARKER, Matthew G; GUANG GONG et al.IEEE transactions on information theory. 2014, Vol 60, Num 4, pp 2391-2398, issn 0018-9448, 8 p.Article

Computing Partial Walsh Transform From the Algebraic Normal Form of a Boolean FunctionKISHAN CHAND GUPTA; SARKAR, Palash.IEEE transactions on information theory. 2009, Vol 55, Num 3, pp 1354-1359, issn 0018-9448, 6 p.Article

Classification of cubic (n - 4)-resilient boolean functionsBRAEKEN, An; BORISSOV, Yuri; NIKOVA, Svetla et al.IEEE transactions on information theory. 2006, Vol 52, Num 4, pp 1670-1676, issn 0018-9448, 7 p.Article

Primal-dual distance bounds of linear codes with application to cryptographyMATSUMOTO, Ryutaroh; KUROSAWA, Kaoru; ITOH, Toshiya et al.IEEE transactions on information theory. 2006, Vol 52, Num 9, pp 4251-4256, issn 0018-9448, 6 p.Article

On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplicationBRYANT, R. E.IEEE transactions on computers. 1991, Vol 40, Num 2, pp 205-213, issn 0018-9340, 9 p.Article