On Cusick-Cheon's Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code

2008/02/23 by Yuri Borissov, Borissov, Yuri L.
Biochemistry, Genetics and Molecular Biology · Computer Science · #Cellular Automata and Applications #Coding theory and cryptography #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.0802.3437

openalex publication_date 2008/02/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

It is proved an amplification of Cusick-Cheon's conjecture on balanced Boolean functions in the cosets of the binary Reed-Muller code RM(k,m) of order k and length 2^m, in the cases where k = 1 or k >= (m-1)/2.

Related

• On cryptographic properties of the cosets of R(1, m)
• A Note on a Conjecture for Balanced Elementary Symmetric Boolean Functions
• Asymptotically optimal Boolean functions
• On codes decoding a constant fraction of errors on the BSC
• Computing the Weight Distribution of the Binary Reed-Muller Code \mathcal R (4,9)