Next-to-minimal weight of toric codes defined over hypersimplices
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912229288312832 |
|---|---|
| author | Carvalho, Cícero Patanker, Nupur |
| author_facet | Carvalho, Cícero Patanker, Nupur |
| contents | Toric codes are a type of evaluation codes introduced by J.P. Hansen in 2000. They are produced by evaluating (a vector space composed by) polynomials at the points of $(\mathbb{F}_q^*)^s$, the monomials of these polynomials being related to a certain polytope. Toric codes related to hypersimplices are the result of the evaluation of a vector space of square-free homogeneous polynomials of degree $d$. The dimension and minimum distance of toric codes related to hypersimplices have been determined by Jaramillo et al. in 2021. The next-to-minimal weight in the case $d = 1$ has been determined by Jaramillo-Velez et al. in 2023. In this work we use tools from Gröbner basis theory to determine the next-to-minimal weight of these codes for $d$ such that $3 \leq d \leq \frac{s - 2}{2}$ or $\frac{s + 2}{2} \leq d < s$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_07718 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Next-to-minimal weight of toric codes defined over hypersimplices Carvalho, Cícero Patanker, Nupur Information Theory Commutative Algebra Algebraic Geometry 94B05, 11T71, 14G50 Toric codes are a type of evaluation codes introduced by J.P. Hansen in 2000. They are produced by evaluating (a vector space composed by) polynomials at the points of $(\mathbb{F}_q^*)^s$, the monomials of these polynomials being related to a certain polytope. Toric codes related to hypersimplices are the result of the evaluation of a vector space of square-free homogeneous polynomials of degree $d$. The dimension and minimum distance of toric codes related to hypersimplices have been determined by Jaramillo et al. in 2021. The next-to-minimal weight in the case $d = 1$ has been determined by Jaramillo-Velez et al. in 2023. In this work we use tools from Gröbner basis theory to determine the next-to-minimal weight of these codes for $d$ such that $3 \leq d \leq \frac{s - 2}{2}$ or $\frac{s + 2}{2} \leq d < s$. |
| title | Next-to-minimal weight of toric codes defined over hypersimplices |
| topic | Information Theory Commutative Algebra Algebraic Geometry 94B05, 11T71, 14G50 |
| url | https://arxiv.org/abs/2502.07718 |