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

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 the well-known BCH bound for cyclic codes. This BCH-like bound serves as a foundation for proposing some minimum-distance lower bounds for single-generator quasi-twisted (QT) codes....

Full description

Bibliographic Details
Main Authors: Adel Alahmadi, Patrick Solé, Ramy Taki Eldin
Format: Article
Language:English
Published: MDPI AG 2023-05-01
Series:Mathematics
Subjects:
quasi-twisted codes
constacyclic codes
quasi-cyclic codes
BCH bound
Online Access:https://www.mdpi.com/2227-7390/11/11/2539

Similar Items

Similar Items