Name
Abstract | ||
|---|---|---|
Quasi-twisted codes of fixed index >1 have been shown recently to be asymptotically good (A. Alahmadi, C. Güneri, H. Shoaib, P. Solé, 2017). We use this result to construct asymptotically good additive constacyclic codes on any extension of a fixed degree of the base field. A similar result is proved for additive cyclic codes under Artin conjecture on primitive roots. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/LCOMM.2018.2863370 | IEEE Communications Letters |
Keywords | Field | DocType |
Additives,Indexes,Linear codes,Reed-Solomon codes,Decoding,Hamming weight | Discrete mathematics,Computer science,Artin L-function,Computer network,Decoding methods,Hamming weight,Primitive root modulo n | Journal |
Volume | Issue | ISSN |
22 | 10 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minjia Shi | 1 | 28 | 20.11 |
| Rongsheng Wu | 2 | 9 | 4.67 |
| Patrick Solé | 3 | 7 | 6.25 |