Modular curves and codes with polynomial complexity of construction (Q761415): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: S. G. Vleduts / rank | |||
| Property / author | |||
| Property / author: Michael A. Tsfasman / rank | |||
| Property / author | |||
| Property / author: S. G. Vleduts / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Michael A. Tsfasman / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:08, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Modular curves and codes with polynomial complexity of construction |
scientific article |
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
