MODULAR CURVES AND CODES WITH POLYNOMIAL COMPLEXITY OF CONSTRUCTION.

S. G. Vleduts, G. L. Katsman, M. A. Tsfasman

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

The authors construct and analyze linear q-ary codes that arise from modular Drinfel'd, and the associated binary codes. All these codes have polynomial complexity of construction and 'good' asymptotic parameters: q-ary codes for q equals p**2**m greater than equivalent to 49 lie above the Varshamov-Gilbert bound on some segment, while binary codes lie above the Blokh-Zyablov bound everywhere.

Original languageEnglish
Pages (from-to)35-42
Number of pages8
JournalProblems of information transmission
Volume20
Issue number1
Publication statusPublished - 1984
Externally publishedYes

Fingerprint

Dive into the research topics of 'MODULAR CURVES AND CODES WITH POLYNOMIAL COMPLEXITY OF CONSTRUCTION.'. Together they form a unique fingerprint.

Cite this