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

preprint2013arXivOpen access

Abstract

In this paper we study evaluation codes arising from plane quotients of the Hermitian curve, defined by affine equations of the form yq+y=xmy^q+y=x^m, qq being a prime power and mm a positive integer which divides q+1q+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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.