Abstract
We state that the minimum and the maximum support weight of subcodes of a code are useful in several aspects. Based on the above findings, we will determine part of the above mentioned parameters for two classes of binary codes. We also present the separation property and calculate the trellis complexity of a class of binary codes.
Original language | English |
---|---|
Article number | 112261 |
Journal | Discrete Mathematics |
Volume | 344 |
Issue number | 3 |
DOIs | |
Publication status | Published - Mar 2021 |
Keywords
- Fullrank
- Separation
- Support weight
- Trellis complexity
- Value function