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....
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
MDPI AG
2023-05-01
|
| Edice: | Mathematics |
| Témata: | |
| On-line přístup: | https://www.mdpi.com/2227-7390/11/11/2539 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|