On the optimum distance profiles about linear block codes
IEEE Transactions on Information Theory
Hi-index | 0.06 |
There are a large number of linear block codes satisfying the chain condition. Their weight hierarchies are called chain good and form an important group in classifying all possible weight hierarchies. In this paper, we present a series of new sufficient conditions to determine which kinds of sequences are chain good weight hierarchies. Our results are efficient for the determination of the chain good weight hierarchies with high dimension.