AbstractIn this work, we consider a classification of infinite families of linear codes which achieve the Griesmer bound, using the projective dual transform. We investigate the correspondence between families of linear codes with given properties via dual transform
AbstractIn this paper we prove that a set of points (in a projective space over a finite field of q ...
Self-dual codes are important because many of the best codes known are of this type and they have a ...
It is well-known that few-weight linear codes have better applications in secret sharing schemes \ci...
AbstractIn this work, we consider a classification of infinite families of linear codes which achiev...
AbstractWe present a brief survey of projective codes meeting the Griesmer bound. Methods for constr...
AbstractA new class of codes over GF(ql) that meet the Griesmer bound are constructed in a simple wa...
AbstractIn this article we give a Griesmer type bound for linear codes over finite quasi-Frobenius r...
AbstractBinary linear codes with length at most one above the Griesmer bound were proven to satisfy ...
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...
AbstractThis paper studies and classifies linear transformations that connect Hamming distances of c...
AbstractWe construct families of three-dimensional linear codes that attain the Griesmer bound and g...
AbstractFor any prime power q > 2 we construct a family of linear codes over an alphabet of q letter...
It will be shown that the following binary linear codes are unique: (n, k, d) = (2{suk} − 2u, k, 2{s...
AbstractWe prove that if a linear code overGF(p),pa prime, meets the Griesmer bound, then ifpedivide...
AbstractIn this paper we prove that a set of points (in a projective space over a finite field of q ...
Self-dual codes are important because many of the best codes known are of this type and they have a ...
It is well-known that few-weight linear codes have better applications in secret sharing schemes \ci...
AbstractIn this work, we consider a classification of infinite families of linear codes which achiev...
AbstractWe present a brief survey of projective codes meeting the Griesmer bound. Methods for constr...
AbstractA new class of codes over GF(ql) that meet the Griesmer bound are constructed in a simple wa...
AbstractIn this article we give a Griesmer type bound for linear codes over finite quasi-Frobenius r...
AbstractBinary linear codes with length at most one above the Griesmer bound were proven to satisfy ...
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...
AbstractThis paper studies and classifies linear transformations that connect Hamming distances of c...
AbstractWe construct families of three-dimensional linear codes that attain the Griesmer bound and g...
AbstractFor any prime power q > 2 we construct a family of linear codes over an alphabet of q letter...
It will be shown that the following binary linear codes are unique: (n, k, d) = (2{suk} − 2u, k, 2{s...
AbstractWe prove that if a linear code overGF(p),pa prime, meets the Griesmer bound, then ifpedivide...
AbstractIn this paper we prove that a set of points (in a projective space over a finite field of q ...
Self-dual codes are important because many of the best codes known are of this type and they have a ...
It is well-known that few-weight linear codes have better applications in secret sharing schemes \ci...
DOI
Add to ORKG