Projective toric codes over hypersimplices

07/30/2019
by   Delio Jaramillo, et al.
0

Let d≥ 1 be an integer, and let P be the convex hull in R^s of all integral points e_i_1+...+e_i_d such that 1≤ i_1<...< i_d≤ s, where e_i is the i-th unit vector in R^s. Given a finite field F_q, we determine the minimum distance of the projective toric code C_P(d) associated to the hypersimplex P using the projective footprint function of a graded ideal.

READ FULL TEXT
research
07/30/2019

A note on projective toric codes

Let d≥ 1 be an integer, and let P be the convex hull in R^s of all integ...
research
06/27/2018

Weight distributions of all irreducible μ-constacyclic codes of length ℓ^n

Let F_q be a finite field of order q and integer n> 1. Let ℓ be a prime ...
research
01/04/2022

Dynamics of polynomial maps over finite fields

Let 𝔽_q be a finite field with q elements and let n be a positive intege...
research
03/11/2023

Characterizations of the set of integer points in an integral bisubmodular polyhedron

In this note, we provide two characterizations of the set of integer poi...
research
09/27/2022

An O(3.82^k) Time FPT Algorithm for Convex Flip Distance

Let P be a convex polygon in the plane, and let T be a triangulation of ...
research
11/12/2020

Implicit bias of any algorithm: bounding bias via margin

Consider n points x_1,…,x_n in finite-dimensional euclidean space, each ...
research
05/09/2020

On the Grassmann Graph of Linear Codes

Let Γ(n,k) be the Grassmann graph formed by the k-dimensional subspaces ...

Please sign up or login with your details

Forgot password? Click here to reset