1998
DOI: 10.1109/26.701302
|View full text |Cite
|
Sign up to set email alerts
|

Decoder error and failure probabilities for Reed-Solomon codes: decodable vectors method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0
1

Year Published

1999
1999
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(3 citation statements)
references
References 2 publications
0
2
0
1
Order By: Relevance
“…We say that a decoding error exists if the Hamming distance between the received codeword and any other codeword is less than or equal to d o , i.e., if we decode it erroneously. Further, we say that a decoding failure exists if the Hamming distance between the received codeword and all the other codewords is more than d o , i.e., if the received codeword is not decodable [32].…”
Section: Preliminaries In Error Correction Codingmentioning
confidence: 99%
“…We say that a decoding error exists if the Hamming distance between the received codeword and any other codeword is less than or equal to d o , i.e., if we decode it erroneously. Further, we say that a decoding failure exists if the Hamming distance between the received codeword and all the other codewords is more than d o , i.e., if the received codeword is not decodable [32].…”
Section: Preliminaries In Error Correction Codingmentioning
confidence: 99%
“…A simulação deste tipo de decodificador foi realizada mediante as probabilidades de erro e de falha de decodificação de uma palavra. Estas probabilidades são obtidas pela quantidade total de vetores e pela quantidade de vetores decodificáveis [18].…”
Section: O Decodificadorunclassified
“…Given the two densities and , the probability errors ( is equal to the number of guessed erasures within the first measures) can be evaluated by errors (6) This completes the evaluation of (3) errors (7) where errors is clearly equal to zero for . The final formula is (8) Comparing (8) with (2), it is easy to see that the factor of gain is due to the term (lower than 1) that multiplies the probabilities of input errors from to .…”
Section: A Performance Estimationmentioning
confidence: 99%