Add to ORKGIn this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length $N\leq q+1$ (for $q$ odd) or $N\leq q+2$ (for $q$ even), using a set of non--degenerate Hermitian forms in $PG(2,q^2)$
For a linear maximum distance separable (MDS) code with redundancy r, the covering radius is either ...
AbstractWe obtain some effective lower and upper bounds for the number of (n,k)-MDS linear codes ove...
AbstractA subset S of {0,1,…,2t-1}n is called a t-fold MDS code if every line in each of n base dire...
In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length ...
MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS)...
The hull of a linear code is the intersection of itself with its dual code with respect to certain i...
AbstractMaximum distance separable (MDS) codes have special properties that give them excellent erro...
In this work, we consider some methods to generate secret-sharing schemes from MDS and near-MDS code...
A linear code over a finite field is called Hermitian self-dual if the code is self-dual under the H...
Abstract. A linear code over a finite field is called Hermitian self-dual if the code is self-dual u...
AbstractThe first author constructed new extremal binary self-dual codes (IEEE Trans. Inform. Theory...
We obtain some effective lower and upper bounds for the number of (n, k)-MDS linear codes over F-q. ...
AbstractWe consider the problem of finding the maximum possible length m′(k,q) of a near-MDS code of...
A k x n matrix is an MDS matrix if any k columns are linearly independent. Such matrices span MDS (M...
We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes...
For a linear maximum distance separable (MDS) code with redundancy r, the covering radius is either ...
AbstractWe obtain some effective lower and upper bounds for the number of (n,k)-MDS linear codes ove...
AbstractA subset S of {0,1,…,2t-1}n is called a t-fold MDS code if every line in each of n base dire...
In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length ...
MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS)...
The hull of a linear code is the intersection of itself with its dual code with respect to certain i...
AbstractMaximum distance separable (MDS) codes have special properties that give them excellent erro...
In this work, we consider some methods to generate secret-sharing schemes from MDS and near-MDS code...
A linear code over a finite field is called Hermitian self-dual if the code is self-dual under the H...
Abstract. A linear code over a finite field is called Hermitian self-dual if the code is self-dual u...
AbstractThe first author constructed new extremal binary self-dual codes (IEEE Trans. Inform. Theory...
We obtain some effective lower and upper bounds for the number of (n, k)-MDS linear codes over F-q. ...
AbstractWe consider the problem of finding the maximum possible length m′(k,q) of a near-MDS code of...
A k x n matrix is an MDS matrix if any k columns are linearly independent. Such matrices span MDS (M...
We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes...
For a linear maximum distance separable (MDS) code with redundancy r, the covering radius is either ...
AbstractWe obtain some effective lower and upper bounds for the number of (n,k)-MDS linear codes ove...
AbstractA subset S of {0,1,…,2t-1}n is called a t-fold MDS code if every line in each of n base dire...