In 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)$
MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS)...
AbstractWe investigate the functional code Ch(X) introduced by G. Lachaud (1996) [10] in the special...
AbstractMonomial matrices are constructed which transform doubly-extended Reed-Solomon codes into BC...
In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length $...
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 work, we consider some methods to generate secret-sharing schemes from MDS and near-MDS code...
In this article we construct new minimal intersection sets in AG(r, q^2 ) sporting three intersecti...
A linear code with parameters $[n, k, n-k+1]$ is called a maximum distance separable (MDS for short)...
AbstractWe consider the problem of finding the maximum possible length m′(k,q) of a near-MDS code of...
AbstractWe obtain some effective lower and upper bounds for the number of (n,k)-MDS linear codes ove...
The version of record os available online at: http://dx.doi.org/10.1007/s10623-021-00846-yWe constr...
We study the dual linear code of points and generators on a non-singular Hermitian variety H(2n + 1,...
AbstractMaximum distance separable (MDS) codes have special properties that give them excellent erro...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS)...
AbstractWe investigate the functional code Ch(X) introduced by G. Lachaud (1996) [10] in the special...
AbstractMonomial matrices are constructed which transform doubly-extended Reed-Solomon codes into BC...
In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length $...
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 work, we consider some methods to generate secret-sharing schemes from MDS and near-MDS code...
In this article we construct new minimal intersection sets in AG(r, q^2 ) sporting three intersecti...
A linear code with parameters $[n, k, n-k+1]$ is called a maximum distance separable (MDS for short)...
AbstractWe consider the problem of finding the maximum possible length m′(k,q) of a near-MDS code of...
AbstractWe obtain some effective lower and upper bounds for the number of (n,k)-MDS linear codes ove...
The version of record os available online at: http://dx.doi.org/10.1007/s10623-021-00846-yWe constr...
We study the dual linear code of points and generators on a non-singular Hermitian variety H(2n + 1,...
AbstractMaximum distance separable (MDS) codes have special properties that give them excellent erro...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS)...
AbstractWe investigate the functional code Ch(X) introduced by G. Lachaud (1996) [10] in the special...
AbstractMonomial matrices are constructed which transform doubly-extended Reed-Solomon codes into BC...
DOI
Add to ORKG