English

Thresholds of Random Quasi-Abelian Codes

Information Theory 2013-07-08 v2 math.IT

Abstract

For a random quasi-abelian code of rate rr, it is shown that the GV-bound is a threshold point: if rr is less than the GV-bound at δ\delta, then the probability of the relative distance of the random code being greater than δ\delta is almost 1; whereas, if rr is bigger than the GV-bound at δ\delta, 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

R2 v1 2026-06-22T00:38:41.521Z