Nonlinearity of some invariant Boolean functions

DOI10.1007/s10623-004-1700-xzbMath1079.94021OpenAlexW2023943271MaRDI QIDQ2487212

J.-P. Zanotti, Philippe Langevin

Publication date: 18 August 2005

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-004-1700-x

zbMATH Keywords

finite groupsFourier transformsReed-Muller codescovering radiuscharactersnonlinearityBoolean functionscryptography.

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Arithmetic codes (94B40) Source coding (94A29)

Related Items

Secondary constructions of highly nonlinear Boolean functions and disjoint spectra plateaued functions, Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros

Cites Work

• Unnamed Item
• On ``bent functions
• On the bent Boolean functions that are symmetric
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• The covering radius of the (128,8) Reed-Muller code is 56 (Corresp.)
• Maximum nonlinearity of symmetric Boolean functions on odd number of variables
• On some cosets of the first-order Reed-Muller code with high minimum weight
• The covering radius of the<tex>(2^{15}, 16)</tex>Reed-Muller code is at least 16276