Add to ORKGOne of the most important and challenging problems in coding theory is to construct codes with optimal parameters. As a generalization of cyclic codes, quasi-cyclic (QC) codes as well as quasi-twisted (QT) codes have been shown to contain record-breaking codes. In this paper, various computer algorithms have been used to search for good QC codes. A lot of good new QC codes have been found and they have been used to construct new linear codes. A total 11 new codes that improve the bound on the minimum distance are presented
It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In this pa...
We give a general lower bound for the minimum distance of q-ary quasi-cyclic codes of length ml and ...
Abstract: Let qdkn,, code be a linear code of length n, dimension k and minimum Hamming distance d...
One of the most important and challenging problems in coding theory is to construct codes with optim...
It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In thispap...
It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In this pa...
By means of local search techniques, five quasi-cyclic codes have been found that have a higher mini...
By means of local search techniques, five quasi-cyclic codes have been found that have a higher mini...
By means of local search techniques, five quasi-cyclic codes have been found that have a higher mini...
By means of local search techniques, five quasi-cyclic codes have been found that have a higher mini...
As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive se...
AbstractIn this paper, an updated table of maximum minimum distances for rate 1p binary quasi-cyclic...
AbstractOne of the most important problems of coding theory is to construct codes with best possible...
Abstract. Let [n, k, d]q-code be a linear code of length n, dimension k and min-imum Hamming distanc...
AbstractIn this paper, an updated table of maximum minimum distances for rate 1p binary quasi-cyclic...
It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In this pa...
We give a general lower bound for the minimum distance of q-ary quasi-cyclic codes of length ml and ...
Abstract: Let qdkn,, code be a linear code of length n, dimension k and minimum Hamming distance d...
One of the most important and challenging problems in coding theory is to construct codes with optim...
It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In thispap...
It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In this pa...
By means of local search techniques, five quasi-cyclic codes have been found that have a higher mini...
By means of local search techniques, five quasi-cyclic codes have been found that have a higher mini...
By means of local search techniques, five quasi-cyclic codes have been found that have a higher mini...
By means of local search techniques, five quasi-cyclic codes have been found that have a higher mini...
As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive se...
AbstractIn this paper, an updated table of maximum minimum distances for rate 1p binary quasi-cyclic...
AbstractOne of the most important problems of coding theory is to construct codes with best possible...
Abstract. Let [n, k, d]q-code be a linear code of length n, dimension k and min-imum Hamming distanc...
AbstractIn this paper, an updated table of maximum minimum distances for rate 1p binary quasi-cyclic...
It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In this pa...
We give a general lower bound for the minimum distance of q-ary quasi-cyclic codes of length ml and ...
Abstract: Let qdkn,, code be a linear code of length n, dimension k and minimum Hamming distance d...