scientific article; zbMATH DE number 4021023
From MaRDI portal
Publication:3764058
Recommendations
- On the computation of the performance probabilities for block codes with a bounded-distance decoding rule
- Advances in the performance of Reed-Solomon codes
- More on the decoder error probability for Reed-Solomon codes
- On the decoder error probability for Reed - Solomon codes (Corresp.)
- Computing Upper Bounds to Error Probability of Soft-Decision Decoding of Reed–Solomon Codes Based on the Ordered Statistics Algorithm
Cited in
(9)- Advances in the performance of Reed-Solomon codes
- scientific article; zbMATH DE number 4057436 (Why is no real title available?)
- scientific article; zbMATH DE number 2081153 (Why is no real title available?)
- A Lloyd theorem in weakly metric association schemes
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- Information-bit error rate and false positives in an MDS code
- More on the decoder error probability for Reed-Solomon codes
- On the computation of the performance probabilities for block codes with a bounded-distance decoding rule
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3764058)