English
Related papers

Related papers: AG codes and AG quantum codes from the GGS curve

200 papers

The second Feng-Rao number of every inductive numerical semigroup is explicitly computed. This number determines the asymptotical behaviour of the order bound for the second Hamming weight of one-point AG codes. In particular, this result…

Information Theory · Computer Science 2015-05-07 J. I. Farrán , P. A. García-Sánchez

In this article we explicitly determine the structure of the Weierstrass semigroups $H(P)$ for any point $P$ of the Giulietti-Korchm\'aros curve $\mathcal{X}$. We show that as the point varies, exactly three possibilities arise: One for the…

Algebraic Geometry · Mathematics 2017-08-24 Peter Beelen , Maria Montanucci

Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…

Information Theory · Computer Science 2022-07-14 Ted Hurley

Split group codes are a class of group algebra codes over an abelian group. They were introduced in 2000 by Ding, Kohel and Ling as a generalization of the cyclic duadic codes. For a prime power q and an abelian group G of order n such that…

Rings and Algebras · Mathematics 2007-05-23 Lilibeth Dicuangco , Pieter Moree , Patrick Sole

We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. Generalized…

Information Theory · Computer Science 2024-10-25 Beatriz Barbero-Lucas , Fernando Hernando , Helena Martín-Cruz , Gary McGuire

New families of maximum distance separable (MDS) codes are constructed from elliptic curves by exploiting their group structures. In contrast to classical constructions based on divisors supported at a single rational point, the proposed…

Information Theory · Computer Science 2025-10-28 Puyin Wang , Wei Liu , Jinquan Luo , Dengxin Zhai

In this paper we study evaluation codes arising from plane quotients of the Hermitian curve, defined by affine equations of the form $y^q+y=x^m$, $q$ being a prime power and $m$ a positive integer which divides $q+1$. The dual minimum…

Algebraic Geometry · Mathematics 2013-09-04 Edoardo Ballico , Alberto Ravagnani

Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. However, these codes…

Combinatorics · Mathematics 2012-07-24 Lars Eirik Danielsen

AG codes correspond geometrically to points in the Grassmannian of k-planes in an n-dimensional projective space PG(n, F_q) defined over a finite field F_q of q elements. We prove that invariant subgrassmannians by the action of a triangle…

Combinatorics · Mathematics 2017-06-20 Alberto Besana , Cristina Martínez-Ramírez

Given a hypergraph $\mathcal{H}$, we introduce a new class of evaluation toric codes called edge codes derived from $\mathcal{H}$. We analyze these codes, focusing on determining their basic parameters. We provide estimations for the…

Commutative Algebra · Mathematics 2024-04-04 Delio Jaramillo-Velez

We give a construction of singular curves with many rational points over finite fields. This construction enables us to prove some results on the maximum number of rational points on an absolutely irreducible projective algebraic curve…

Algebraic Geometry · Mathematics 2015-10-05 Yves Aubry , Annamaria Iezzi

Flag codes are multishot network codes consisting of sequences of nested subspaces (flags) of a vector space $\mathbb{F}_q^n$, where $q$ is a prime power and $\mathbb{F}_q$, the finite field of size $q$. In this paper we study the…

Information Theory · Computer Science 2020-11-06 Clementa Alonso-González , Miguel Ángel Navarro-Pérez , Xaro Soler-Escrivà

We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum…

Information Theory · Computer Science 2010-06-22 Peter Beelen , Sudhir R. Ghorpade , Tom Hoeholdt

A geometrically local quantum code is an error correcting code situated within $\mathbb{R}^D$, where the checks only act on qubits within a fixed spatial distance. The main question is: What is the optimal dimension and distance for a…

Quantum Physics · Physics 2024-07-04 Ting-Chun Lin , Adam Wills , Min-Hsiu Hsieh

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, a class of $q$-ary linear codes with few weights are presented and their weight distributions are determined using Gauss periods. Some of…

Information Theory · Computer Science 2018-11-26 Gaopeng Jian

We introduce a $W^*$-metric space, which is a particular approach to non-commutative metric spaces where a \textit{quantum metric} is defined on a von Neumann algebra. We generalize the notion of a quantum code and quantum error correction…

Quantum Physics · Physics 2012-05-22 Christopher Bumgardner

In this work we investigate the problem of producing iso-dual algebraic geometry (AG) codes over a finite field $\mathbb{F}_q$ with $q$ elements. Given a finite separable extension $\mathcal{M}/\mathcal{F}$ of function fields and an…

Information Theory · Computer Science 2026-04-16 María Chara , Ricardo Podestá , Luciane Quoos , Ricardo Toledano

Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters…

Information Theory · Computer Science 2018-07-17 Weijun Fang , Fang-Wei Fu

Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that…

Information Theory · Computer Science 2008-06-02 Eric Z. Chen

We contruct a one-to-one correspondence between a subset of numerical semigroups with genus $g$ and $\gamma$ even gaps and the integer points of a rational polytope. In particular, we give an overview to apply this correspondence to try to…

Combinatorics · Mathematics 2020-06-30 Matheus Bernardini