Thresholds of Random Quasi-Abelian Codes
classification
💻 cs.IT
math.IT
keywords
gv-bounddeltaquasi-abelianrandomalmostcodecodesprobability
read the original abstract
For a random quasi-abelian code of rate $r$, it is shown that the GV-bound is a threshold point: if $r$ 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 $r$ 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.