Add to ORKGLet nq(k, d) be the smallest integer n for which there exists an [n, k, d]q code for given q, k, d. It is known that n8(4, d) = ∑3 i=0 d/8i for all d ≥ 833. As
AbstractLet nq(k, d) be the smallest integer n for which there exists a linear code of length n, dim...
AbstractLet nq(k, d) denote the smallest value of n for which there exists an [n, k, d; q]-code. It ...
Let n(k,d) denote the smallest value of n for which a binary (n,k,d) code exists. Then n(k, d) was 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...
AbstractA central problem in coding theory is that of finding the smallest length for which there ex...
AbstractLet n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
AbstractFor n⩽30, we determine when an [n,k,d] (binary linear) code exists, and we classify optimal ...
Abstract. Let [n, k, d]q-code be a linear code of length n, dimension k and min-imum Hamming distanc...
AbstractWe classify optimal [n,k,d] binary linear codes of dimension ⩽7, with one exception, where b...
AbstractValues and lower bounds for nq(4,d) for general q are given, where nq(k,d) denotes the minim...
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....
Abstract. Let nq(k, d) denote the smallest value of n for which there exists a linear [n, k, d]-code...
In this paper, we classify all optimal linear [n; n=2; d] codes over Z 4 up to length 8, and determi...
AbstractLet nq(k, d) be the smallest integer n for which there exists a linear code of length n, dim...
AbstractLet nq(k, d) denote the smallest value of n for which there exists an [n, k, d; q]-code. It ...
Let n(k,d) denote the smallest value of n for which a binary (n,k,d) code exists. Then n(k, d) was 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...
AbstractA central problem in coding theory is that of finding the smallest length for which there ex...
AbstractLet n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
AbstractFor n⩽30, we determine when an [n,k,d] (binary linear) code exists, and we classify optimal ...
Abstract. Let [n, k, d]q-code be a linear code of length n, dimension k and min-imum Hamming distanc...
AbstractWe classify optimal [n,k,d] binary linear codes of dimension ⩽7, with one exception, where b...
AbstractValues and lower bounds for nq(4,d) for general q are given, where nq(k,d) denotes the minim...
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....
Abstract. Let nq(k, d) denote the smallest value of n for which there exists a linear [n, k, d]-code...
In this paper, we classify all optimal linear [n; n=2; d] codes over Z 4 up to length 8, and determi...
AbstractLet nq(k, d) be the smallest integer n for which there exists a linear code of length n, dim...
AbstractLet nq(k, d) denote the smallest value of n for which there exists an [n, k, d; q]-code. It ...
Let n(k,d) denote the smallest value of n for which a binary (n,k,d) code exists. Then n(k, d) was k...