Skip to main navigation Skip to search Skip to main content

The dual minimum distance of arbitrary-dimensional algebraic-geometric codes

Research output: Contribution to journalArticlepeer-review

Abstract

In this article, the minimum distance of the dual C of a functional code C on an arbitrary-dimensional variety X over a finite field Fq is studied. The approach is based on problems à la Cayley-Bacharach and consists in describing the minimal configurations of points on X which fail to impose independent conditions on forms of some degree m. If X is a curve, the result improves in some situations the well-known Goppa designed distance.

Original languageEnglish
Pages (from-to)84-107
Number of pages24
JournalJournal of Algebra
Volume350
Issue number1
DOIs
Publication statusPublished - 15 Jan 2012
Externally publishedYes

Keywords

  • Algebraic geometry
  • Algebraic-geometric codes
  • Error-correcting codes
  • Finite fields
  • Linear systems

Fingerprint

Dive into the research topics of 'The dual minimum distance of arbitrary-dimensional algebraic-geometric codes'. Together they form a unique fingerprint.

Cite this