Model
Digital Document
Publisher
Florida Atlantic University
Description
Properties of Goppa codes are studied. These are
"good" codes in the sense that they asymptotically
approach the Varshamov-Gilbert bound. E. N. Gilbert and
R. R. Varshamov have shown (independently) that it is
possible to construct an (n, k) linear code over GF(q)
with minimum distance d if [equation] and there are long Goppa codes which achieve this bound [10]. Subclasses of Goppa codes which remain invariant under symmetries are given special attention.
"good" codes in the sense that they asymptotically
approach the Varshamov-Gilbert bound. E. N. Gilbert and
R. R. Varshamov have shown (independently) that it is
possible to construct an (n, k) linear code over GF(q)
with minimum distance d if [equation] and there are long Goppa codes which achieve this bound [10]. Subclasses of Goppa codes which remain invariant under symmetries are given special attention.
Member of