“…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 .…”
“…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
This chapter describes some of the basic properties of geometric Goppa codes, including relations to other families of codes, bounds for the parameters, and sufficient conditions for efficient error correction. Special attention is given to recent results on two-point codes from Hermitian curves and to applications for secret sharing.
“…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 .…”
“…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
This chapter describes some of the basic properties of geometric Goppa codes, including relations to other families of codes, bounds for the parameters, and sufficient conditions for efficient error correction. Special attention is given to recent results on two-point codes from Hermitian curves and to applications for secret sharing.
“…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.…”
Abstract. We determine the Weierstrass semigroup H(P ∞ , P 1 , . . . , P m ) at several points on the GK curve. In addition, we present conditions to find pure gaps on the set of gaps G(P ∞ , P 1 , . . . , P m ). Finally, we apply the results to obtain AG codes with good relative parameters.
“…. , 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 , . .…”
We propose the two "heaviest" Weierstrass n-semigroups for nonhyperelliptic curves (one on trigonal curves with maximal Maroni invariant and with totally ramification points and one on bielliptic curves and with as points some of the ramification points). We compute them when n = 2.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.