AbstractAn [n,k,d]q code is called w-weight (mod q) if there are w integers i1,i2,…,iw∈{0,1,2,…,q−1} such that any weight i of the codewords satisfies i≡ij(modq) for some j. We consider 3-weight (mod q) [n,k,d]q codes with d≡−1(modq) whose weights are congruent to 0 or ±1(modq). We show that such codes are extendable when q is even and that there are some types of such codes which are always extendable when q is odd. The latter is a generalization of the result on the extendability of ternary linear codes [T. Maruta, Extendability of ternary linear codes, Des. Codes Cryptogr. 35 (2005) 175–190] to q-ary linear codes with q odd
Let [n; k; d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over ...
We show that the support of minimum Lee weight codewords having Hamming weight 5 in the Preparata co...
AbstractThe weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d1,d2,…,dk) wher...
AbstractR. Hill and P. Lizak (1995, in “Proc. IEEE Int. Symposium on Inform. Theory, Whistler, Canad...
AbstractFor an [n,k,d]4 code C with d odd, we define the diversity of C as the 3-tuple (Φ0,Φ1,Φ2) wi...
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...
AbstractThe diversity (Φ0,Φ1) of a ternary [n,k,d] code C with d≡1 or 2(mod3), k⩾3, is defined by Φ0...
AbstractFor an [n,k,d]q code C with k⩾3, gcd(d,q)=1, the diversity of C is defined as the pair (Φ0,Φ...
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...
AbstractThe difference g2−d2 for a q-ary linear [n,3,d] code C is studied. Here d2 is the second gen...
AbstractProperties of the weight distribution of low-dimensional generalized Reed–Muller codes are u...
For every prime-power q and every pair of natural numbers m ≤ n′, we construct a q-ary linear code o...
In this short note we state how we construct new good linear codes C over the finite field with q el...
International audienceWe study the combinatorial function L(k, q), the maximum number of nonzero wei...
Let [n; k; d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over ...
We show that the support of minimum Lee weight codewords having Hamming weight 5 in the Preparata co...
AbstractThe weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d1,d2,…,dk) wher...
AbstractR. Hill and P. Lizak (1995, in “Proc. IEEE Int. Symposium on Inform. Theory, Whistler, Canad...
AbstractFor an [n,k,d]4 code C with d odd, we define the diversity of C as the 3-tuple (Φ0,Φ1,Φ2) wi...
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...
AbstractThe diversity (Φ0,Φ1) of a ternary [n,k,d] code C with d≡1 or 2(mod3), k⩾3, is defined by Φ0...
AbstractFor an [n,k,d]q code C with k⩾3, gcd(d,q)=1, the diversity of C is defined as the pair (Φ0,Φ...
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...
AbstractThe difference g2−d2 for a q-ary linear [n,3,d] code C is studied. Here d2 is the second gen...
AbstractProperties of the weight distribution of low-dimensional generalized Reed–Muller codes are u...
For every prime-power q and every pair of natural numbers m ≤ n′, we construct a q-ary linear code o...
In this short note we state how we construct new good linear codes C over the finite field with q el...
International audienceWe study the combinatorial function L(k, q), the maximum number of nonzero wei...
Let [n; k; d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over ...
We show that the support of minimum Lee weight codewords having Hamming weight 5 in the Preparata co...
AbstractThe weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d1,d2,…,dk) wher...