2005
DOI: 10.1007/s10623-005-6403-4
|View full text |Cite
|
Sign up to set email alerts
|

On Goppa Codes and Weierstrass Gaps at Several Points

Abstract: We generalize results of Homma and Kim [J.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

6
114
0
11

Year Published

2008
2008
2020
2020

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 84 publications
(131 citation statements)
references
References 18 publications
6
114
0
11
Order By: Relevance
“…With the Klein curve over F 8 , and for G = 2∆, we found a code of type [24,4,19]. In this case, D ∼ 8∆ and the code with G = 6∆ is of type [24,16,7]. This is the best known three-error-correcting code of length 24 over F 8 .…”
Section: Theorem 134 (Symmetric Floor Bound) Letmentioning
confidence: 75%
See 1 more Smart Citation
“…With the Klein curve over F 8 , and for G = 2∆, we found a code of type [24,4,19]. In this case, D ∼ 8∆ and the code with G = 6∆ is of type [24,16,7]. This is the best known three-error-correcting code of length 24 over F 8 .…”
Section: Theorem 134 (Symmetric Floor Bound) Letmentioning
confidence: 75%
“…The top row in the table below gives the weight distribution for a code of type [24,16,7] over F 8 constructed with the Klein curve. The method outlined here produces the weight distributions for all 2744 = 14 3 codes of type [24,16] on the Klein curve.…”
Section: A(u T ) = L(t )λ(U − T ) ∈ Cγ[u ](T )mentioning
confidence: 99%
“…For this curve, taking m = 1, by Theorem 3.4, we have that (2,11), (3,3), (4, 13), (5, 5), (7, 7), (10, 10), (11,2), (13,4), (19, 1)} .…”
Section: Now We Must Prove That L(amentioning
confidence: 99%
“…Kim in [11]. In [2], C. Carvalho and F. Torres used the concept of pure gaps to obtain codes whose minimum distance have bounds better than the Goppa bound. Using the concept of discrepancy we have the following result to obtain pure gaps.…”
Section: Now We Must Prove That L(amentioning
confidence: 99%
“…. , a n ) ∈ N n such that there is a rational function on X with a 1 P 1 + · · · + a n P n as its divisor of poles ( [1], [2], [3]) The set H(P 1 , . .…”
Section: The Heaviest N-semigroups?mentioning
confidence: 99%