Castle curves and codes

Carlos Munuera; Alonso Sepúlveda; Fernando Torres

doi:10.3934/amc.2009.3.399

Article Contents

2009, Volume 3, Issue 4: 399-408. Doi: 10.3934/amc.2009.3.399

This issue Previous Article Partitions of $\mathbb F$ⁿ into non-parallel Hamming codes Next Article On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings

Castle curves and codes

1.
Department of Applied Mathematics, University of Valladolid, Avda Salamanca SN, 47014 Valladolid, Castilla
2.
Faculdade de Matemática, Universidade Federal de Uberlândia, Av. J.N. de Ávila 2160, Uberlândia, 38408-100, MG-Brazil
3.
Institute of Mathematics, Statistics and Computer Science, P.O. Box 6065, University of Campinas, 13083-970, Campinas, SP

Received: July 2009

Revised: October 2009

Published: November 2009

Abstract Related Papers Cited by

Abstract

We introduce two types of curves of interest for coding theory purposes: the so-called Castle and weak Castle curves. We study the main properties of codes arising from these curves.

Keywords:

Mathematics Subject Classification: Primary:94B27; Secondary: 14G50, 14H55.

Citation:

Article Metrics

HTML views() PDF downloads(153) Cited by(0)

Castle curves and codes

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

Castle curves and codes

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content