Bounded distance+1 soft-decision Reed-Solomon decoding
From MaRDI portal
Publication:4887052
Recommendations
Cited in
(21)- Successive cancellation decoding of Reed-Solomon codes
- Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm
- Novel Reed-Solomon hard-decision decoding algorithm study based on new hybrid channel model
- Soft Distance Metric Decoding of Polar Codes
- A complexity-reduced interpolation algorithm for soft-decision decoding of Reed-Solomon codes
- An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding
- A novel approach to soft decision decoding of threshold decodable codes (Corresp.)
- On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications
- Computing Upper Bounds to Error Probability of Soft-Decision Decoding of Reed–Solomon Codes Based on the Ordered Statistics Algorithm
- Decoding interleaved Reed-Solomon codes over noisy channels
- Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft Information
- Simplified correlation decoding by selecting possible codewords using erasure information (Corresp.)
- The non-gap sequence of a subcode of a generalized Reed-Solomon code
- Quasioptimal methods of correlational reception of Reed-Solomon codes
- An efficient soft-decision Reed-Solomon decoding algorithm
- A Decoding Approach to Reed–Solomon Codes from Their Definition
- Reconstructing Algebraic Functions from Mixed Data
- scientific article; zbMATH DE number 1424180 (Why is no real title available?)
- Soft-In Soft-Out Decoding of Reed–Solomon Codes Based on Vardy and Be'ery's Decomposition
- Reliability-Based Soft-Decision Decoding With Multiple Biases
- Two new decoding algorithms for Reed-Solomon codes
This page was built for publication: Bounded distance+1 soft-decision Reed-Solomon decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887052)