Decoding of Quasi-Cyclic Codes up to A New Lower Bound on the Minimum Distance - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

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.
Fichier principal
Vignette du fichier
QCC-ZehLing.pdf (155.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00975947 , version 1 (09-04-2014)
hal-00975947 , version 2 (10-04-2014)

Identifiers

Cite

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⟩

Collections

INSMI
139 View
165 Download

Altmetric

Share

Gmail Facebook X LinkedIn More