| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [22 references]
https://hal.inria.fr/hal-00975947
Contributor : Alexander Zeh <>
Submitted on : Thursday, April 10, 2014 - 10:58:57 AM
Last modification on : Sunday, December 31, 2017 - 9:44:02 AM
Long-term archiving on: : Thursday, July 10, 2014 - 11:31:03 AM
Contributor : Alexander Zeh <>
Submitted on : Thursday, April 10, 2014 - 10:58:57 AM
Last modification on : Sunday, December 31, 2017 - 9:44:02 AM
Long-term archiving on: : Thursday, July 10, 2014 - 11:31:03 AM
Files
QCC-ZehLing.pdf
Files produced by the author(s)