AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersection or a vector bundle on a projective variety) we prove the existence of an extension Fqe (no explicit lower bound for e) such that the associated code over Fqe has a strong uniformity property (all submatrices of a certain type have the same rank)
We construct some optimal linear codes over Fq through projective geometry, using the geometric meth...
ABSTRACT. The discovery of algebraic geometric codes constructed on curves led to generalising this ...
It was shown by Massey that linear complementary dual (LCD) codes are asymptotically good. In 2004, ...
AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersectio...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
Abstract. For an [n, k, d]q code C, we define a mapping wC from PG(k − 1, q) to the set of weights o...
AbstractWe give an optimal lower bound in terms of large cardinal axioms for the logical strength of...
In this paper we present a generalization of the perfect codes derived from the quotient rings of Ga...
In classical coding theory, different types of extendability results of codes are known. Aclassical ...
The aim of this thesis is to highlight once again how Geometry, and in particular Combinatorics, is ...
We show that many Goppa codes from algebraic geometry are optimal. Many of these codes attain the Gr...
In this paper we generalize the concept of geometrically uniform codes, formerly employed in Euclide...
We obtain several classes of completely regular codes with different parameters, but identical inter...
We obtain several classes of completely regular codes with different parameters, but identical inter...
Resumo: Neste trabalho apresentamos a construção de códigos geometricamente uniformes derivados de g...
We construct some optimal linear codes over Fq through projective geometry, using the geometric meth...
ABSTRACT. The discovery of algebraic geometric codes constructed on curves led to generalising this ...
It was shown by Massey that linear complementary dual (LCD) codes are asymptotically good. In 2004, ...
AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersectio...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
Abstract. For an [n, k, d]q code C, we define a mapping wC from PG(k − 1, q) to the set of weights o...
AbstractWe give an optimal lower bound in terms of large cardinal axioms for the logical strength of...
In this paper we present a generalization of the perfect codes derived from the quotient rings of Ga...
In classical coding theory, different types of extendability results of codes are known. Aclassical ...
The aim of this thesis is to highlight once again how Geometry, and in particular Combinatorics, is ...
We show that many Goppa codes from algebraic geometry are optimal. Many of these codes attain the Gr...
In this paper we generalize the concept of geometrically uniform codes, formerly employed in Euclide...
We obtain several classes of completely regular codes with different parameters, but identical inter...
We obtain several classes of completely regular codes with different parameters, but identical inter...
Resumo: Neste trabalho apresentamos a construção de códigos geometricamente uniformes derivados de g...
We construct some optimal linear codes over Fq through projective geometry, using the geometric meth...
ABSTRACT. The discovery of algebraic geometric codes constructed on curves led to generalising this ...
It was shown by Massey that linear complementary dual (LCD) codes are asymptotically good. In 2004, ...
DOI
Add to ORKG