A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound (Q4544665)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound |
scientific article; zbMATH DE number 1775933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound |
scientific article; zbMATH DE number 1775933 |
Statements
A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound (English)
0 references
4 August 2002
0 references
Algebraic-geometry code
0 references
function field tower
0 references
concatenated code
0 references
Gilbert-Varshamov bound
0 references
one-point AG codes
0 references
pole canceling algorithm
0 references
0.76073384
0 references
0.7355573
0 references
0.7348697
0 references
0.71053314
0 references
0.70317423
0 references
0.70266974
0 references
0.69917786
0 references
