Thresholds of Random Quasi-Abelian Codes

preprint2013arXivOpen access

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 δδ, then the probability of the relative distance of the random code being greater than δδ is almost 1; whereas, if rr 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.