DocumentCode
747733
Title
Subclass of binary Goppa codes with minimal distance equal to the design distance
Author
Bezzateev, Sergei V. ; Shekhunova, Natalia A.
Author_Institution
Fac. of Eng., Nagoya Univ., Japan
Volume
41
Issue
2
fYear
1995
fDate
3/1/1995 12:00:00 AM
Firstpage
554
Lastpage
555
Abstract
A subclass of binary Goppa codes specified by a separable polynomial G(x)=xt+A and a subset L of elements of GF(2m ) (no element of L may be a root of G(x) and t|(2m-1), A is a tth power in {GF(2m)/{0}}, is studied. For such codes it is shown that their minimal distance is equal to the design distance d=2t+1
Keywords
Goppa codes; binary sequences; polynomials; binary Goppa codes; design distance; minimal distance; separable polynomial; Communication system control; Computer science; Cryptography; Equations; Error correction codes; Galois fields; Hamming weight; IEEE Press; Independent component analysis; Information rates; Information theory; Notice of Violation; Polynomials;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.370170
Filename
370170
Link To Document