Add to ORKGAbstract. Let [n, k, d]q code be a linear code of length n, dimension k and Ham-ming minimum distance d over GF(q). In this paper record-breaking codes with pa
The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) +...
Let $GF(q) $ denote the Galois field of $q $ elements and let $V(n, q) $ denote the row vector space...
In this paper, we classify all optimal linear [n; n=2; d] codes over Z 4 up to length 8, and determi...
AbstractLet [n, k, d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance...
Let [n; k; d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over ...
Abstract. Let [n, k, d]q-code be a linear code of length n, dimension k and min-imum Hamming distanc...
AbstractValues and lower bounds for nq(4,d) for general q are given, where nq(k,d) denotes the minim...
AbstractA central problem in coding theory is that of finding the smallest length for which there ex...
Determining the best possible values of the parameters of a linear code is one of the most fundament...
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 ...
Abstract: Let qdkn,, code be a linear code of length n, dimension k and minimum Hamming distance d...
Let Aq (n, d) denote the maximum size of a q-ary code with length n and minimum distance d. For most...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) +...
Let $GF(q) $ denote the Galois field of $q $ elements and let $V(n, q) $ denote the row vector space...
In this paper, we classify all optimal linear [n; n=2; d] codes over Z 4 up to length 8, and determi...
AbstractLet [n, k, d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance...
Let [n; k; d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over ...
Abstract. Let [n, k, d]q-code be a linear code of length n, dimension k and min-imum Hamming distanc...
AbstractValues and lower bounds for nq(4,d) for general q are given, where nq(k,d) denotes the minim...
AbstractA central problem in coding theory is that of finding the smallest length for which there ex...
Determining the best possible values of the parameters of a linear code is one of the most fundament...
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 ...
Abstract: Let qdkn,, code be a linear code of length n, dimension k and minimum Hamming distance d...
Let Aq (n, d) denote the maximum size of a q-ary code with length n and minimum distance d. For most...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) +...
Let $GF(q) $ denote the Galois field of $q $ elements and let $V(n, q) $ denote the row vector space...
In this paper, we classify all optimal linear [n; n=2; d] codes over Z 4 up to length 8, and determi...