On multi-trial Forney-Kovalev decoding of concatenated codes
From MaRDI portal
Publication:2437957
DOI10.3934/AMC.2014.8.1zbMath1283.94142OpenAlexW2088789595MaRDI QIDQ2437957
Anas Chaaban, Christian Senger, Vladimir Sidorenko
Publication date: 10 March 2014
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2014.8.1
concatenated codesGMD decodingadaptive erasingerror correcting radiusfixed erasingmulti-trial decoding
Related Items (1)
Cites Work
- Unnamed Item
- Multitrial decoding of concatenated codes using fixed thresholds
- Single-trial decoding of concatenated codes using fixed or adaptive erasing
- Decoding of Reed Solomon codes beyond the error-correction bound
- Two classes of minimum generalized distance decoding algorithms
- Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
- A new Reed-Solomon code decoding algorithm based on Newton's interpolation
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Reduced GMD decoding
- Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
- Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
- Generalized minimum distance decoding
This page was built for publication: On multi-trial Forney-Kovalev decoding of concatenated codes
