Successive cancellation decoding of Reed-Solomon codes
From MaRDI portal
Publication:2352633
Recommendations
Cites work
- Algebraic soft-decision decoding of reed-solomon codes
- Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
- Bit-level soft-decision decoding of Reed-Solomon codes
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- How to Construct Polar Codes
- scientific article; zbMATH DE number 3485622 (Why is no real title available?)
- List Decoding of Polar Codes
- Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding
- New generalizations of the Reed-Muller codes--I: Primitive codes
- Polar Codes for the m-User Multiple Access Channel
Cited in
(4)- Exploiting the cannibalistic traits of Reed-Solomon codes
- Soft-In Soft-Out Decoding of Reed–Solomon Codes Based on Vardy and Be'ery's Decomposition
- scientific article; zbMATH DE number 4008276 (Why is no real title available?)
- scientific article; zbMATH DE number 1424167 (Why is no real title available?)
This page was built for publication: Successive cancellation decoding of Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2352633)