Fast Xor-based Erasure Coding based on Polynomial Ring Transforms
Information Theory
2017-06-14 v2 math.IT
Abstract
The complexity of software implementations of MDS erasure codes mainly depends on the efficiency of the finite field operations implementation. In this paper, we propose a method to reduce the complexity of the finite field multiplication by using fast transforms between a field and a ring to perform the multiplication in a ring. We show that moving to a ring reduces the complexity of the operations. Then, we show that this construction allows the use of simple scheduling to reduce the number of operations.
Keywords
Cite
@article{arxiv.1701.07731,
title = {Fast Xor-based Erasure Coding based on Polynomial Ring Transforms},
author = {Jonathan Detchart and Jérôme Lacan},
journal= {arXiv preprint arXiv:1701.07731},
year = {2017}
}