News for hackers. Stuff that matters.
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.
Re:Novel polynomial basis and its application to Reed-Solomo... by pjkundert on Saturday March 21, 2015 @11:32AM (#9242993)
I offer a USD$500 bounty for the first C++11 implementation of this algorithm that passes my 'make testex' unit tests in https://github.com/pjkundert/ezpwd-reed-Solomon.git. Copyright transfers to me. Resultant implementation will be dual-licensed: GPLv3 and commercial. (See: http://hardconsulting.com/products/13-reed-solomon)

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].

Re:Novel polynomial basis and its application to Reed-Solomo... by floatingatoll on Saturday March 21, 2015 @12:38PM (#9243229)
Coders, this is a lowball offer for something you retain no ownership of - or right of commercial use or resale - afterwards. Negotiate!
Re:Novel polynomial basis and its application to Reed-Solomo... by evrim on Saturday March 21, 2015 @03:00PM (#9243812)
this is just degree 1 extension K[x] code, do your homework by yourself please.