2017/01/26 by Jonathan Detchart, Detchart, Jonathan, Jérôme Lacan +1
Computer Science · #Advanced Data Storage Technologies #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1701.07731
openalex publication_date 2017/01/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.