Skip to Main content Skip to Navigation
Conference papers

Decoding of Quasi-Cyclic Codes up to A New Lower Bound on the Minimum Distance

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.
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-00975947
Contributor : Alexander Zeh Connect in order to contact the contributor
Submitted on : Thursday, April 10, 2014 - 10:58:57 AM
Last modification on : Thursday, January 6, 2022 - 2:50:02 PM
Long-term archiving on: : Thursday, July 10, 2014 - 11:31:03 AM

Files

QCC-ZehLing.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00975947, version 2
  • ARXIV : 1404.2819

Collections

Citation

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), IEEE, Jun 2014, Honolulu, United States. ⟨hal-00975947v2⟩

Share

Metrics

Record views

132

Files downloads

139