✦ LIBER ✦

A recursive formula for weights of Boolean rotation symmetric functions

✍ Scribed by Thomas W. Cusick; Dan Padgett

Book ID: 113564731
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 231 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.11.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of rotation symmetric Boolean fu

A class of rotation symmetric Boolean functions with optimum algebraic immunity

✍ Chunlei Li; Xiangyong Zeng; Wei Su; Lei Hu 📂 Article 📅 2008 🏛 Wuhan University 🌐 English ⚖ 327 KB

Synthesis procedure for Â¿-symmetric boo

Synthesis procedure for Â¿-symmetric boolean functions

✍ Kekre, H.B.; Sahasrabudhe, S.C.; Rama Rao, V. 📂 Article 📅 1980 🏛 The Institution of Electrical Engineers ⚖ 346 KB

On the weight and nonlinearity of homoge

On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2

✍ Hyeonjin Kim; Sung-Mo Park; Sang Geun Hahn 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 403 KB

A recursive formula for the correlations

A recursive formula for the correlations of Walsh functions

✍ Ta-Mu Chien 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 356 KB

The correlation function of two Walsh functions appears in image processing, signal multiplexing, detection and spectral analysis using Walsh functions. Though Walsh functions are two-valued, their correlation functions are real-valued and rather diffccult to evaluate. A recursive formula is develop

A rotation theorem for the class of univ

A rotation theorem for the class of univalent p-symmetric functions

✍ V. Ya. Gutlyanskii 📂 Article 📅 1971 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 102 KB

A $4n$ Lower Bound on the Combinational

A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions

✍ Zwick, Uri 📂 Article 📅 1991 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 747 KB