English
Related papers

Related papers: Improvement on Parameters of Algebraic-Geometry Co…

200 papers

The determination of the maximal length of maximum distance separable (MDS) codes arising from elliptic curves is a central problem in coding theory. For an elliptic curve $E$ over $\mathbb{F}_q$, let $\operatorname{MEC}(k,q)$ denote the…

Information Theory · Computer Science 2026-05-29 Haojie Chen , Chuangqiang Hu , Junjie Huang , Chang-An Zhao

We construct quantum MDS codes with parameters $ [\![ q^2+1,q^2+3-2d,d ]\!] _q$ for all $d \leqslant q+1$, $d \neq q$. These codes are shown to exist by proving that there are classical generalised Reed-Solomon codes which contain their…

Quantum Physics · Physics 2021-01-15 Simeon Ball

A simultaneous arithmetic progression (s.a.p.) of length k consists of k points (x_i, y_\sigma(i)), where x_i and y_i are arithmetic progressions and \sigma is a permutation. Garcia-Selfa and Tornero asked whether there is a bound on the…

Number Theory · Mathematics 2014-04-22 Ryan Schwartz , József Solymosi , Frank de Zeeuw

For any positive integer $q\geq 2$ and any real number $\delta\in(0,1)$, let $\alpha_q(n,\delta n)$ denote the maximum size of a subset of $\mathbb{Z}_q^n$ with minimum Hamming distance at least $\delta n$, where…

Combinatorics · Mathematics 2024-03-22 Xue-Bin Liang

We show that any ternary Euclidean (resp.\ quaternary Hermitian) linear complementary dual $[n,k]$ code contains a Euclidean (resp.\ Hermitian) linear complementary dual $[n,k-1]$ subcode for $2 \le k \le n$. As a consequence, we derive a…

Information Theory · Computer Science 2020-11-20 Masaaki Harada , Ken Saito

A kind of self-dual quasi-abelian codes of index $2$ over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes of this kind whose relative minimum weights are small, such codes are proved to…

Information Theory · Computer Science 2021-08-18 Liren Lin , Yun Fan

This paper is concerned with some Algebraic Geometry codes on Jacobians of genus 2 curves. We derive a lower bound for the minimum distance of these codes from an upper "Weil type" bound for the number of rational points on irreducible…

Information Theory · Computer Science 2015-03-30 Safia Haloui

We introduce graphical error-correcting codes, a new notion of error-correcting codes on $[q]^n$, where a code is a set of proper $q$-colorings of some fixed $n$-vertex graph $G$. We then say that a set of $M$ proper $q$-colorings of $G$…

Combinatorics · Mathematics 2025-01-28 Honglin Zhu

The Gilbert-Varshamov bound states that the maximum size A_2(n,d) of a binary code of length n and minimum distance d satisfies A_2(n,d) >= 2^n/V(n,d-1) where V(n,d) stands for the volume of a Hamming ball of radius d. Recently Jiang and…

Information Theory · Computer Science 2008-09-26 Philippe Gaborit , Gilles Zemor

We show the existence of group-theoretic sections of certain geometrically pro-nilpotent by abelian arithmetic fundamental groups of hyperbolic curves over p-adic local fields which are non-geometric, i.e., which do not arise from rational…

Number Theory · Mathematics 2021-10-01 Mohamed Saidi

We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised C_{ab} curves the new bound often improves dramatically on the Feng-Rao bound for primary codes. The method…

Information Theory · Computer Science 2013-07-25 Olav Geil , Stefano Martin

One of the main objectives of quantum error-correction theory is to construct quantum codes with optimal parameters and properties. In this paper, we propose a class of 2-generator quasi-cyclic codes and study their applications in the…

Information Theory · Computer Science 2022-10-18 Chaofeng Guan , Ruihu Li , Liangdong Lu , Yang Liu , Hao Song

Explicit non-asymptotic upper bounds on the sizes of multiple-deletion correcting codes are presented. In particular, the largest single-deletion correcting code for $q$-ary alphabet and string length $n$ is shown to be of size at most…

Information Theory · Computer Science 2012-11-15 Ankur A. Kulkarni , Negar Kiyavash

In this paper, we study algebraic geometry codes from curves over $\mathbb{F}_{q^\ell}$ through their virtual projections which are algebraic geometric codes over $\mathbb{F}_q$. We use the virtual projections to provide fractional decoding…

Information Theory · Computer Science 2024-04-11 Eduardo Camps-Moreno , Gretchen L. Matthews , Welington Santos

We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming…

Quantum Physics · Physics 2008-11-26 H. Bombin , M. A. Martin-Delgado

We prove that a curve of degree $dk$ on a very general surface of degree $d \geq 5$ in $\mathbb{P}^3$ has geometric genus at least $\frac{dk(d-5)+k}{2} + 1$. This improves bounds given by G. Xu. As a corollary, we conclude that the very…

Algebraic Geometry · Mathematics 2018-04-12 Izzet Coskun , Eric Riedl

We study the interaction between the group law on an elliptic curve and the additive structure of $x$-coordinates of rational points on an elliptic curve. Let $E/\mathbb{Q}$ be an elliptic curve of Mordell-Weil rank $r \geq 1$, $d \geq 1$…

Number Theory · Mathematics 2026-05-21 Seokhyun Choi

Using 4-dimensional arithmetic hyperbolic manifolds, we construct some new homological quantum error correcting codes. They are LDPC codes with linear rate and distance $n^\epsilon$. Their rate is evaluated via Euler characteristic…

Differential Geometry · Mathematics 2015-06-17 Larry Guth , Alexander Lubotzky

Let X be a projective geometrically irreducible non-singular algebraic curve defined over a finite field F of order $q^2$. If the number of F-rational points of X satisfies the Hasse-Weil upper bound, then X is said to be F-maximal. For a…

Algebraic Geometry · Mathematics 2007-05-23 Gabor Korchmaros , Fernando Torres

In this article, first we present a method for constructing many Hermitian LCD codes from a given Hermitian LCD code, and then provide several methods which utilize either a given [n, k, d] linear code or a given [n, k, d] Galois LCD code…

Information Theory · Computer Science 2023-10-09 Gyanendra K. Verma , Astha Agrawal , R. K. Sharma
‹ Prev 1 4 5 6 7 8 10 Next ›