AbstractThe relation between the extendability of linear codes over GF(q) having the minimum distance d with gcd(d,q)=1 and blocking sets with respect to lines in the projective space is given. From this geometrical point of view, some new conditions for which such codes are extendable are given
AbstractIn this paper we prove that a set of points (in a projective space over a finite field of q ...
AbstractLet [n, k, d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance...
Let PG(r, q) be the r-dimensional projective space over the finite field GF(q). A set X of points of...
AbstractThe relation between the extendability of linear codes over GF(q) having the minimum distanc...
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(m...
We give the necessary and sufficient conditions for the extendability of ternary linear codes of dim...
AbstractR. Hill and P. Lizak (1995, in “Proc. IEEE Int. Symposium on Inform. Theory, Whistler, Canad...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
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...
Complete (n, r)-arcs in P G(k − 1, q) and projective (n, k, n − r)q-codes that admit no projective e...
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
AbstractThe aim of this paper is to survey relationships between linear block codes over finite fiel...
Coding theory and Galois geometries are two research areas which greatly influence each other. In th...
In this short note we state how we construct new good linear codes C over the finite field with q el...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
AbstractIn this paper we prove that a set of points (in a projective space over a finite field of q ...
AbstractLet [n, k, d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance...
Let PG(r, q) be the r-dimensional projective space over the finite field GF(q). A set X of points of...
AbstractThe relation between the extendability of linear codes over GF(q) having the minimum distanc...
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(m...
We give the necessary and sufficient conditions for the extendability of ternary linear codes of dim...
AbstractR. Hill and P. Lizak (1995, in “Proc. IEEE Int. Symposium on Inform. Theory, Whistler, Canad...
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transpar...
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...
Complete (n, r)-arcs in P G(k − 1, q) and projective (n, k, n − r)q-codes that admit no projective e...
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
AbstractThe aim of this paper is to survey relationships between linear block codes over finite fiel...
Coding theory and Galois geometries are two research areas which greatly influence each other. In th...
In this short note we state how we construct new good linear codes C over the finite field with q el...
AbstractGiven any linear code C over a finite field GF(q) we show how C can be described in a transp...
AbstractIn this paper we prove that a set of points (in a projective space over a finite field of q ...
AbstractLet [n, k, d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance...
Let PG(r, q) be the r-dimensional projective space over the finite field GF(q). A set X of points of...
DOI
Add to ORKG