Symbol-level soft-decision decoding of Reed-Solomon codes
From MaRDI portal
Recommendations
- Bit-level soft-decision decoding of Reed-Solomon codes
- Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft Information
- Computing Upper Bounds to Error Probability of Soft-Decision Decoding of Reed–Solomon Codes Based on the Ordered Statistics Algorithm
- An efficient soft-decision Reed-Solomon decoding algorithm
- Soft-In Soft-Out Decoding of Reed–Solomon Codes Based on Vardy and Be'ery's Decomposition
Cited in
(10)- Computing Upper Bounds to Error Probability of Soft-Decision Decoding of Reed–Solomon Codes Based on the Ordered Statistics Algorithm
- Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon Codes
- Bit-level soft-decision decoding of Reed-Solomon codes
- Soft-decision majority decoding of Reed-Muller codes
- Critically Subsampled Filterbanks for SISO Reed–Solomon Decoding
- Soft decision decoding of Reed Solomon codes using the Dorsch algorithm
- One-step completely orthogonalisable UEP codes and their soft decision decoding
- scientific article; zbMATH DE number 1424167 (Why is no real title available?)
- scientific article; zbMATH DE number 1424180 (Why is no real title available?)
- Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding
This page was built for publication: Symbol-level soft-decision decoding of Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453414)
