A. J. van Zanten

Binary self-dual codes with automorphisms of composite order

In this paper, we present some results concerning a decomposition of binary self-dual codes having an automorphism of an order which is the product of two odd prime numbers. These results are applied to construct self-dual [72,36,12] codes with an automorphism of order 15. Furthermore, it is proved that the automorphism group of a putative binary extremal self-dual [72,36,16] code contains at most 28 nontrivial types of automorphisms of odd order. A complete list of these possible types of automorphisms is presented.

Index system and separability of constant weight Gray codes

A number system is developed for the conversion of natural numbers to the codewords of the Gray code G(n,k) of length n and weight k, and vice versa. The focus is on the subcode G(n,k) of G(n) consisting of those words of G(n) with precisely k 1-bits, 0 >

Minimal-change order and separability in linear codes

A linear code is said to be in minimal-change order if each codeword differs from its predecessor by a word of minimum weight. A rule is presented for constructing such an order in the case in which the code has a basis of codewords with minimum weight. Some consequences concerning the ranking and separability are mentioned. >

Lexicographic Order and Linearity

AbstractLet

On the existence of certain generalized Moore geometries, Part III

\mathcal{V}

Construction of Certain Cyclic Distance-Preserving CodesHaving Linear-Algebraic Characteristics

be a list of all words of

The separability of standard cyclic N-ary Gray codes

(GF(2))^n