The minimum distance of a parameterized code over an even cycle (Q6987090)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8037057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum distance of a parameterized code over an even cycle |
scientific article; zbMATH DE number 8037057 |
Statements
The minimum distance of a parameterized code over an even cycle (English)
0 references
7 May 2025
0 references
The article under review studies the minimum distance of parameterized codes of order 1 over an even cycle. Parameterized codes are evaluation codes obtained by evaluating the homogeneous polynomials of a fixed degree \(d\) at a projective toric subset parameterized by a set of Laurent monomials. One particular case is given by the projective toric subset parameterized by the monomials corresponding to the edges of a graph. The authors compute the minimum distance of these codes for the case of even cycles and \(d=1\).
0 references
minimum distance
0 references
parameterized linear codes
0 references
0 references
