On the weight distribution of random binary linear codes
Abstract
We investigate the weight distribution of random binary linear codes. For 0<λ<1 and n∞ pick uniformly at random λ n vectors in F2n and let C F2n be the orthogonal complement of their span. Given 0<γ<1/2 with 0< λ < h(γ) let X be the random variable that counts the number of words in C of Hamming weight γ n. In this paper we determine the asymptotics of the moments of X of all orders o(n n).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.