Abstract : A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov- Trifonov bound in a similar way as the Hartmann-Tzeng bound extends the BCH approach for cyclic codes. Furthermore, a syndrome-based algebraic decoding algorithm is given.
https://hal.inria.fr/hal-00975947
Contributeur : Alexander Zeh
<>
Soumis le : jeudi 10 avril 2014 - 10:58:57
Dernière modification le : dimanche 31 décembre 2017 - 09:44:02
Document(s) archivé(s) le : jeudi 10 juillet 2014 - 11:31:03
Alexander Zeh, San Ling. Decoding of Quasi-Cyclic Codes up to A New Lower Bound on the Minimum Distance. IEEE International Symposium on Information Theory (ISIT 2014), Jun 2014, Honolulu, United States. IEEE, 2014. 〈hal-00975947v2〉
