Thumbnail
Access Restriction
Subscribed

Author Roseiro, A.M. ♦ Hall, J.I. ♦ Adney, J.E. ♦ Siegel, M.
Sponsorship IEEE Information Theory Society
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1963
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Hamming weight ♦ Kernel ♦ Equations ♦ Redundancy ♦ Error correction codes ♦ Decoding ♦ Mathematics ♦ Polynomials ♦ Linear code ♦ Algorithm design and analysis
Abstract The dimension of subfield subcodes and in particular generalized Goppa codes is studied using the kernel of an associated trace map. Bounds on the dimension for a particular general class of binary Goppa codes are obtained. Deeper study of some special cases and other related polynomials yields still tighter bounds for any s>1.<<ETX>>
Description Author affiliation :: Alcatel Espace, Courbevoie, France
ISSN 00189448
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1992-05-01
Publisher Place U.S.A.
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Volume Number 38
Issue Number 3
Size (in Bytes) 453.37 kB
Page Count 4
Starting Page 1130
Ending Page 1133


Source: IEEE Xplore Digital Library