AbstractIn this paper we construct some algebraic geometric error-correcting codes on surfaces whose Néron–Severi group has low rank. If the Néron–Severi group is generated by an effective divisor, the intersection of this surface with an irreducible surface of lower degree will be an irreducible curve, and this makes possible the construction of codes with good parameters. Such surfaces are not easy to find, but we are able to find surfaces with low rank, and those will give us good codes too
A linear error correcting code is a subspace of a finite-dimensional space over a finite field with ...
For a given algebraic variety $V$ defined over a finite field and a very ample divisor $D$ on $V$, w...
We examine classes of binary linear error correcting codes constructed from certain sets of lines de...
AbstractIn this paper we construct some algebraic geometric error-correcting codes on surfaces whose...
Error correcting codes are defined and important parameters for a code are explained. Parameters of ...
AbstractIn the present article, we consider Algebraic Geometry codes on some rational surfaces. The ...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
International audienceIn the present article, we consider Algebraic Geometry codes on some rational ...
AbstractAlgebraic geometric codes (or AG codes) provide a way to correct errors that occur during th...
We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined...
International audienceWe prove lower bounds for the minimum distance of algebraic geometry codes ove...
International audienceWe construct algebraic geometric codes from del Pezzo surfaces and focus on th...
We introduce two types of curves of interest for coding theory purposes: the so-called Castle and we...
International audienceWe provide a theoretical study of Algebraic Geometry codes constructed from ab...
The theory of algebraic-geometric codes has been developed in the beginning of the 80's after an art...
A linear error correcting code is a subspace of a finite-dimensional space over a finite field with ...
For a given algebraic variety $V$ defined over a finite field and a very ample divisor $D$ on $V$, w...
We examine classes of binary linear error correcting codes constructed from certain sets of lines de...
AbstractIn this paper we construct some algebraic geometric error-correcting codes on surfaces whose...
Error correcting codes are defined and important parameters for a code are explained. Parameters of ...
AbstractIn the present article, we consider Algebraic Geometry codes on some rational surfaces. The ...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
International audienceIn the present article, we consider Algebraic Geometry codes on some rational ...
AbstractAlgebraic geometric codes (or AG codes) provide a way to correct errors that occur during th...
We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined...
International audienceWe prove lower bounds for the minimum distance of algebraic geometry codes ove...
International audienceWe construct algebraic geometric codes from del Pezzo surfaces and focus on th...
We introduce two types of curves of interest for coding theory purposes: the so-called Castle and we...
International audienceWe provide a theoretical study of Algebraic Geometry codes constructed from ab...
The theory of algebraic-geometric codes has been developed in the beginning of the 80's after an art...
A linear error correcting code is a subspace of a finite-dimensional space over a finite field with ...
For a given algebraic variety $V$ defined over a finite field and a very ample divisor $D$ on $V$, w...
We examine classes of binary linear error correcting codes constructed from certain sets of lines de...