Lower Bound on the Minimum Distance of Single-Generator Quasi-Twisted Codes

We recall a classic lower bound on the minimum Hamming distance of constacyclic codes over finite fields, analogous to well-known BCH for cyclic codes. This BCH-like serves as foundation proposing some minimum-distance bounds single-generator quasi-twisted (QT) Associating each QT code with an extension field, we obtain first bound. is analogue result in literature quasi-cyclic point out weaknesses this and propose novel that takes into account Chinese remainder theorem approach well proposed bound, contrast previous literature, does not presuppose specific form generator require calculations any field. illustrate our meets one when adheres assumed study. Various numerical examples enable us compare discuss these bounds.