Bounded distance+1 soft-decision Reed-Solomon decoding
From MaRDI portal
Publication:4887052
DOI10.1109/18.490539zbMATH Open0860.94032OpenAlexW2168932491MaRDI QIDQ4887052FDOQ4887052
Authors: Elwyn R. Berlekamp
Publication date: 28 April 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.490539
Recommendations
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Decoding (94B35)
Cited In (18)
- Soft Distance Metric Decoding of Polar Codes
- Decoding interleaved Reed-Solomon codes over noisy channels
- Title not available (Why is that?)
- Reconstructing Algebraic Functions from Mixed Data
- Simplified correlation decoding by selecting possible codewords using erasure information (Corresp.)
- The non-gap sequence of a subcode of a generalized Reed-Solomon code
- A novel approach to soft decision decoding of threshold decodable codes (Corresp.)
- Quasioptimal methods of correlational reception of Reed-Solomon codes
- A Decoding Approach to Reed–Solomon Codes from Their Definition
- 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
- On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications
- An efficient soft-decision Reed-Solomon decoding algorithm
- Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm
- Computing Upper Bounds to Error Probability of Soft-Decision Decoding of Reed–Solomon Codes Based on the Ordered Statistics Algorithm
- Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft Information
- An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding
- 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)