Izvorni znanstveni članak

Parameterized codes over some embedded sets and their applications to complete graphs

Manuel González Sarabia ; Departamento de Ciencias Básicas, Unidad Profesional Interdisciplinaria en Ingeniería Tecnologías Avanzadas, Instituto Politécnico Nacional, México
Carlos Rentería Márquez ; Departamento de Matemáticas, Escuela Superior de Física y Matemáticas, Instituto Politécnico Nacional, México
Eliseo Sarmiento Rosales ; Departamento de Matemáticas, Escuela Superior de Física y Matemáticas, Instituto Politécnico Nacional, México

Sažetak

Let $K$ be a finite field, let $X \subset \mathbb{P}^{m-1}$ and $X' \subset \mathbb{P}^{r-1}$, with $r We also find the regularity index in the case of toric sets parameterized by the edges of a complete graph. Finally, we give some bounds for the minimum distance of the linear codes associated to complete graphs.

Ključne riječi

finite fields; regularity index; minimum distance; parameterized codes; embedded sets; complete graphs

Hrčak ID:

110830

URI

https://hrcak.srce.hr/110830

Datum izdavanja:

19.11.2013.

Posjeta: 1.402 *