Bounding minimum distances of cyclic codes using algebraic geometry
|
Descargar SCORM
Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
Bounding minimum distances of cyclic codes using algebraic geometry
|
| Id. |
20816322 |
| Titulo |
Bounding minimum distances of cyclic codes using algebraic geometry |
| Autor(es) |
Boston, Nigel
|
| Localización |
http://arxiv.org/abs/math/0009257
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
There are many results on the minimum distance of a cyclic code of the form
that if a certain set T is a subset of the defining set of the code, then the
minimum distance of the code is greater than some integer t. This includes the
BCH, Hartmann-Tzeng, Roos, and shift bounds and generalizations of these. In
this paper we define certain projective varieties V(T,t) whose properties
determine whether, if T is in the defining set, the code has minimum distance
exceeding t. Thus our attention shifts to the study of these varieties. By
investigating them using class field theory and arithmetical geometry, we will
prove various new bounds. It is interesting, however, to note that there are
cases that existing methods handle, that our methods do not, and vice versa. We
end with a number of conjectures.
|
| Palabras clave |
Mathematics - Number Theory
|
| Tipo de recurso |
Texto Narrativo
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
| Requerimientos técnicos |
Browser: Any
|
| Fecha de contribución |
26-mar-2007 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
