Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
From MaRDI portal
Publication:259877
DOI10.1134/S0032946015030023zbMath1367.94396arXiv1506.02820OpenAlexW2963984992MaRDI QIDQ259877
F. Blanchet-Sadri, M. Dambrine
Publication date: 18 March 2016
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.02820
Related Items (3)
Matrix-product structure of repeated-root cyclic codes over finite fields ⋮ On LCD repeated-root cyclic codes over finite fields ⋮ Two new families of quantum synchronizable codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast multi-sequence shift-register synthesis with the Euclidean algorithm
- Repeated-root constacyclic codes of length
- 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
- List Decoding Tensor Products and Interleaved Codes
- 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
- A generalized Euclidean algorithm for multisequence shift-register synthesis
- 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.
This page was built for publication: Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
