In this paper, we complete the classi cation of optimal linear [n; n/2] codes up to length 28. We have determined that there are 1535 inequivalent [14,7,4] codes, 1682 inequivalent [20,10,6] codes, and 3 inequivalent [26,13,7] codes. In addition, we show that the smallest length for which an optimal rate 1/2 code has a trivial automorphism group is 14. Double circulant codes which attain the highest known minimum distance are given for lengths up to 64
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
Constructions of [162,8,80] and [159,8,78] codes are given. This solves the open problems of finding...
In this paper, we classify all optimal linear [n; n=2; d] codes over Z 4 up to length 8, and determi...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
AbstractFor n⩽30, we determine when an [n,k,d] (binary linear) code exists, and we classify optimal ...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
Linear codes with large automorphism groups are constructed. Most of them are suitable for permutati...
Linear codes with large automorphism groups are constructed. Most of them are suitable for permutati...
Linear codes with large automorphism groups are constructed. Most of them are suitable for permutati...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
Constructions of [162,8,80] and [159,8,78] codes are given. This solves the open problems of finding...
In this paper, we classify all optimal linear [n; n=2; d] codes over Z 4 up to length 8, and determi...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
AbstractFor n⩽30, we determine when an [n,k,d] (binary linear) code exists, and we classify optimal ...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
Linear codes with large automorphism groups are constructed. Most of them are suitable for permutati...
Linear codes with large automorphism groups are constructed. Most of them are suitable for permutati...
Linear codes with large automorphism groups are constructed. Most of them are suitable for permutati...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
Constructions of [162,8,80] and [159,8,78] codes are given. This solves the open problems of finding...