Distance bounds for algebraic geometric codes

@article{Duursma2010DistanceBF,
  title={Distance bounds for algebraic geometric codes},
  author={I. Duursma and R. Kirov and Seungkook Park},
  journal={ArXiv},
  year={2010},
  volume={abs/1001.1374}
}
Various methods have been used to obtain improvements of the Goppa lower bound for the minimum distance of an algebraic geometric code. The main methods divide into two categories and all but a few of the known bounds are special cases of either the Lundell-McCullough floor bound or the Beelen order bound. The exceptions are recent improvements of the floor bound by Guneri-Stichtenoth-Taskin, and Duursma-Park, and of the order bound by Duursma-Park and Duursma-Kirov. In this paper we provide… Expand

Tables and Topics from this paper

On the order bounds for one-point AG codes
TLDR
This work investigates in detail the application of the order bound for the minimum distance of algebraic geometry codes to one-point algebraIC geometry codes, obtaining a bound $d^*$ for theminimum distance of these codes and establishing a connection between that bound and its generalizations. Expand
On the Weight Hierarchy of Codes Coming From Semigroups With Two Generators
TLDR
The formula obtained is applied to lower bounding the generalized Hamming weights, improving the bound given by Kirfel and Pellikaan in terms of the classical Feng-Rao distance and compared with a modification of the Griesmer bound. Expand
Two-Point Codes for the Generalized GK Curve
TLDR
This work improves previously known lower bounds for the minimum distance of certain two-point AG codes constructed using a Generalized Giulietti–Korchmaros curve (GGK), and finds several new improvements upon the MinT minimum distance tables. Expand
Delta sets for divisors supported in two points
TLDR
General properties of delta sets are given and sequences of divisors supported in two points on Hermitian and Suzuki curves are analyzed. Expand
Lower bounds on the minimum distance in Hermitian one-point differential codes
Korchmáros and Nagy [Hermitian codes from higher degree places. J Pure Appl Algebra, doi: 10. 1016/j.jpaa.2013.04.002, 2013] computed the Weierstrass gap sequence G(P) of the Hermitian function fieldExpand
Fast Decoding of Dual Multipoint Codes From Algebraic Curves Up to the Kirfel–Pellikaan Bound
TLDR
A fast method for decoding dual multipoint codes from algebraic curves up to the Kirfel–Pellikaan bound, based on the vectorial BMS algorithm with majority logic is presented, and it is shown that algebraic geometry codes from generic algebraic curve can be decodedup to the Goppa bound efficiently. Expand
Hermitian codes from higher degree places
Abstract Matthews and Michel (2005) [29] investigated the minimum distances of certain algebraic-geometry codes arising from a higher degree place P . In terms of the Weierstrass gap sequence at P ,Expand
Feng-Rao decoding of primary codes
TLDR
A very strong connection is demonstrated between Matsumoto and Miura’s bound and Andersen and Geilʼs bound when applied to primary one-point algebraic geometric codes, able to decode efficiently a large class of codes for which no non-trivial decoding algorithm was previously known. Expand
The minimum weights of two-point AG codes on norm-trace curves
TLDR
It turns out that the order-like bound for two-point AG codes on norm-trace curves is better than that of one-point codes on the same curves except for a few cases. Expand
A G ] 2 0 Ju n 20 12 Hermitian codes from higher degree places
Matthews and Michel [28] investigated the minimum distances in certain algebraic-geometry codes arising from a higher degree place P . In terms of the Weierstrass gap sequence at P , they proved aExpand
...
1
2
3
...

References

SHOWING 1-10 OF 32 REFERENCES
An extension of the order bound for AG codes
TLDR
A significant extension of the bound is provided that improves the order bounds by Beelen and by Duursma and Park and includes an exhaustive numerical comparison of the different bounds for 10168 two-point codes on the Suzuki curve of genus g=124 over the field of 32 elements. Expand
On the Parameters of Algebraic Geometric Codes
  • H. Janwa
  • Mathematics, Computer Science
  • AAECC
  • 1991
TLDR
The existence of many optimal and sub-optimal codes from algebraic geometry are shown and necessary conditions for equality to hold in the lower bound on the minimum distance of Goppa codes are given. Expand
On the minimum distance of cyclic codes
TLDR
A new lower bound for the minimum distance of cyclic codes that includes earlier bounds (i.e., BCH bound, HT bound, Roos bound) is created and can be even stronger than the first one. Expand
Further improvements on the designed minimum distance of algebraic geometry codes
In the literature about algebraic geometry codes one finds a lot of results improving Goppa�s minimum distance bound. These improvements often use the idea of �shrinking� or �growing� the definingExpand
Evaluation codes from order domain theory
TLDR
A simple lower bound on the minimum distance of codes defined by means of their generator matrices is derived and interpreted into the setting of order domain theory to fill in an obvious gap in the theory of order domains. Expand
Coset bounds for algebraic geometric codes
TLDR
New coset bounds for algebraic geometric codes are developed that improve both floor bounds and order bounds and provide for the first time a connection between the two types of bounds. Expand
A GENERALIZED FLOOR BOUND FOR THE MINIMUM DISTANCE OF GEOMETRIC GOPPA CODES AND ITS APPLICATION TO TWO-POINT CODES
We prove a new bound for the minimum distance of geometric Goppa codes that generalizes two previous improved bounds. We include examples of the bound to one and two point codes over both the SuzukiExpand
Riemann-Roch spaces of the Hermitian function field with applications to algebraic geometry codes and low-discrepancy sequences
This paper is concerned with two applications of bases of Riemann-Roch spaces. In the first application, we define the floor of a divisor and obtain improved bounds on the parameters of algebraicExpand
The order bound for general algebraic geometric codes
  • Peter Beelen
  • Computer Science, Mathematics
  • Finite Fields Their Appl.
  • 2007
The order bound gives an in general very good lower bound for the minimum distance of one-point algebraic geometric codes coming from curves. This paper is about a generalization of the order boundExpand
The minimum distance of codes in an array coming from telescopic semigroups
TLDR
The concept of an error-correcting array gives a new bound on the minimum distance of linear codes and a decoding algorithm which decodes up to half this bound and is explained in terms of linear algebra and the theory of semigroups only. Expand
...
1
2
3
4
...