A refinement of Cusick–Cheon bound for the second order binary Reed–Muller code
Review articleOpen access
Abstract:

AbstractWe prove a stronger form of the conjectured Cusick–Cheon lower bound for the number of quadratic balanced Boolean functions. We also prove various asymptotic results involving B(k,m), the number of balanced Boolean functions of degree ≤k in m variables, in the case k=2. Finally, we connect our results for k=2 with the (still unproved) conjectures of Cusick–Cheon for the functions B(k,m) with k>2.

Request full text

References (0)

Cited By (0)

No reference data.
No citation data.
Advertisement
Join Copernicus Academic and get access to over 12 million papers authored by 7+ million academics.
Join for free!