A Comparison of Distance Bounds for Quasi-Twisted Codes
At a glance
- Citations
- 0
- References
- 34
- Comments
- 0
Öz
Spectral bounds on the minimum distance of quasi-twisted codes over finite fields are proposed, based on eigenvalues of polynomial matrices and the corresponding eigenspaces. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a way similar to how the Roos and shift bounds extend the BCH and HT bounds for cyclic codes. The eigencodes of a quasi-twisted code in the spectral theory and the outer codes in its concatenated structure are related. A comparison based on this relation verifies that the Jensen bound always outperforms the spectral bound under special conditions, which yields a similar relation between the Lally and the spectral bounds. The performances of the Lally, Jensen and spectral bounds are presented in comparison with each other.
Publication details
- DOI
- 10.1109/tit.2021.3084146
- OpenAlex
- W3115655699
- Document type
- article
- Language
- EN
- Source
- IEEE Transactions on Information Theory
- Last metadata update
Comments
Oturum Açın to join the discussion.