Abstract
We present the Plotkin-type bound on the generalized symbol-pair weight and show that all the symbol-pair equiweight codes achieve the Plotkin-type bound. Some new judging criteria are given for symbol-pair equiweight codes, and based on these judging criteria, we show the existence of a class of symbol-pair equiweight codes by design and graph theory. Also, we explicitly construct the symbol-pair version simplex code by the action of a group on a set. Furthermore, we construct several classes of inequiweight codes achieving the Plotkin-type bound.
| Original language | English |
|---|---|
| Article number | 10507095 |
| Pages (from-to) | 4990-5001 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 70 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - 1 Jul 2024 |
Keywords
- Hamilton cycle
- Plotkin-type bound
- Symbol-pair weight
- block intersection graph
- generalized value assignment
Fingerprint
Dive into the research topics of 'The Plotkin-Type Bound on the Generalized Symbol-Pair Weight and Symbol-Pair Equiweight Codes'. Together they form a unique fingerprint.Cite this
Liang, Y., & Liu, Z. (2024). The Plotkin-Type Bound on the Generalized Symbol-Pair Weight and Symbol-Pair Equiweight Codes. IEEE Transactions on Information Theory, 70(7), 4990-5001. Article 10507095. https://doi.org/10.1109/TIT.2024.3392744