All Questions
1 question with no upvoted or accepted answers
1
vote
0
answers
228
views
How can I decode efficiently a triple-error-correcting binary BCH code?
In a given $\mathrm{BCH}(N,K)$, $T=3$ code over $\mathrm{GF}(2^m)$, there are ways to find the error locations in a given $N$-bit codeword directly from the syndromes without going through the normal ...
- 87