Title :
Minimal-change order and separability in linear codes
Author :
van Zanten, A.J.
Author_Institution :
Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands
fDate :
11/1/1993 12:00:00 AM
Abstract :
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
Keywords :
codes; codeword; linear code; minimal-change order; minimum weight word; ranking; separability; Binary codes; Error correction codes; Hamming distance; Linear code; Mathematics; Reflective binary codes; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
