IEEE International Symposium on Information Theory (ISIT), Paris, France, 7 - 12 July 2019, pp.1922-1926
Conference Paper / Full Text
Quasi-twisted code, Roos bound, shift bound, eigenvalues, polynomial matrices, spectral analysis, MINIMUM DISTANCE
Middle East Technical University Affiliated:
New lower bounds on the minimum distance of quasi-twisted codes over finite fields are proposed. They are based on spectral analysis and eigenvalues of polynomial matrices. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a manner similar to how the Roos and shift bounds extend the BCH and HT bounds for cyclic codes.