English
Related papers

Related papers: Toric complete intersection codes

200 papers

This article revisits previous results presented in Optimization which were challenged later by Voisei and Zalinescu (V-Z) in the same journal. We aim to use the points of view of V-Z to modify the original results and highlight that the…

Optimization and Control · Mathematics 2012-10-08 Daniel Morales-Silva , David Gao

A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann--Tzeng (HT) bound is formulated…

Information Theory · Computer Science 2012-09-03 Alexander Zeh , Sergey Bezzateev

In this paper, we study a class of linear codes defined by characteristic functions of certain subsets of a finite field. We derive a sufficient and necessary condition for such a code to be a minimal linear code by a character-theoretical…

Combinatorics · Mathematics 2021-02-23 Ran Tao , Tao Feng , Weicong Li

Euler-symmetric projective varieties, introduced by Baohua Fu and Jun-Muk Hwang in 2020, are nondegenerate projective varieties admitting many $\mathbb{C}^{\times}$-actions of Euler type. They are quasi-homogeneous and uniquely determined…

Algebraic Geometry · Mathematics 2023-11-30 Zhijun Luo

We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives…

Commutative Algebra · Mathematics 2018-10-19 Jose Martinez-Bernal , Yuriko Pitones , Rafael H. Villarreal

Sixteen new linear codes are presented: three of them improve the lower bounds on the minimum distance for a linear code and the rest are an explicit construction of unknown codes attaining the lower bounds on the minimum distance. They are…

Information Theory · Computer Science 2008-04-23 Fernando Hernando , Diego Ruano

A flag is a sequence of nested subspaces of a given ambient space F_q^n over a finite field F_q. In network coding, a flag code is a set of flags, all of them with the same sequence of dimensions, the type vector. In this paper, we…

Information Theory · Computer Science 2024-07-30 Clementa Alonso-González , Miguel Ángel Navarro-Pérez

A new family of error-correcting codes, called Fourier codes, is introduced. The code parity-check matrix, dimension and an upper bound on its minimum distance are obtained from the eigenstructure of the Fourier number theoretic transform.…

Information Theory · Computer Science 2015-03-12 R. M. Campello de Souza , E. S. V. Freire , H. M. de Oliveira

This article will appear in the proceedings of the AMS Summer Institute in Algebraic Geometry at Santa Cruz, July 1995. The topic is toric ideals, by which I mean the defining ideals of subvarieties of affine or projective space which are…

alg-geom · Mathematics 2008-02-03 Bernd Sturmfels

In this paper we describe all possible reduced complete intersection sets of points on Veronese surfaces. We formulate a conjecture for the general case of complete intersection subvarieties of any dimension and we prove it in the case of…

Algebraic Geometry · Mathematics 2022-07-08 Stefano Canino , Enrico Carlini

Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique…

Information Theory · Computer Science 2013-06-28 Alexander Zeh , Antonia Wachter-Zeh , Maximilien Gadouleau , Sergey Bezzateev

Associated to any graph is a toric ideal whose generators record relations among the cuts of the graph. We study these ideals and the geometry of the corresponding toric varieties. Our theorems and conjectures relate the combinatorial…

Commutative Algebra · Mathematics 2007-05-23 Bernd Sturmfels , Seth Sullivant

We introduce the first example of algebraically constructed hierarchical quasi-cyclic codes. These codes are built from Reed-Solomon codes using a 1964 construction of superimposed codes by Kautz and Singleton. We show both the number of…

Information Theory · Computer Science 2026-01-01 Emily McMillon , Kathryn Haymaker

Working over a field of characteristic zero, we give structure theorems for all grade three licci ideals and their minimal free resolutions. In particular, we completely classify such ideals up to deformation. The descriptions of their…

Commutative Algebra · Mathematics 2024-12-03 Lorenzo Guerrieri , Xianglong Ni , Jerzy Weyman

We establish asymptotic formulas for the number of integral points of bounded height on toric varieties.

Number Theory · Mathematics 2012-02-23 Antoine Chambert-Loir , Yuri Tschinkel

Two tantalizing invariants of a combinatorial code $\mathcal C\subseteq 2^{[n]}$ are cdim$(\mathcal C)$ and odim$(\mathcal C)$, the smallest dimension in which $\mathcal C$ can be realized by convex closed or open sets, respectively. Cruz,…

Combinatorics · Mathematics 2022-07-19 R. Amzi Jeffs

In this paper, we study complete simplicial toric varieties admitting faithful actions of large symmetric groups. First, we correct a recent classification result by Esser, Ji, and Moraga concerning $4$-dimensional toric varieties with…

Algebraic Geometry · Mathematics 2026-04-28 Yutaro Naito

Global F-theory compactifications whose fibers are realized as complete intersections form a richer set of models than just hypersurfaces. The detailed study of the physics associated with such geometries depends crucially on being able to…

High Energy Physics - Theory · Physics 2015-01-29 Volker Braun , Thomas W. Grimm , Jan Keitel

We compute the successive minima of the projective toric variety $X_\cA$ associated to a finite set $ \cA \subset \Z^n$. As a consequence of this computation and of the results of S.-W. Zhang on the distribution of small points, we derive…

Number Theory · Mathematics 2016-09-07 Martin Sombra

We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…

Information Theory · Computer Science 2019-10-17 Peter Boyvalenkov , Peter Dragnev , Douglas Hardin , Edward Saff , Maya Stoyanova
‹ Prev 1 8 9 10 Next ›