A complexity-reduced interpolation algorithm for soft-decision decoding of Reed-Solomon codes
From MaRDI portal
Recommendations
- Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes
- Algebraic soft-decision decoding of reed-solomon codes
- A new Reed-Solomon code decoding algorithm based on Newton's interpolation
- Bounded distance+1 soft-decision Reed-Solomon decoding
- Towards a VLSI architecture for interpolation-based soft-decision Reed-Solomon decoders
Cited in
(7)- Towards a VLSI architecture for interpolation-based soft-decision Reed-Solomon decoders
- Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes
- The software implementation of decoding for RS code based on a new degree computationless modified Euclid (DCME) algorithm
- A new Reed-Solomon code decoding algorithm based on Newton's interpolation
- Using Lagrange's interpolation formula to construct Reed-Solomon codes over GF(p)
- scientific article; zbMATH DE number 7385926 (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: A complexity-reduced interpolation algorithm for 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 Q2855159)