Cumulative Distance Enumerators of Random Codes and their Thresholds
Information Theory
2012-12-27 v1 math.IT
Abstract
Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic Gilbert-Varshamov bound is a very sharp threshold point for the density of the linear codes whose relative distance is greater than a given positive number. For arbitrary random codes, similar settings and results are exhibited; in particular, the very sharp threshold point for the density of the codes whose relative distance is greater than a given positive number is located at half the asymptotic Gilbert-Varshamov bound.
Cite
@article{arxiv.1212.5679,
title = {Cumulative Distance Enumerators of Random Codes and their Thresholds},
author = {Yun Fan and San Ling and Hongwei Liu and Jing Shen and Chaoping Xing},
journal= {arXiv preprint arXiv:1212.5679},
year = {2012}
}