Name
Abstract | ||
|---|---|---|
We study Goppa codes, Γ(L,g), defined by the polynomial g(z)=a(z)TrFpms:Fps(b(z)). It is shown that the dimension of these codes never reaches the general, well-known, bound for Goppa codes. New bounds are proposed depending on the value of m and p. Furthermore, we prove that when p=2 these codes have only even weights |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/18.651048 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
polynomial g,trace operator,new bound,goppa code,error exponent,indexing terms,bch code,weight distribution,polynomials,binomial distribution,polynomial,information theory | Information theory,Discrete mathematics,Combinatorics,Polynomial,Mathematical Operators,Code dimension,Trace operator,Mathematics | Journal |
Volume | Issue | ISSN |
44 | 1 | 0018-9448 |
Citations | PageRank | References |
7 | 0.61 | 7 |
Authors | ||
1 | ||