IEEE International Symposium on Information Theory (ISIT), Paris, Fransa, 7 - 12 Temmuz 2019, ss.1922-1926
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.