In this paper, the 3-rank of the incidence matrices of 2-designs supported by the minimum weight codewords in a family of ternary linear codes considered in Ding and Li (Discret Math 340(10):2415–2431, 2017) are computed. A lower bound on the minimum distance of the ternary codes spanned by the incidence matrices of these designs is derived, and it is proved that the codes are subcodes of the 4th order generalized Reed–Muller codes
A linear code with the systematic generator matrix [I|P] is maximum distance separable (MDS) if and ...
The support of an [n, k] linear code C over a finite field $F_{q}$ is the set of all coordinate posi...
All affine resolvable designs with parameters of the design of the hyperplanes in ternary affine 3-s...
In this paper, the 3-rank of the incidence matrices of 2-designs supported by the minimum weight cod...
Let [n; k; d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over ...
Abstract. The binary and ternary codes spanned by the rows of the point by block incidence matrices ...
Abstract: Let qdkn,, code be a linear code of length n, dimension k and minimum Hamming distance d...
AbstractProperties of the weight distribution of low-dimensional generalized Reed–Muller codes are u...
A classical method of constructing a linear code over GF(q) with a t-design is to use the incidence ...
AbstractThe support of an [n,k] linear code C over a finite field Fq is the set of all coordinate po...
We show how to get a 1-1 correspondence between projective linear codes and 2-weight linear codes. A...
In this note, we report the classification of all symmetric 2-(36, 15, 6) designs that admit an auto...
Cyclic codes are an important subclass of linear codes and have wide applications in data storage sy...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....
AbstractAn explicit basis of incidence vectors for thep-ary code of the design of points and hyperpl...
A linear code with the systematic generator matrix [I|P] is maximum distance separable (MDS) if and ...
The support of an [n, k] linear code C over a finite field $F_{q}$ is the set of all coordinate posi...
All affine resolvable designs with parameters of the design of the hyperplanes in ternary affine 3-s...
In this paper, the 3-rank of the incidence matrices of 2-designs supported by the minimum weight cod...
Let [n; k; d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over ...
Abstract. The binary and ternary codes spanned by the rows of the point by block incidence matrices ...
Abstract: Let qdkn,, code be a linear code of length n, dimension k and minimum Hamming distance d...
AbstractProperties of the weight distribution of low-dimensional generalized Reed–Muller codes are u...
A classical method of constructing a linear code over GF(q) with a t-design is to use the incidence ...
AbstractThe support of an [n,k] linear code C over a finite field Fq is the set of all coordinate po...
We show how to get a 1-1 correspondence between projective linear codes and 2-weight linear codes. A...
In this note, we report the classification of all symmetric 2-(36, 15, 6) designs that admit an auto...
Cyclic codes are an important subclass of linear codes and have wide applications in data storage sy...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....
AbstractAn explicit basis of incidence vectors for thep-ary code of the design of points and hyperpl...
A linear code with the systematic generator matrix [I|P] is maximum distance separable (MDS) if and ...
The support of an [n, k] linear code C over a finite field $F_{q}$ is the set of all coordinate posi...
All affine resolvable designs with parameters of the design of the hyperplanes in ternary affine 3-s...