A new minimum distance bound of generalized quasi-twisted codes
Abstract
A pivotal challenge within the field of coding theory is to develop codes that achieve the optimal minimum distance. Generalized quasi-twisted (GQT) codes constitute a natural extension encompassing both generalized quasi-cyclic (GQC) codes and quasi-twisted (QT) codes. Based on the trace representation of GQT codes, we derive a new bound on the minimum distance of GQT codes with two nonzero constituents at first. We subsequently extend this result to GQT codes with arbitrary number of nonzero constituents. Examples show that under some conditions the new bound is better than the one given by Hou and Gao in Finite Fields Appl. (2020).
Fields of Study & Subjects
Coding theory and cryptography
graph theory and CDMA systems
Advanced Wireless Communication Techniques
Publication details
- Journal / source
- Advances in Mathematics of Communications
- Publisher
- American Institute of Mathematical Sciences (AIMS)
- Volume
- 24
- Issue
- 0
- Pages
- 190–207
- Publication date
- 1 January 2026