DOIAbstract
AbstractThe relation between complete arcs in a finite projective space and maximum distance separable (MDS) codes is used to provide solutions for the Main Conjecture for MDS codes
AbstractThe relation between complete arcs in a finite projective space and maximum distance separable (MDS) codes is used to provide solutions for the Main Conjecture for MDS codes
The main object of the study of this thesis are arcs in PG(2,q2). An arc in PG(2,q2) is set of point...
In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs ass...
The non-existence of and -codes, , is proven. These results are obtained using geometrical methods, ...
AbstractThe relation between complete arcs in a finite projective space and maximum distance separab...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
Let C be a code of length k over an alphabet A of size q greather or equal 2. Having chosen m with 2...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
To each arc of PG(n, q) an algebraic hypersurface is associated. Using this tool new results on comp...
Complete (Formula presented.) -arcs in projective planes over finite fields are the geometric counte...
This is an expository article detailing results concerning large arcs in finite projective spaces. I...
We investigate the question when a cyclic code is maximum distance separable (MDS). For codes of (co...
Apart from being an interesting and exciting area in combinatorics with beautiful results, finite pr...
AbstractIn this paper we give a bound for MDS (maximum distance separable) algebraic-geometric codes...
The weights in maximum distance separable (MDS) codes of length n and dimension k over the finite fi...
Complete (n, r)-arcs in P G(k − 1, q) and projective (n, k, n − r)q-codes that admit no projective e...
The main object of the study of this thesis are arcs in PG(2,q2). An arc in PG(2,q2) is set of point...
In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs ass...
The non-existence of and -codes, , is proven. These results are obtained using geometrical methods, ...
AbstractThe relation between complete arcs in a finite projective space and maximum distance separab...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
Let C be a code of length k over an alphabet A of size q greather or equal 2. Having chosen m with 2...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
To each arc of PG(n, q) an algebraic hypersurface is associated. Using this tool new results on comp...
Complete (Formula presented.) -arcs in projective planes over finite fields are the geometric counte...
This is an expository article detailing results concerning large arcs in finite projective spaces. I...
We investigate the question when a cyclic code is maximum distance separable (MDS). For codes of (co...
Apart from being an interesting and exciting area in combinatorics with beautiful results, finite pr...
AbstractIn this paper we give a bound for MDS (maximum distance separable) algebraic-geometric codes...
The weights in maximum distance separable (MDS) codes of length n and dimension k over the finite fi...
Complete (n, r)-arcs in P G(k − 1, q) and projective (n, k, n − r)q-codes that admit no projective e...
The main object of the study of this thesis are arcs in PG(2,q2). An arc in PG(2,q2) is set of point...
In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs ass...
The non-existence of and -codes, , is proven. These results are obtained using geometrical methods, ...
Add to ORKG