Computer Science – Information Theory
Scientific paper
2010-01-08
Computer Science
Information Theory
29 pages
Scientific paper
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 short proofs for all floor bounds and most order bounds in the setting of the van Lint and Wilson AB method. Moreover, we formulate unifying theorems for order bounds and formulate the DP and DK order bounds as natural but different generalizations of the Feng-Rao bound for one-point codes.
Duursma Iwan
Kirov Radoslav
Park Seungkook
No associations
LandOfFree
Distance bounds for algebraic geometric codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Distance bounds for algebraic geometric codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance bounds for algebraic geometric codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-580082