AbstractThe notion of a shadow of a self-dual binary code is generalized to self-dual codes over Z4. A Gleason formula for the symmetrized weight enumerator of the shadow of a Type I code is derived. Congruence properties of the weights follow; this yields constructions of self-dual codes of larger lengths. Weight enumerators and the highest minimum Lee, Hamming, and Euclidean weights of Type I codes of length up to 24 are studied
textThis report is a survey of self-dual binary codes. We present the fundamental MacWilliams identi...
Gleason has described the general form that the weight distribution of a self-dual code over GF(2) a...
We define additive self-dual codes over G ...
AbstractThe notion of a shadow of a self-dual binary code is generalized to self-dual codes over Z4....
Binary self-dual codes and additive self-dual codes over GF(4) contain common points. Both have Type...
AbstractWe determine the weight enumerators for which there is a binary extremal self-dual [42,21,8]...
We find new extremal [76, 38, 14] and [78, 39, 14] binary self-dual codes. The code of length 76 is ...
AbstractThe optimal minimal Euclidean norm of self-dual codes over Z4 is known through length 24; th...
AbstractIn this paper we introduce the notion of s-extremal codes for self-dual binary codes and we ...
AbstractThe natural analogues of Lee weight and the Gray map over F4 are introduced. Self-dual codes...
AbstractGleason's theorem gives the general form of the weight enumerator of a linear binary self-du...
One of the most remarkable theorems in coding theory is Gleason’s 1970 theorem about the weight enum...
Recently Bachoc and Gaborit introduced the notion of s-extremality for binary self-dual codes, gener...
textThis report is a survey of self-dual binary codes. We present the fundamental MacWilliams identi...
AbstractThe optimal minimal Euclidean norm of self-dual codes over Z4 is known through length 24; th...
textThis report is a survey of self-dual binary codes. We present the fundamental MacWilliams identi...
Gleason has described the general form that the weight distribution of a self-dual code over GF(2) a...
We define additive self-dual codes over G ...
AbstractThe notion of a shadow of a self-dual binary code is generalized to self-dual codes over Z4....
Binary self-dual codes and additive self-dual codes over GF(4) contain common points. Both have Type...
AbstractWe determine the weight enumerators for which there is a binary extremal self-dual [42,21,8]...
We find new extremal [76, 38, 14] and [78, 39, 14] binary self-dual codes. The code of length 76 is ...
AbstractThe optimal minimal Euclidean norm of self-dual codes over Z4 is known through length 24; th...
AbstractIn this paper we introduce the notion of s-extremal codes for self-dual binary codes and we ...
AbstractThe natural analogues of Lee weight and the Gray map over F4 are introduced. Self-dual codes...
AbstractGleason's theorem gives the general form of the weight enumerator of a linear binary self-du...
One of the most remarkable theorems in coding theory is Gleason’s 1970 theorem about the weight enum...
Recently Bachoc and Gaborit introduced the notion of s-extremality for binary self-dual codes, gener...
textThis report is a survey of self-dual binary codes. We present the fundamental MacWilliams identi...
AbstractThe optimal minimal Euclidean norm of self-dual codes over Z4 is known through length 24; th...
textThis report is a survey of self-dual binary codes. We present the fundamental MacWilliams identi...
Gleason has described the general form that the weight distribution of a self-dual code over GF(2) a...
We define additive self-dual codes over G ...
DOI
Add to ORKG