English
Related papers

Related papers: Good iso-dual AG-codes from towers of function fie…

200 papers

We construct an explicit asymptotically good tower of curves over the field with eight elements. Its limit is 3/2.

Algebraic Geometry · Mathematics 2007-05-23 Gerard van der Geer , Marcel van der Vlugt

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

The explicit construction of function fields tower with many rational points relative to the genus in the tower play a key role for the construction of asymptotically good algebraic-geometric codes. In 1997 Garcia, Stichtenoth and Thomas…

Number Theory · Mathematics 2007-09-21 Siman Yang

We study the asymptotic behavior of a family of algebraic geometry codes which are 4-quasi transitive linear codes. We prove that this family is asymptotically good over many prime fields using towers of algebraic function fields.

Number Theory · Mathematics 2019-12-06 María Chara , Ricardo Toledano , Ricardo Podestá

Bazzi and Mitter [3] showed that binary dihedral group codes are asymptotically good. In this paper we prove that the dihedral group codes over any finite field with good mathematical properties are asymptotically good. If the…

Information Theory · Computer Science 2021-07-05 Yun Fan , Liren Lin

In this work we construct sequences of locally recoverable AG codes arising from a tower of function fields and give bound for the parameters of the obtained codes. In a particular case of a tower over $\mathbb{F}_{q^2}$ for any odd $q$,…

Information Theory · Computer Science 2022-09-16 M. Chara , F. Galluccio , E. Martínez-Moro

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

We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…

Algebraic Geometry · Mathematics 2020-06-09 Alain Couvreur , Philippe Lebacque , Marc Perret

This paper concerns towers of curves over a finite field with many rational points, following Garcia--Stichtenoth and Elkies. We present a new method to produce such towers. A key ingredient is the study of algebraic solutions to Fuchsian…

Number Theory · Mathematics 2007-05-23 Peter Beelen , Irene I. Bouw

Group codes are right or left ideals in a group algebra of a finite group over a finite field. Following ideas of Bazzi and Mitter on group codes over the binary field, we prove that group codes over finite fields of any characteristic are…

Information Theory · Computer Science 2020-01-22 Martino Borello , Wolfgang Willems

If C is a binary linear code, let C^2 be the linear code spanned by intersections of pairs of codewords of C. We construct an asymptotically good family of binary linear codes such that, for C ranging in this family, the C^2 also form an…

Information Theory · Computer Science 2012-09-03 Hugues Randriambololona

We reduce the problem of constructing asymptotically good tree codes to the construction of triangular totally nonsingular matrices over fields with polynomially many elements. We show a connection of this problem to Birkhoff interpolation…

Information Theory · Computer Science 2015-08-28 Pavel Pudlák

In this paper we construct Galois towers with good asymptotic properties over any non-prime finite field $\mathbb F_{\ell}$; i.e., we construct sequences of function fields $\mathcal{N}=(N_1 \subset N_2 \subset \cdots)$ over $\mathbb…

Algebraic Geometry · Mathematics 2013-11-08 Alp Bassa , Peter Beelen , Arnaldo Garcia , Henning Stichtenoth

In this work, we give sufficient conditions in order to have finite ramification locus in sequences of function fields defined by different kind of Kummer extensions. These conditions can be easily implemented in a computer to generate…

Number Theory · Mathematics 2014-12-01 Maria Chara , Ricardo Toledano

In the realm of algebraic geometric (AG) codes, characterizing dual codes has long been a challenging task. In this paper we introduces a generalized criterion to characterize self-orthogonality of AG codes based on residues, drawing upon…

Information Theory · Computer Science 2025-06-03 Puyin Wang , Jinquan Luo

Double Toeplitz (shortly DT) codes are introduced here as a generalization of double circulant codes. We show that such a code is isodual, hence formally self-dual. Self-dual DT codes are characterized as double circulant or double…

Information Theory · Computer Science 2021-02-19 Minjia Shi , Li Xu , Patrick Solé

In this paper we study general conditions to prove the infiniteness of the genus of certain towers of function fields over a perfect field. We show that many known examples of towers with infinite genus are particular cases of these…

Number Theory · Mathematics 2016-03-11 M. Chara , R Toledano

In this paper we construct several new families of quantum codes with good and asymptotically good parameters. These new quantum codes are derived from (classical) algebraic geometry (AG) codes by applying the Calderbank-Shor-Steane (CSS)…

Quantum Physics · Physics 2017-05-09 Giuliano Gadioli La Guardia , Francisco Revson F. Pereira

We study a tower of function fields of Artin-Schreier type over a finite field with $2^s$ elements. The study of the asymptotic behavior of this tower was left as an open problem by Beelen, Garc\'ia and Stichtenoth in $2006$. We prove that…

Number Theory · Mathematics 2016-11-23 M. Chara , H. Navarro , R. Toledano

It is proved in a reference (Fan, Lin, IEEE TIT, vol.67, pp.5016-5025) that the self-dual (LCD respectively) dihedral codes over a finite field~$F$ with ${|F|=q}$ are asymptotically good if $q$ is even (odd respectively). In this paper, we…

Information Theory · Computer Science 2023-03-02 Yun Fan , Yue Leng
‹ Prev 1 2 3 10 Next ›