MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix. In this paper, elementary methods for modifying a PG-MDS code of dimensions 2, 3, as extending and lengthening, in order to find new incomplete PG-MDS codes have been used over . Also, two complete PG-MDS codes over of length and 28 have been found
The GM-MDS theorem, conjectured by Dau-Song-Dong-Yuen and proved by Lovett and Yildiz-Hassibi, shows...
To each arc of PG(n, q) an algebraic hypersurface is associated. Using this tool new results on comp...
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...
A k x n matrix is an MDS matrix if any k columns are linearly independent. Such matrices span MDS (M...
In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length ...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length $...
Apart from being an interesting and exciting area in combinatorics with beautiful results, finite pr...
Abstract. A linear code over a finite field is called Hermitian self-dual if the code is self-dual u...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
It is well known that a linear code over a finite field with the systematic generator matrix [I/P] i...
A linear code over a finite field is called Hermitian self-dual if the code is self-dual under the H...
In this work, we consider some methods to generate secret-sharing schemes from MDS and near-MDS code...
In this paper, we present a method to construct new MDS codes by extending Gabidulin codes. This met...
The GM-MDS theorem, conjectured by Dau-Song-Dong-Yuen and proved by Lovett and Yildiz-Hassibi, shows...
To each arc of PG(n, q) an algebraic hypersurface is associated. Using this tool new results on comp...
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...
A k x n matrix is an MDS matrix if any k columns are linearly independent. Such matrices span MDS (M...
In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length ...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length $...
Apart from being an interesting and exciting area in combinatorics with beautiful results, finite pr...
Abstract. A linear code over a finite field is called Hermitian self-dual if the code is self-dual u...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
It is well known that a linear code over a finite field with the systematic generator matrix [I/P] i...
A linear code over a finite field is called Hermitian self-dual if the code is self-dual under the H...
In this work, we consider some methods to generate secret-sharing schemes from MDS and near-MDS code...
In this paper, we present a method to construct new MDS codes by extending Gabidulin codes. This met...
The GM-MDS theorem, conjectured by Dau-Song-Dong-Yuen and proved by Lovett and Yildiz-Hassibi, shows...
To each arc of PG(n, q) an algebraic hypersurface is associated. Using this tool new results on comp...
AbstractThe relation between complete arcs in a finite projective space and maximum distance separab...