Publication date
April 2005
DOI Publisher
Elsevier B.V. ISSN
0012-365X Citation count (estimate)
9Abstract
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(mod4) or if Ai=0 for all i≡-d(mod4)
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(mod4) or if Ai=0 for all i≡-d(mod4)
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
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,Φ...
AbstractWe prove the existence of a [406,6,270]3 code and the nonexistence of linear codes with para...
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...
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(m...
AbstractWe prove the nonexistence of linear codes with parameters [400,5,299]4, [401,5,300]4, [405,5...
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...
AbstractThe diversity (Φ0,Φ1) of a ternary [n,k,d] code C with d≡1 or 2(mod3), k⩾3, is defined by Φ0...
AbstractLet n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
AbstractValues and lower bounds for nq(4,d) for general q are given, where nq(k,d) denotes the minim...
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
AbstractR. Hill and P. Lizak (1995, in “Proc. IEEE Int. Symposium on Inform. Theory, Whistler, Canad...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
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,Φ...
AbstractWe prove the existence of a [406,6,270]3 code and the nonexistence of linear codes with para...
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...
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(m...
AbstractWe prove the nonexistence of linear codes with parameters [400,5,299]4, [401,5,300]4, [405,5...
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...
AbstractThe diversity (Φ0,Φ1) of a ternary [n,k,d] code C with d≡1 or 2(mod3), k⩾3, is defined by Φ0...
AbstractLet n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
AbstractValues and lower bounds for nq(4,d) for general q are given, where nq(k,d) denotes the minim...
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
AbstractR. Hill and P. Lizak (1995, in “Proc. IEEE Int. Symposium on Inform. Theory, Whistler, Canad...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
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,Φ...
AbstractWe prove the existence of a [406,6,270]3 code and the nonexistence of linear codes with para...
Add to ORKG