Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
From MaRDI portal
Publication:259877
DOI10.1134/S0032946015030023zbMATH Open1367.94396arXiv1506.02820OpenAlexW2963984992MaRDI QIDQ259877FDOQ259877
Authors: A. Zeh, M. Ulmschneider 
Publication date: 18 March 2016
Published in: Problems of Information Transmission (Search for Journal in Brave)
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
Full work available at URL: https://arxiv.org/abs/1506.02820
Recommendations
Cites Work
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
- On the algebraic structure of quasi-cyclic codes. IV: Repeated roots
- Title not available (Why is that?)
- On a class of error correcting binary group codes
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
- Title not available (Why is that?)
- A generalized Euclidean algorithm for multisequence shift-register synthesis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semisimple cyclic and Abelian codes. II
- Weight distributions of cyclic self-dual codes
- On Repeated-Single-Root Constacyclic Codes
- On generalizations of repeated-root cyclic codes
- Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
- Decoding Cyclic Codes up to a New Bound on the Minimum Distance
- Cyclic product codes
- Further results on cyclic product codes
- Decoding beyond the BCH bound (Corresp.)
- Generalizations of the BCH bound
- Polynomial weights and code constructions
- On repeated-root cyclic codes
- Repeated-root cyclic codes
- Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik.
- Fast multi-sequence shift-register synthesis with the Euclidean algorithm
- Repeated-root constacyclic codes of length
Cited In (9)
- Decoding Cyclic Codes up to a New Bound on the Minimum Distance
- A new procedure for decoding cyclic and BCH codes up to actual minimum distance
- Matrix-product structure of repeated-root cyclic codes over finite fields
- On repeated-root cyclic codes
- Repeated-root cyclic codes
- On LCD repeated-root cyclic codes over finite fields
- The Use of Multivariate Weak-Locator Polynomials to Decode Cyclic Codes up to Actual Minimum Distance
- Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
- Two new families of quantum synchronizable codes
This page was built for publication: Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259877)
