Name
Abstract | ||
|---|---|---|
We construct a class of ZprZps-additive cyclic codes generated by pairs of polynomials, where p is a prime number. Based on probabilistic arguments, we determine the asymptotic rates and relative distances of this class of codes: the asymptotic Gilbert-Varshamov bound at 1+ps−r2δ is greater than 12 and the relative distance of the code is convergent to δ, while the rate is convergent to 11+ps−r for 0<δ<11+ps−r and 1≤r<s. As a consequence, we prove that there exist numerous asymptotically good ZprZps-additive cyclic codes. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.ffa.2020.101633 | Finite Fields and Their Applications |
Keywords | Field | DocType |
94B05,94B15 | Combinatorics,Prime number,Polynomial,Mathematics | Journal |
Volume | ISSN | Citations |
63 | 1071-5797 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ting Yao | 1 | 0 | 0.34 |
| Shixin Zhu | 2 | 216 | 37.61 |
| Xiaoshan Kai | 3 | 0 | 0.34 |