Abstract
Based on the concept of the value assignment and the enumeration techniques in the projective space, we determine the subcode-support-weight distributions for several classes of linear optimal codes which were constructed recently by using the so-called down-sets. Particularly, the generalized Hamming weights of these classes of optimal codes can be determined from their subcode-support-weight distributions. By using the value assignment, we also determine the trellis complexity of each class of optimal codes.
Original language | English |
---|---|
Pages (from-to) | 1531-1543 |
Number of pages | 13 |
Journal | IEEE Transactions on Information Theory |
Volume | 69 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1 Mar 2023 |
Keywords
- Down-set
- generalized Hamming weight
- subcode support
- value assignment