On the computation of the Möbius transform

DOI10.1016/j.tcs.2019.12.005zbMath1448.94307arXiv2004.11146OpenAlexW2961782858MaRDI QIDQ2290627

Hayat Cheballah, Jean-Marie Le Bars, Morgan Barbier

Publication date: 29 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.11146

zbMATH Keywords

Boolean functionsMöbius transformbutterfly algorithm

Mathematics Subject Classification ID

Boolean functions (06E30) Boolean functions (94D10)

Related Items (3)

Isomorphism and equivalence of Galois nonlinear feedback shift registers ⋮ Tangent-Chebyshev maps over finite fields: new properties and functional graphs ⋮ On Galois NFSRs equivalent to Fibonacci ones

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Möbius transformations of matrix polynomials
• A family of difference sets in non-cyclic groups
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• Computing the Weight of a Boolean Function from Its Algebraic Normal Form
• Möbius transforms, coincident Boolean functions and non-coincidence property of Boolean functions
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Cryptanalysis of Achterbahn-128/80
• Graph-Based Algorithms for Boolean Function Manipulation
• An Upper Bound on the Number of m-Resilient Boolean Functions
• On the weight structure of Reed-Muller codes

This page was built for publication: On the computation of the Möbius transform