5 search results - page 1 / 1 » Weierstrass Pairs and Minimum Distance of Goppa Codes |
78
Voted
DCC
2001
IEEE
16 years 9 days ago
2001
IEEE
We prove that elements of the Weierstrass gap set of a pair of points may be used to define a geometric Goppa code which has minimum distance greater than the usual lower bound. We...
DCC
2005
IEEE
16 years 9 days ago
2005
IEEE
We generalize results of Homma and Kim [2001, J. Pure Appl. Algebra 162, 273?290] concerning an improvement on the Goppa bound on the minimum distance of certain Goppa codes.
108
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
Let S = {si}iIN IN be a numerical semigroup. For si S, let (si) denote the number of pairs (si -sj, sj) S2 . When S is the Weierstrass semigroup of a family {Ci}iIN of one-point...
84
Voted
FFA
2007
15 years 20 days ago
2007
From a rational convex polytope of dimension r ≥ 2 J.P. Hansen constructed an error correcting code of length n = (q−1)r over the finite field Fq. A rational convex polytope...
114
Voted
EJC
2008
14 years 11 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...