Parallel decoding of the Reed-Solomon codes
From MaRDI portal
Recommendations
- Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials
- Parallelizations of the Error Correcting Code Problem
- Parallel decoding cyclic burst error correcting codes
- scientific article; zbMATH DE number 57521
- Parallel error correcting codes
- The decoding of extended Reed-Solomon codes
- Sequential decoding for a subcode of Reed Solomon codes
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- Decoding Reed–Solomon Skew-Differential Codes
Cited in
(13)- Quasioptimal methods of correlational reception of Reed-Solomon codes
- High-speed decoder of Reed-Solomon codes
- Area optimization of parallel Chien search architecture for Reed-Solomon (255, 239) decoder
- Parallel decoding of the (23, 12, 7) binary Golay code
- scientific article; zbMATH DE number 1742183 (Why is no real title available?)
- A design of Reed-Solomon decoder with systolic-array structure
- Architecture for a low complexity rate-adaptive Reed-Solomon encoder
- scientific article; zbMATH DE number 1782271 (Why is no real title available?)
- Fully Parallel Stochastic LDPC Decoders
- Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials
- scientific article; zbMATH DE number 847153 (Why is no real title available?)
- High-throughput Reed-Solomon decoder
- scientific article; zbMATH DE number 2219129 (Why is no real title available?)
This page was built for publication: Parallel decoding of the Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1778370)