Timeline for On a problem of sphere-packing for Reed-Solomon codes
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2014 at 14:50 | comment | added | Sfarla | Yes, of course I've studied Sudan and Guruswami's work. In fact I'm working on a different algorithm for list decoding and this problem comes up when I try to compare their algorithm with mine. The only problem is that Sudan's algorithm works only provided that $e < n-\sqrt{nk}$ (where $k+1$ is the dimension of the code). Unfortunately for high-rate codes it could happen that $t+1\geq n-\sqrt{nk}$ (e.g. when $n=63, k=50$) | |
| Oct 12, 2014 at 7:26 | comment | added | Jyrki Lahtonen | The first thing I would try (for the case $e=t+1$) is to analyze something like Sudan's list decoding algorithm tuned up for this case. I haven't tried it, and many pitfalls may await. | |
| Sep 24, 2014 at 1:14 | comment | added | JRN | Also asked at math.stackexchange.com/q/943715/18398 | |
| Sep 24, 2014 at 0:55 | history | edited | Sfarla | CC BY-SA 3.0 |
added 168 characters in body
|
| Sep 22, 2014 at 23:48 | history | asked | Sfarla | CC BY-SA 3.0 |