Decoding of Repeated-Root Cyclic Codes up to New Bounds on Their Minimum Distance

Abstract : The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum distance of simple-root cyclic codes. We generalize these two bounds to the case of repeated-root cyclic codes and present a syndrome-based burst error decoding algorithm with guaranteed decoding radius based on an associated folded cyclic code. Furthermore, we present a third technique for bounding the minimum Hamming distance based on the embedding of a given repeated-root cyclic code into a repeated-root cyclic product code. A second quadratic-time probabilistic burst error decoding procedure based on the third bound is outlined. Index Terms Bound on the minimum distance, burst error, efficient decoding, folded code, repeated-root cyclic code, repeated-root cyclic product code
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal.inria.fr/hal-01161783
Contributor : Alexander Zeh <>
Submitted on : Tuesday, June 9, 2015 - 10:21:30 AM
Last modification on : Sunday, December 31, 2017 - 9:44:02 AM
Long-term archiving on : Tuesday, September 15, 2015 - 1:20:53 PM

Files

Repeated-Root-Bounds_submit_20...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01161783, version 1
  • ARXIV : 1506.02820

Collections

Citation

Alexander Zeh, Markus Ulmschneider. Decoding of Repeated-Root Cyclic Codes up to New Bounds on Their Minimum Distance. 2015. ⟨hal-01161783⟩

Share

Metrics

Record views

151

Files downloads

187