Modular curves and codes with polynomial complexity of construction (Q761415)
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: Modular curves and codes with polynomial complexity of construction |
scientific article; zbMATH DE number 3885788
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Modular curves and codes with polynomial complexity of construction |
scientific article; zbMATH DE number 3885788 |
Statements
Modular curves and codes with polynomial complexity of construction (English)
0 references
1984
0 references
The authors construct and analyze linear \(q\)-ary codes that arise from modular Drinfel'd curves, and the associated binary codes. All these codes have polynomial complexity of construction and ``good'' asymptotic parameters: \(q\)-ary codes for \(q=p^{2m}\geq 49\) lie above the Varshamov-Gilbert bound on some segment, while binary codes lie above the Blokh-Zyablov bound everywhere.
0 references
concatenated codes
0 references
modular curves
0 references
\(q\)-ary block codes
0 references
polynomial complexity of construction
0 references
binary codes
0 references
0.9826588
0 references
0 references
0.90186346
0 references
0.89790165
0 references
