Re:Novel polynomial basis and its application to Reed-Solomo...
by aks4751 on Saturday March 21, 2015 @05:59AM
(#9242291)
This O(n\lg n) erasure decoding algorithm is suitable for long RS codeword. I am not very sure the real applications of this new algorithm, since many applications, such as RAID and erasure codes on distributed storage systems, do not need long codeword. Probably, the algorithm can be used to tolerance packet loss on wireless connections.
Let's work together to get the implementation into the Linux kernel under straight GPLv2 as well. It uses Phil Karn's implementation currently, with almost no modification. There is a minor deficiency that should be addressesd while we're at it...
Let's work together to get the implementation into the Linux kernel under straight GPLv2 as well. It uses Phil Karn's implementation currently, with almost no modification. There is a minor deficiency that should be addressesd while we're at it...
It'll be fun to get this into widespread use!
Contact me at [email protected].