On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve

Edoardo Ballico, Alberto Ravagnani

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)

Abstract

In this paper we study evaluation codes arising from plane quotients of the Hermitian curve, defined by affine equations of the form y q + y = x m, q being a prime power and m a positive integer which divides q + 1. The dual minimum distance and minimum weight of such codes are studied from a geometric point of view. In many cases we completely describe the minimum-weight codewords of their dual codes through a geometric characterization of the supports, and provide their number. Finally, we apply our results to describe Goppa codes of classical interest on such curves.

Original languageEnglish
Pages (from-to)343-354
Number of pages12
JournalApplicable Algebra in Engineering, Communication and Computing
Volume24
Issue number5
DOIs
Publication statusPublished - Nov 2013

Keywords

  • Evaluation code
  • Goppa code
  • Minimum distance
  • Minimum-weight codeword
  • Quotient of Hermitian curve

Fingerprint

Dive into the research topics of 'On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve'. Together they form a unique fingerprint.

Cite this