Counting balanced Boolean functions for some degree

DOI10.1016/J.TCS.2026.116125MaRDI QIDQ7319271zbMATH OpenFDO

Authors Younhwan Cheon

Publication date 25 August 2026

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

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116125

Mathematics Subject Classification ID

Theory of computing (68Qxx) Coding theorems (Shannon theory) (94A24) Cryptography (94A60) Boolean functions (94D10)

Cites work

• \(GL(m,2)\) acting on \(R(r,m)/R(r-1,m)\)
• A refinement of Cusick-Cheon bound for the second order binary Reed-Muller code
• Bent functions. Fundamentals and results
• Boolean Functions Satisfying Higher Order Propagation Criteria
• Characterizations of partially bent and plateaued functions over finite fields
• Conjectures on the number of balanced Boolean functions of bounded degree
• Counting Balanced Boolean Functions innVariables with Bounded Degree
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 708811 (Why is no real title available?)
• On the Cusick–Cheon Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed–Muller Code
• On the weight distribution of second order Reed-Muller codes and their relatives
• The weight distribution of the third-order Reed-Muller code of length 512
• Weight enumerator for second-order Reed-Muller codes

This page was built for publication: Counting balanced Boolean functions for some degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319271)