English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We present methods for computing the distance from a Boolean polynomial on$m$ variables of degree $m-3$ (i.e., a member of the Reed-Muller code$RM(m-3,m)$) to the space of lower-degree polynomials ($RM(m-4,m)$). Themethods give verifiable certificates for both the lower and upper bounds onthis distance. By applying these methods to representative lists ofpolynomials, we show that the covering radius of $RM(4,8)$ in $RM(5,8)$ is 26and the covering radius of $RM(5,9)$ in $RM(6,9)$ is between 28 and 32inclusive, and we get improved lower bounds for higher~$m$. We also apply ourmethods to various polynomials in the literature, thereby improving the knownbounds on the distance from 2-resilient polynomials to $RM(m-4,m)$.

The Covering Radius of the Reed-Muller Code $RM(m-4,m)$ in $RM(m-3,m)$