Cauchy-based Reed-Solomon codes. Available at http://www.icsi.berkeley.edu/~luby.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....standard codes that have been previously proposed for network applications [6, 20, 22, 23, 24, 25] The erasure code listed in Tables 2 and 3 as Cauchy [4] is a standard implementations of Reed Solomon erasure codes based on Cauchy matrices. We note that the Cauchy implementation, available at [8], is faster than the widely cited, publicly available implementation of Reed Solomon codes based on Vandermonde matrices by Rizzo [22] The Tornado Z codes were designed as described in Section 5.2. The implementations were not carefully optimized, so their running times could be improved by ....

Cauchy-based Reed-Solomon codes. Available at http://www.icsi.berkeley.edu/~luby.

....standard codes that have been previously proposed for network applications [6, 20, 22, 23, 24, 25] The erasure code listed in Tables 2 and 3 as Cauchy [4] is a standard implementations of Reed Solomon erasure codes based on Cauchy matrices. We note that the Cauchy implementation, available at [8], is faster for larger values of k than the implementation of Reed Solomon codes based on 2 Notice that this may yield some nodes of degree 0 on the right hand side; however, this happens with small probability, and such nodes can be removed. Also, there may be multiple edges between pairs of ....

Cauchy-based Reed-Solomon codes. Available at http://www.icsi.berkeley.edu/~luby.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC