AbstractA central problem in coding theory is that of finding the smallest length for which there exists a linear code of dimension k and minimum distance d, over a field of q elements. We consider here the problem for quaternary codes(q=4), solving the problem for k⩽ for all values of d, and for k=4 for all but ten values of d
Determining the best possible values of the parameters of a linear code is one of the most fundament...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
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 n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
AbstractLet nq(k, d) be the smallest integer n for which there exists a linear code of length n, dim...
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 smallest integer n, such that a quaternary linear [n, k, d]-code exists....
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(m...
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...
Determining the best possible values of the parameters of a linear code is one of the most fundament...
Abstract. Let [n, k, d]q-code be a linear code of length n, dimension k and min-imum Hamming distanc...
For the purpose of error correcting linear codes over a finite field GF (q) and fixed dimension k we...
Determining the best possible values of the parameters of a linear code is one of the most fundament...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
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 n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
AbstractLet nq(k, d) be the smallest integer n for which there exists a linear code of length n, dim...
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 smallest integer n, such that a quaternary linear [n, k, d]-code exists....
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(m...
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...
Determining the best possible values of the parameters of a linear code is one of the most fundament...
Abstract. Let [n, k, d]q-code be a linear code of length n, dimension k and min-imum Hamming distanc...
For the purpose of error correcting linear codes over a finite field GF (q) and fixed dimension k we...
Determining the best possible values of the parameters of a linear code is one of the most fundament...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
DOI
Add to ORKG