A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound (Q4544665): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2159193690 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:05, 19 March 2024
scientific article; zbMATH DE number 1775933
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
