
arXiv: 1806.08392
We investigate the weight distribution of random binary linear codes. For 0 < λ < 1 and n→∞ pick uniformly at random λn vectors in and let 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 .
FOS: Computer and information sciences, Combinatorial probability, Computer Science - Information Theory, Information Theory (cs.IT), weight distribution, Bounds on codes, exponential family, FOS: Mathematics, Mathematics - Combinatorics, Probability distributions: general theory, Combinatorics (math.CO), random linear code, Linear codes (general theory)
FOS: Computer and information sciences, Combinatorial probability, Computer Science - Information Theory, Information Theory (cs.IT), weight distribution, Bounds on codes, exponential family, FOS: Mathematics, Mathematics - Combinatorics, Probability distributions: general theory, Combinatorics (math.CO), random linear code, Linear codes (general theory)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
