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.<
>