Add to ORKGIn this paper, we classify all optimal linear [n; n=2; d] codes over Z 4 up to length 8, and determine the number of optimal codes which are self-dual and formally self-dual. Those codes with linear binary iare is also found. In particular, we show that for length 8, there are eight optimal codes for the Hamming distance, one optimal code for the Lee distance, and two optimal codes for the Euclidean distance. Keywords{Optimal linear codes, Codes over F 4 .
AbstractThe binary optimal self-orthogonal codes of dimension 4⩽k⩽10 and length 15⩽n⩽k+16 are classi...
AbstractAccording to V. Pless et al. (1997, J. Combin. Theory Ser. A78, 32–50) all Z4 codes of type ...
In this paper, we complete the classification of optimal binary linear self-orthogonal codes up to l...
AbstractThe optimal minimal Euclidean norm of self-dual codes over Z4 is known through length 24; th...
AbstractThe optimal minimal Euclidean norm of self-dual codes over Z4 is known through length 24; th...
In this paper, we complete the classi cation of optimal linear [n; n/2] codes up to length 28. We ha...
The optimal minimal Euclidean norm of self-dual codes over ℤ_4 is known through length 24; the purpo...
The optimal minimal Euclidean norm of self-dual codes over ℤ_4 is known through length 24; the purpo...
The optimal minimal Euclidean norm of self-dual codes over ℤ_4 is known through length 24; the purpo...
AbstractLet n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
AbstractA central problem in coding theory is that of finding the smallest length for which there ex...
AbstractFor n⩽30, we determine when an [n,k,d] (binary linear) code exists, and we classify optimal ...
AbstractThe binary optimal self-orthogonal codes of dimension 4⩽k⩽10 and length 15⩽n⩽k+16 are classi...
AbstractAccording to V. Pless et al. (1997, J. Combin. Theory Ser. A78, 32–50) all Z4 codes of type ...
In this paper, we complete the classification of optimal binary linear self-orthogonal codes up to l...
AbstractThe optimal minimal Euclidean norm of self-dual codes over Z4 is known through length 24; th...
AbstractThe optimal minimal Euclidean norm of self-dual codes over Z4 is known through length 24; th...
In this paper, we complete the classi cation of optimal linear [n; n/2] codes up to length 28. We ha...
The optimal minimal Euclidean norm of self-dual codes over ℤ_4 is known through length 24; the purpo...
The optimal minimal Euclidean norm of self-dual codes over ℤ_4 is known through length 24; the purpo...
The optimal minimal Euclidean norm of self-dual codes over ℤ_4 is known through length 24; the purpo...
AbstractLet n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
AbstractA central problem in coding theory is that of finding the smallest length for which there ex...
AbstractFor n⩽30, we determine when an [n,k,d] (binary linear) code exists, and we classify optimal ...
AbstractThe binary optimal self-orthogonal codes of dimension 4⩽k⩽10 and length 15⩽n⩽k+16 are classi...
AbstractAccording to V. Pless et al. (1997, J. Combin. Theory Ser. A78, 32–50) all Z4 codes of type ...
In this paper, we complete the classification of optimal binary linear self-orthogonal codes up to l...