Detchart, Jonathan
and Lacan, Jérôme
Polynomial Ring Transforms for Efficient XOR-based Erasure Coding.
(2017)
In: IEEE International Symposium on Information Theory (ISIT 2017), 25 June 2017 - 30 June 2017 (Aachen, Germany).
|
(Document in English)
PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 238kB |
Official URL: http://dx.doi.org/10.1109/ISIT.2017.8006599
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
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | Thanks to the IEEE (Institute of Electrical and Electronics Engineers). This paper is available at : http://ieeexplore.ieee.org/document/8006599/?reload=true “© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
| HAL Id: | hal-01697211 |
| Audience (conference): | International conference proceedings |
| Uncontrolled Keywords: | |
| Institution: | Université de Toulouse > Institut Supérieur de l'Aéronautique et de l'Espace - ISAE-SUPAERO (FRANCE) |
| Laboratory name: | |
| Statistics: | download |
| Deposited By: | Jérôme Lacan |
| Deposited On: | 24 Jan 2018 10:34 |
Repository Staff Only: item control page
