We develop new coset bounds for algebraic geometric codes. The bounds have a natural
interpretation as an adversary threshold for algebraic geometric secret sharing schemes and …

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 …

This paper is concerned with the construction of algebraic geometric codes defined from
Kummer extensions. It plays a significant role in the study of such codes to describe bases …

In this paper, by employing some results on Kummer extensions, we give an arithmetic
characterization of pure Weierstrass gaps at many totally ramified places on a quotient of the …

This paper is concerned with the construction of algebraic geometric codes defined from
GGS curves. It is of significant use to describe bases for the Riemann-Roch spaces …

A generalized floor bound for the minimum distance of geometric Goppa codes -
ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Help …

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 …

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 most successful method to obtain lower bounds for the minimum distance of an
algebraic geometric code is the order bound, which generalizes the Feng-Rao bound. By …

In this paper, we give a new lower bound for generalized algebraic geometry codes with
which we are able to construct some new linear codes having better parameters compared …