Skip to Main content Skip to Navigation
Conference papers

Improving the Coding Speed of Erasure Codes with Polynomial Ring Transforms

Abstract : Erasure codes are widely used in today’s storage systems to cope with failures. Most of them use the finite field arithmetic. In this paper, we propose an implementation and a coding speed evaluation of an original method called PYRIT (PolYnomial RIng Transform) to perform operations between elements of a finite field into a bigger ring by using fast transforms between these two structures. Working in such a ring is much easier than working in a finite field. Firstly, it reduces the coding complexity by design. Secondly, it allows simple but efficient xor-based implementations by unrolling the operations thanks to the properties of the ring structure. We evaluate this proposition for Maximum Distance Separable erasure codes and we show that our method has better performances than common codes. Compared to the best known implementations, the coding speeds are increased by a factor varying from 1.5 to 2.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01904733
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Thursday, October 25, 2018 - 11:40:40 AM
Last modification on : Monday, November 5, 2018 - 10:40:16 AM
Long-term archiving on: : Saturday, January 26, 2019 - 1:41:30 PM

File

Detchart_20962.pdf
Files produced by the author(s)

Identifiers

Citation

Jonathan Detchart, Jérôme Lacan. Improving the Coding Speed of Erasure Codes with Polynomial Ring Transforms. GLOBECOM 2017 - 2017 IEEE Global Communications Conference, Dec 2017, Singapour, Singapore. pp.1-6, ⟨10.1109/GLOCOM.2017.8255009⟩. ⟨hal-01904733⟩

Share

Metrics

Record views

72

Files downloads

339