In 1978 R. Hill introduced a construction of linear codes arising from caps called cap-codes. Cap-codes corresponding to complete caps are particularly interesting, not only for having minimum distance greater than 3, but also because their dual codes have covering radius $2$, that is, all vectors in the Hamming space $V(n,q)$ have distance at most $2$ from some word of the code. Codes with small covering radius are useful for data compression since the value of covering radius gives a measure of maximum distorsion. In this paper we give a geometric construction of a $[110,5,90]_{9}$-linear code admitting the Mathieu group $M_{11}$ as a subgroup of its automorphism group
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering ...
The connection betweenmaximal caps (sometimes called complete caps) and certain binary codes called ...
Linear codes with large automorphism groups are constructed. Most of them are suitable for permutati...
In 1978 R. Hill introduced a construction of linear codes arising from caps called cap-codes. Cap-co...
In 1978 R. Hill introduced a construction of linear codes arising from caps called cap-codes. Cap-co...
Applying the Gale transform on certain linear and non-linear geometrical objects, and studying the o...
Applying the Gale transform on certain linear and non-linear geometrical objects, and studying the o...
Applying the Gale transform on certain linear and non-linear geometrical objects, and studying the o...
AbstractApplying the Gale transform on certain linear and non-linear geometrical objects, and studyi...
Let ℳ denote the Mathieu group on 24 points. Let G be the subgroup of ℳ which has three sets of tran...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering ...
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering ...
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering ...
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering ...
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering ...
The connection betweenmaximal caps (sometimes called complete caps) and certain binary codes called ...
Linear codes with large automorphism groups are constructed. Most of them are suitable for permutati...
In 1978 R. Hill introduced a construction of linear codes arising from caps called cap-codes. Cap-co...
In 1978 R. Hill introduced a construction of linear codes arising from caps called cap-codes. Cap-co...
Applying the Gale transform on certain linear and non-linear geometrical objects, and studying the o...
Applying the Gale transform on certain linear and non-linear geometrical objects, and studying the o...
Applying the Gale transform on certain linear and non-linear geometrical objects, and studying the o...
AbstractApplying the Gale transform on certain linear and non-linear geometrical objects, and studyi...
Let ℳ denote the Mathieu group on 24 points. Let G be the subgroup of ℳ which has three sets of tran...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering ...
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering ...
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering ...
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering ...
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering ...
The connection betweenmaximal caps (sometimes called complete caps) and certain binary codes called ...
Linear codes with large automorphism groups are constructed. Most of them are suitable for permutati...