Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding
From MaRDI portal
Recommendations
- Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part I: An Algebraic Soft-In Hard-Out Chase Decoder
- Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix
- Publication:4945377
- A complexity-reduced interpolation algorithm for soft-decision decoding of Reed-Solomon codes
- Bit-level soft-decision decoding of Reed-Solomon codes
- An efficient soft-decision Reed-Solomon decoding algorithm
- Symbol-level soft-decision decoding of Reed-Solomon codes
- Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft Information
- Soft decision decoding of Reed Solomon codes using the Dorsch algorithm
- scientific article; zbMATH DE number 1424167
Cited in
(6)- A novel low-cost multi-mode Reed Solomon decoder design based on Peterson-Gorenstein-Zierler algorithm
- Successive cancellation decoding of Reed-Solomon codes
- The software implementation of decoding for RS code based on a new degree computationless modified Euclid (DCME) algorithm
- High-speed \(\mathrm{RS}(255, 239)\) decoder based on LCC decoding
- A Simple Soft-Input/Soft-Output Decoder for Hamming Codes
- Soft decision decoding of Reed Solomon codes using the Dorsch algorithm
This page was built for publication: Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281558)