Polynomial Ring Transforms for Efficient XOR-based Erasure Coding

Jonathan Detchart (1) , Jérôme Lacan (1)

1 DISC - Département d'Ingénierie des Systèmes Complexes

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 simple 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

Mots clés: Erasure codes; Finite field

Domaines: Réseaux et télécommunications [cs.NI]

Jonathan Detchart, Jérôme Lacan. Polynomial Ring Transforms for Efficient XOR-based Erasure Coding. IEEE International Symposium on Information Theory (ISIT 2017), Jun 2017, Aachen, Germany. pp. 604-608. ⟨hal-01697211⟩