On the weight distribution of random binary linear codes

06/21/2018
by   Nati Linial, et al.
0

We investigate the weight distribution of random binary linear codes. For 0<λ<1 and n→∞ pick uniformly at random λ n vectors in F_2^n and let C <F_2^n 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).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/04/2022

Weight distribution of random linear codes and Krawchouk polynomials

For 0 < λ < 1 and n →∞ pick uniformly at random λ n vectors in {0,1}^n a...
research
11/28/2022

Certain binary minimal codes constructed using simplicial complexes

In this article, we work over the non-chain ring ℛ = ℤ_2[u]/⟨ u^3 - u⟩. ...
research
01/16/2020

Weight Enumerators for Number-Theoretic Codes and Cardinalities of Non-binary VT Codes

This paper investigates the extended weight enumerators for the number-t...
research
09/25/2018

An upper bound on ℓ_q norms of noisy functions

Let T_ϵ be the noise operator acting on functions on the boolean cube {0...
research
11/01/2017

On the complete weight enumerators of some linear codes with a few weights

Linear codes with a few weights have important applications in authentic...
research
06/06/2018

Binary linear code weight distribution estimation by random bit stream compression

A statistical estimation algorithm of the weight distribution of a linea...
research
12/30/2019

Distribution of the minimal distance of random linear codes

We study the distribution of the minimal distance (in the Hamming metric...

Please sign up or login with your details

Forgot password? Click here to reset