Thresholds of Random Quasi-Abelian Codes
Information Theory
2013-07-08 v2 math.IT
Abstract
For a random quasi-abelian code of rate , it is shown that the GV-bound is a threshold point: if is less than the GV-bound at , then the probability of the relative distance of the random code being greater than is almost 1; whereas, if is bigger than the GV-bound at , then the probability is almost 0. As a consequence, there exist many asymptotically good quasi-abelian codes with any parameters attaining the GV-bound.
Cite
@article{arxiv.1306.5377,
title = {Thresholds of Random Quasi-Abelian Codes},
author = {Yun Fan and Liren Lin},
journal= {arXiv preprint arXiv:1306.5377},
year = {2013}
}
Comments
20 pages