AbstractLet [n, k, d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). Let d8(n, k) be the maximum possible minimum Hamming distance of a linear [n, k, d; 8]-code for given values of n and k. In this paper, eighteen new linear codes over GF(8) are constructed which improve the table of d8(n, k) by Brouwer
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
Abstract. Let nq(k, d) denote the smallest value of n for which there exists a linear [n, k, d]-code...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
Abstract. Let [n, k, d]q-code be a linear code of length n, dimension k and min-imum Hamming distanc...
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 Ham-ming minimum distanc...
Determining the best possible values of the parameters of a linear code is one of the most fundament...
Let nq(k, d) be the smallest integer n for which there exists an [n, k, d]q code for given q, k, d. ...
Constructions of [162,8,80] and [159,8,78] codes are given. This solves the open problems of finding...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
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 ...
Abstract: Let qdkn,, code be a linear code of length n, dimension k and minimum Hamming distance d...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
Abstract. Let nq(k, d) denote the smallest value of n for which there exists a linear [n, k, d]-code...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
Abstract. Let [n, k, d]q-code be a linear code of length n, dimension k and min-imum Hamming distanc...
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 Ham-ming minimum distanc...
Determining the best possible values of the parameters of a linear code is one of the most fundament...
Let nq(k, d) be the smallest integer n for which there exists an [n, k, d]q code for given q, k, d. ...
Constructions of [162,8,80] and [159,8,78] codes are given. This solves the open problems of finding...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
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 ...
Abstract: Let qdkn,, code be a linear code of length n, dimension k and minimum Hamming distance d...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
Abstract. Let nq(k, d) denote the smallest value of n for which there exists a linear [n, k, d]-code...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
DOI
Add to ORKG