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,Φ1) withΦ0=1q−1∑q|i,i≠0Ai,Φ1=1q−1∑i≠0,d(modq)Ai.All the diversities for [n,k,d]q codes with k⩾3, d≢−2(modq) such that Ai=0 for all i≢0,−1,−2(modq) are found and characterized with their spectra geometrically, which yields that such codes are extendable for all odd q⩾5. Double extendability is also investigated
Complete (n, r)-arcs in P G(k − 1, q) and projective (n, k, n − r)q-codes that admit no projective e...
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
The famous MacWilliams Extension Theorem states that for classical codes each linear Hamming isometr...
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...
AbstractR. Hill and P. Lizak (1995, in “Proc. IEEE Int. Symposium on Inform. Theory, Whistler, Canad...
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...
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}...
AbstractThe diversity (Φ0,Φ1) of a ternary [n,k,d] code C with d≡1 or 2(mod3), k⩾3, is defined by Φ0...
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(m...
AbstractThe relation between the extendability of linear codes over GF(q) having the minimum distanc...
We give the necessary and sufficient conditions for the extendability of ternary linear codes of dim...
In classical coding theory, different types of extendability results of codes are known. Aclassical ...
Abstract. Let [n, k, d]q code be a linear code of length n, dimension k and Ham-ming minimum distanc...
Linear codes with complementary duals (LCD) are linear codes whose intersection with their dual are ...
Le fameux Théorème d’Extension de MacWilliams affirme que, pour les codes classiques, toute isométri...
Complete (n, r)-arcs in P G(k − 1, q) and projective (n, k, n − r)q-codes that admit no projective e...
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
The famous MacWilliams Extension Theorem states that for classical codes each linear Hamming isometr...
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...
AbstractR. Hill and P. Lizak (1995, in “Proc. IEEE Int. Symposium on Inform. Theory, Whistler, Canad...
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...
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}...
AbstractThe diversity (Φ0,Φ1) of a ternary [n,k,d] code C with d≡1 or 2(mod3), k⩾3, is defined by Φ0...
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(m...
AbstractThe relation between the extendability of linear codes over GF(q) having the minimum distanc...
We give the necessary and sufficient conditions for the extendability of ternary linear codes of dim...
In classical coding theory, different types of extendability results of codes are known. Aclassical ...
Abstract. Let [n, k, d]q code be a linear code of length n, dimension k and Ham-ming minimum distanc...
Linear codes with complementary duals (LCD) are linear codes whose intersection with their dual are ...
Le fameux Théorème d’Extension de MacWilliams affirme que, pour les codes classiques, toute isométri...
Complete (n, r)-arcs in P G(k − 1, q) and projective (n, k, n − r)q-codes that admit no projective e...
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
The famous MacWilliams Extension Theorem states that for classical codes each linear Hamming isometr...