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 investigate the weight distribution of random binary linear codes. For$0<\lambda<1$ and $n\to\infty$ pick uniformly at random $\lambda n$ vectors in$\mathbb{F}_2^n$ and let $C \le \mathbb{F}_2^n$ be the orthogonal complement oftheir span. Given $0<\gamma<1/2$ with $0< \lambda < h(\gamma)$ let $X$ be therandom variable that counts the number of words in $C$ of Hamming weight$\gamma n$. In this paper we determine the asymptotics of the moments of $X$ ofall orders $o(\frac{n}{\log n})$.

On the weight distribution of random binary linear codes