GOPPA CODES THAT ARE BETTER THAN THE VARSHAMOV-GILBERT BOUND.

M. A. Tsfasman

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)

Abstract

It is shown that there exist an infinite series of q-ary linear Goppa codes that arise from objects of algebraic geometry, whose parameters are asymptotically higher (as n approaches infinity ) than the Varshamov-Gilbert Bound.

Original languageEnglish
Pages (from-to)163-166
Number of pages4
JournalProblems of information transmission
Volume18
Issue number3
Publication statusPublished - 1982
Externally publishedYes

Fingerprint

Dive into the research topics of 'GOPPA CODES THAT ARE BETTER THAN THE VARSHAMOV-GILBERT BOUND.'. Together they form a unique fingerprint.

Cite this