Timeline for How can I decode efficiently a triple-error-correcting binary BCH code?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 16, 2015 at 12:53 | history | edited | Stefan Kohl♦ | CC BY-SA 3.0 |
Added tags.
|
| May 16, 2014 at 19:11 | comment | added | Jyrki Lahtonen | If there is a single error, then $S_1$ gives the error position. Need to think about the other cases. I suspect that you can find the error locator polynomial in those cases. But solving the quadratic equation (provided it has the required solutions) needs the half-trace, and solving a cubic is even more cumbersome. It is also possible that more than three errors occured. Therefore I am leaning towards keeping the Chien search, as it will catch those occasions, where we have the error locator, but it does not have required zeros. | |
| S May 16, 2014 at 19:10 | history | edited | Arturo Magidin | CC BY-SA 3.0 |
Some TeXifying
|
| S May 16, 2014 at 19:10 | history | suggested | Jyrki Lahtonen | CC BY-SA 3.0 |
Some TeXifying
|
| May 16, 2014 at 19:10 | review | Suggested edits | |||
| S May 16, 2014 at 19:10 | |||||
| Apr 22, 2014 at 19:11 | history | asked | Dimitri | CC BY-SA 3.0 |