Skip to Main content Skip to Navigation

Polynomial Ring Transforms for Efficient XOR-based Erasure Coding

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 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
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01697211
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Wednesday, January 31, 2018 - 9:49:04 AM
Last modification on : Thursday, February 1, 2018 - 9:58:49 AM
Document(s) archivé(s) le : Tuesday, May 1, 2018 - 1:08:52 PM

File

Detchart_18723.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01697211, version 1
  • OATAO : 18723

Citation

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⟩

Share

Metrics

Record views

68

Files downloads

181