\( \mathbb{Z}_p\mathbb{Z}_{p^s} \)-additive cyclic codes are asymptotically good (Q2179519)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7199664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \( \mathbb{Z}_p\mathbb{Z}_{p^s} \)-additive cyclic codes are asymptotically good |
scientific article; zbMATH DE number 7199664 |
Statements
\( \mathbb{Z}_p\mathbb{Z}_{p^s} \)-additive cyclic codes are asymptotically good (English)
0 references
12 May 2020
0 references
\( \mathbb{Z}_p\mathbb{Z}_{p^s} \)-additive cyclic codes
0 references
generator matrix
0 references
random codes
0 references
GV-bound
0 references
asymptotically good codes
0 references
0 references
0 references
0.9668576717376708
0 references
0.9592296481132508
0 references
0.88527911901474
0 references
0.8365123867988586
0 references
0.8284959197044373
0 references
