An improvement of the Feng--Rao bound on minimum distance

Authors:
Gary Salazar;Diana Dunn;Sarah B. Graham
Affiliations:
Department of Mathematics, Trinity University, San Antonio, TX 78212-7200, USA;Department of Mathematics, University of Virginia, Charlottesville, VA 22904-4137, USA;Department of Mathematical Sciences, Clemson University, Clemson, SC 29634-0975, USA
Venue:
Finite Fields and Their Applications
Year:
2006

Citing 7
Cited 0

Decoding Affine Variety Codes Using Gröbner Bases

Designs, Codes and Cryptography
Introduction to Coding Theory

Introduction to Coding Theory
Improved geometric Goppa codes. I. Basic theory

IEEE Transactions on Information Theory - Part 1
On Weierstrass semigroups and the redundancy of improved geometric Goppa codes

IEEE Transactions on Information Theory
On the parameters of algebraic-geometry codes related to Arf semigroups

IEEE Transactions on Information Theory
On codes from norm-trace curves

Finite Fields and Their Applications
Computing Weierstrass Semigroups and the Feng-Rao Distance from Singular Plane Models

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a lower bound for the minimum distance of certain affine variety codes which is better than the Feng-Rao bound. We also introduce a minimum distance estimate which, at times, can serve as a lower bound as well.