Leopard-RS : O(N Log N) MDS Reed-Solomon Block Erasure Code for Large Data
Go to file
catid b970dedf9c Update README.md 2017-05-20 22:48:45 -07:00
docs First commit 2017-05-17 20:06:13 -07:00
msvc First commit 2017-05-17 20:06:13 -07:00
.gitignore First commit 2017-05-17 20:06:13 -07:00
README.md Update README.md 2017-05-20 22:48:45 -07:00
lhc_rs.cpp First commit 2017-05-17 20:06:13 -07:00

README.md

Lin-Han-Chung RS Codes

This is an attempt at implementing a fast version of the algorithm described here:

    S.-J. Lin,  T. Y. Al-Naffouri, Y. S. Han, and W.-H. Chung,
    "Novel Polynomial Basis with Fast Fourier Transform and Its Application to Reed-Solomon Erasure Codes"
    IEEE Trans. on Information Theory, pp. 6284-6299, November, 2016.

Available here: http://ct.ee.ntust.edu.tw/it2016-2.pdf