On the decoder error probability for Reed - Solomon codes (Corresp.)
From MaRDI portal
Publication:3757830
DOI10.1109/TIT.1986.1057212zbMATH Open0619.94018OpenAlexW2047150880MaRDI QIDQ3757830FDOQ3757830
Authors: Laif Swanson, Robert J. McEliece 
Publication date: 1986
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1986.1057212
Recommendations
Cited In (16)
- Decoding of Reed-Muller codes with a large number of errors
- An Integrated ECC-MAC Based on RS Code
- Title not available (Why is that?)
- Error probabilities for bounded distance decoding
- On decoding by error location and dependent sets of error positions
- Power Decoding of Reed–Solomon Codes Revisited
- On the decoder error probability of block codes
- The non-gap sequence of a subcode of a generalized Reed-Solomon code
- Title not available (Why is that?)
- On the Probability of Undetected Error for Overextended Reed–Solomon Codes
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- On the relation between the code spectrum and the decoding error probability
- Exponential Error Bounds for Algebraic Soft-Decision Decoding of Reed–Solomon Codes
- More on the decoder error probability for Reed-Solomon codes
- Title not available (Why is that?)
This page was built for publication: On the decoder error probability for Reed - Solomon codes (Corresp.)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757830)
