On the trellis complexity of certain binary linear block codes

The trellis complexity s(C) of an [n, k, d]-code C is investigated, in the case where the weights of nonzero codewords in C are confined to {d, /spl middotspl middotspl middot/, 2d-1}/spl cup/{n}. It is shown that s(C)/spl ges/k-1. Furthermore, s(C)=k-1 if the code is self-complementary. If the nonzero weights are confined to {d, /spl middotspl middotspl middot/, 2d-3}, then s(C)=k.<
>