English
Related papers

Related papers: Non-split toric BCH codes on singular del Pezzo su…

200 papers

Inspired by the recent progress by Coates-Corti-Kasprzyk et al. on Mirror Symmetry for del Pezzo surfaces, we show that for any positive integer k the deformation families of del Pezzo surfaces with a single 1/k(1,1) singularity (and no…

Algebraic Geometry · Mathematics 2017-07-31 Daniel Cavey , Thomas Prince

We define a linear code $C_\eta(\delta_T,\delta_X)$ by evaluating polynomials of bidegree $(\delta_T,\delta_X)$ in the Cox ring on $\mathbb{F}_q$-rational points of the Hirzebruch surface of parameter $\eta$ on the finite field…

Information Theory · Computer Science 2018-12-07 Jade Nardi

The Welschinger invariants of real rational algebraic surfaces are natural analogues of the Gromov-Witten invariants, and they estimate from below the number of real rational curves passing through prescribed configurations of points. We…

Algebraic Geometry · Mathematics 2007-05-23 E. Shustin

In this paper, the sufficient and necessary condition for the minimum distance of the BCH codes over $\mathbb{F}_q$ with length $q+1$ and designed distance 3 to be 3 and 4 are provided. Let $d$ be the minimum distance of the BCH code…

Information Theory · Computer Science 2023-12-20 Haojie Xu , Xia Wu , Wei Lu , Xiwang Cao

We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a $d$-regular tree…

Information Theory · Computer Science 2007-07-13 Christine Kelley , Deepak Sridhara , Joachim Rosenthal

A new approach to bound the minimum distance of $q$-ary cyclic codes is presented. The connection to the BCH and the Hartmann--Tzeng bound is formulated and it is shown that for several cases an improvement is achieved. We associate a…

Information Theory · Computer Science 2013-06-10 Alexander Zeh , Sergey Bezzateev

We prove that the first gap of $\mathbb R$-complementary thresholds of surfaces is $\frac{1}{13}$. More precisely, the largest $\mathbb R$-complementary threshold for surfaces that is strictly less than $1$ is $\frac{12}{13}$. This result…

Algebraic Geometry · Mathematics 2023-05-31 Jihao Liu , V. V. Shokurov

In this paper, we consider Griesmer codes, namely those linear codes meeting the Griesmer bound. Let $C$ be an $[n,k,d]_q$ Griesmer code with $q=p^f$, where $p$ is a prime and $f\ge1$ is an integer. In 1998, Ward proved that for $q=p$, if…

Combinatorics · Mathematics 2025-06-10 Haihua Deng , Hexiang Huang , Qing Xiang

We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…

Combinatorics · Mathematics 2011-04-29 Alexander Barg , Oleg R. Musin

We present a modified version of the Bravyi-Terhal bound that applies to quantum codes defined by local parity-check constraints on a $D$-dimensional lattice quotient. Specifically, we consider a quotient $\mathbb{Z}^D/\Lambda$ of…

Quantum Physics · Physics 2025-02-11 François Arnault , Philippe Gaborit , Wouter Rozendaal , Nicolas Saussay , Gilles Zémor

We prove that the Hilbert property is satisfied by certain del Pezzo surfaces of degree one and Picard rank 1 over fields finitely generated over $\mathbb{Q}$. We generalize results of the first author on elliptic surfaces and employ…

Algebraic Geometry · Mathematics 2025-12-18 Julian Demeio , Sam Streeter , Rosa Winter

There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…

Number Theory · Mathematics 2007-05-23 Nigel Boston

Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for…

Quantum Physics · Physics 2018-05-30 Tomas Jochym-O'Connor , Aleksander Kubica , Theodore J. Yoder

We give a classification of toric log del Pezzo surfaces with two or three singular points.

Algebraic Geometry · Mathematics 2019-10-02 Yusuke Suyama

We characterise integral points of bounded log-anticanonical height on a quartic del Pezzo surface of singularity type $\mathbf{A}_3$ over imaginary quadratic fields with respect to its singularity and its lines. Furthermore, we count these…

Number Theory · Mathematics 2023-07-25 Judith Ortmann

Let A(q,n,d) denote the maximum size of a q-ary code of length n and distance d. We study the minimum asymptotic redundancy \rho(q,n,d)=n-log_q A(q,n,d) as n grows while q and d are fixed. For any d and q<=d-1, long algebraic codes are…

Information Theory · Computer Science 2007-07-13 Sergey Yekhanin , Ilya Dumer

We study subfield-subcodes of Generalized Toric (GT) codes over $\mathbb{F}_{p^s}$. These are the multidimensional analogues of BCH codes, which may be seen as subfield-subcodes of generalized Reed-Solomon codes. We identify polynomial…

Information Theory · Computer Science 2024-05-01 Fernando Hernando , Michael E. O'Sullivan , Emanuel Popovici , Shraddha Srivastava

The surface code is one of the most successful approaches to topological quantum error-correction. It boasts the smallest known syndrome extraction circuits and correspondingly largest thresholds. Defect-based logical encodings of a new…

Quantum Physics · Physics 2017-04-26 Theodore J. Yoder , Isaac H. Kim

Let k be a perfect field. Recently J.-L. Colliot-Th\'el\`ene showed that two pointless quadric surfaces over k are birationally equivalent if and only if they are isomorphic. We show that this result holds for arbitrary del Pezzo surfaces…

Algebraic Geometry · Mathematics 2022-10-20 Andrey Trepalin

In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…

Information Theory · Computer Science 2015-06-26 Ivan Soprunov