Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Boolean function")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2433

  • Page / 98

Export

Selection :

  • and

On 2k-Variable Symmetric Boolean Functions With Maximum Algebraic Immunity kHUI WANG; JIE PENG; YUAN LI et al.IEEE transactions on information theory. 2012, Vol 58, Num 8, pp 5612-5624, issn 0018-9448, 13 p.Article

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

Minimization of Boolean functions of any number of variables using decimal labelsMALAY SEN.Information sciences. 1983, Vol 30, Num 1, pp 37-45, issn 0020-0255Article

A measure in which boolean negation is exponentially powerfulSKYUM, S.Information processing letters. 1983, Vol 17, Num 3, pp 125-128, issn 0020-0190Article

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

On Semibent Boolean FunctionsCARLET, Claude; MESNAGER, Sihem.IEEE transactions on information theory. 2012, Vol 58, Num 5, pp 3287-3292, issn 0018-9448, 6 p.Article

Improving the nonlinearity of certain balanced Boolean functions with good local and global avalanche characteristicsSTANICA, Pantelimon; SOO HAK SUNG.Information processing letters. 2001, Vol 79, Num 4, pp 167-172, issn 0020-0190Article

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

Constructing Symmetric Boolean Functions With Maximum Algebraic ImmunityLONGJIANG QU; KEQIN FENG; FENG LIU et al.IEEE transactions on information theory. 2009, Vol 55, Num 5, pp 2406-2412, issn 0018-9448, 7 p.Article

Monomial bent functionsLEANDER, Nils Gregor.IEEE transactions on information theory. 2006, Vol 52, Num 2, pp 738-743, issn 0018-9448, 6 p.Article

Bent functions with 2r 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

A survey of some recent results on Bent functionsDOBBERTIN, Hans; LEANDER, Gregor.Lecture notes in computer science. 2005, pp 1-29, issn 0302-9743, isbn 3-540-26084-6, 29 p.Conference Paper

On the complexity of slice functionsWEGENER, I.Theoretical computer science. 1985, Vol 38, Num 1, pp 55-68, issn 0304-3975Article

Extremal generalized S-boxesSATKO, Ladislav; GROSEK, Otokar; NEMOGA, Karol et al.Computing and informatics. 2003, Vol 22, Num 1, pp 85-99, issn 1335-9150, 15 p.Article

Linear equations and interpolation in Boolean algebraMELTER, R. A; RUDEANU, S.Linear algebra and its applications. 1984, Vol 57, pp 31-40, issn 0024-3795Article

Computation of boolean functions on networks of binary automataTCHUENTE, M.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 269-277, issn 0022-0000Article

The Degree of Balanced Elementary Symmetric Boolean Functions of 4k + 3 VariablesGAO, Guang-Pu; LIU, Wen-Fen; ZHANG, Xi-Yong et al.IEEE transactions on information theory. 2011, Vol 57, Num 7, pp 4822-4825, issn 0018-9448, 4 p.Article

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

  • Page / 98