English
Related papers

Related papers: On Galois self-orthogonal algebraic geometry codes

200 papers

It was shown by Massey that linear complementary dual (LCD for short) codes are asymptotically good. In 2004, Sendrier proved that LCD codes meet the asymptotic Gilbert-Varshamov (GV for short) bound. Until now, the GV bound still remains…

Information Theory · Computer Science 2017-03-07 Lingfei Jin , Chaoping Xing

There are two purposes in this article. One is to present a criterion for the existence of a birational embedding into a projective plane with inner and outer Galois points for algebraic curves. Another is to classify plane curves of degree…

Algebraic Geometry · Mathematics 2020-10-05 Satoru Fukasawa

Let $p$ be a prime such that $p \equiv 2$ or $3$ mod $5$. Linear block codes over the non-commutative matrix ring of $2 \times 2$ matrices over the prime field $GF(p)$ endowed with the Bachoc weight are derived as isometric images of linear…

Information Theory · Computer Science 2015-02-17 Bryan Hernandez , Virgilio Sison

We describe a new class of list decodable codes based on Galois extensions of function fields and present a list decoding algorithm. These codes are obtained as a result of folding the set of rational places of a function field using…

Information Theory · Computer Science 2009-01-12 Ming-Deh Huang , Anand Kumar Narayanan

This article deals with the Galois representation attached to elliptic curves with an isogeny of prime degree over a number field. We first determine uniform criteria for the irreducibility of Galois representations attached to elliptic…

Number Theory · Mathematics 2012-02-09 Agnès David

The classical Galois theory deals with certain finite algebraic extensions and establishes a bijective order reversing correspondence between the intermediate fields and the subgroups of a group of permutations called the Galois group of…

Differential Geometry · Mathematics 2017-10-24 Jean-François Pommaret

In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and…

Information Theory · Computer Science 2017-05-03 Xiusheng Liu , Yun Fan , Hualu Liu

It is well known that quantum codes can be constructed through classical symplectic self-orthogonal codes. In this paper, we give a kind of Gilbert-Varshamov bound for symplectic self-orthogonal codes first and then obtain the…

Information Theory · Computer Science 2013-08-19 Lingfei Jin , Chaoping Xing

This paper is concerned with the construction of algebraic geometric codes defined from GGS curves. It is of significant use to describe bases for the Riemann-Roch spaces associated with totally ramified places, which enables us to study…

Information Theory · Computer Science 2019-02-25 Chuangqiang Hu , Shudi Yang

In recent literature, matrix product (MP) codes and their duals have gained significant attention due to their application in the construction of quantum stabilizer codes. In this paper, we begin with providing a formula that characterizes…

Information Theory · Computer Science 2024-08-07 Ramy Farouk Taki Eldin

In this work, we propose two criteria for linear codes obtained from the Plotkin sum construction being symplectic self-orthogonal (SO) and linear complementary dual (LCD). As specific constructions, several classes of symplectic SO codes…

Information Theory · Computer Science 2023-11-01 Shixin Zhu , Yang Li , Shitao Li

Classifying the phases of gauge theories is hindered by the lack of local order parameters. In particular, the standard Wilson's and 't Hooft's non-local order parameters are known to be insufficient to explain the existence of the plethora…

High Energy Physics - Theory · Physics 2009-05-26 Frank Ferrari

We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined over finite fields. We give a general bound on their minimum distance and we investigate how this estimation can be sharpened under the…

Information Theory · Computer Science 2021-04-01 Yves Aubry , Elena Berardini , Fabien Herbaut , Marc Perret

The hull of linear codes plays an important role in quantum information and coding theory. In the present paper, by investigating the Galois hulls of generalized Reed-Solomon (GRS) codes and extended GRS codes over the finite field Fq, we…

Information Theory · Computer Science 2020-04-07 Meng Cao

The Gilbert--Varshamov (GV) bound is a central benchmark in coding theory, establishing existential guarantees for error-correcting codes and serving as a baseline for both Hamming and quantum fault-tolerant information processing. Despite…

Information Theory · Computer Science 2026-01-27 Chen Yuan , Ruiqi Zhu

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 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

In this paper we develop a differential Galois theory for algebraic Lie-Vessiot systems in algebraic homogeneous spaces. Lie-Vessiot systems are non autonomous vector fields that are linear combinations with time-dependent coefficients of…

Classical Analysis and ODEs · Mathematics 2009-01-29 David Blázquez-Sanz , Juan José Morales-Ruiz

Self-dual maximum distance separable (MDS) codes over finite fields are linear codes with significant combinatorial and cryptographic applications. Twisted generalized Reed-Solomon (TGRS) codes can be both MDS and self-dual. In this paper,…

Information Theory · Computer Science 2025-08-14 Chun'e Zhao , Yuxin Han , Wenping Ma , Tongjiang Yan , Yuhua Sun

In this paper, we first generalize the class of linear codes by Ding and Ding (IEEE TIT, 61(11), pp. 5835-5842, 2015). Then we mainly study the augmented codes of this generalized class of linear codes. For one thing, we use Gaussian sums…

Information Theory · Computer Science 2024-04-30 Ziling Heng , Keqing Cao