AbstractLet nq(k, d) be the smallest integer n for which there exists a linear code of length n, dimension k and minimum distance d, over the q-element field. In this paper we prove the nonexistence of quaternary linear codes with parameters [190,5,141], [239,5,178], [275,5,205], [288,5,215], [291,5,217] and [488,5,365]. This gives an improved lower bound of n4(5, d) for d = 141,142 and determines the exact value of n4(5,d) for d = 178, 205, 206, 215, 217, 218, 365, 366, 367, 368. The updated table of n4(5,d) is also given
An additive quaternary [n, k, d]-code (length n, quaternary dimension k, minimum distance d) is a 2k...
Let [n; k; d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over ...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
AbstractA central problem in coding theory is that of finding the smallest length for which there ex...
AbstractWe prove the nonexistence of linear codes with parameters [400,5,299]4, [401,5,300]4, [405,5...
AbstractValues and lower bounds for nq(4,d) for general q are given, where nq(k,d) denotes the minim...
AbstractLet n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
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...
In this paper, the best parameters of quaternary additive codes of small length are determined using...
In this paper, the best parameters of quaternary additive codes of small length are determined using...
An additive quaternary [n, k, d]-code (length n, quaternary dimension k, minimum distance d) is a 2k...
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
AbstractLet n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
An additive quaternary [n, k, d]-code (length n, quaternary dimension k, minimum distance d) is a 2k...
Let [n; k; d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over ...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
AbstractA central problem in coding theory is that of finding the smallest length for which there ex...
AbstractWe prove the nonexistence of linear codes with parameters [400,5,299]4, [401,5,300]4, [405,5...
AbstractValues and lower bounds for nq(4,d) for general q are given, where nq(k,d) denotes the minim...
AbstractLet n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
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...
In this paper, the best parameters of quaternary additive codes of small length are determined using...
In this paper, the best parameters of quaternary additive codes of small length are determined using...
An additive quaternary [n, k, d]-code (length n, quaternary dimension k, minimum distance d) is a 2k...
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
AbstractLet n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
An additive quaternary [n, k, d]-code (length n, quaternary dimension k, minimum distance d) is a 2k...
Let [n; k; d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over ...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...