Jonathan Detchart
University of Toulouse
12 Papers
16 Citations
Jonathan Detchart is an academic researcher from University of Toulouse. The author has contributed to research in topics: Erasure code & Finite field. The author has an hindex of 3, co-authored 10 publications. Previous affiliations of Jonathan Detchart include French Institute for Research in Computer Science and Automation.
Chat about Author
Papers
Erasure Code-Based Low Storage Blockchain Node
Doriane Perard,Jérôme Lacan,Yann Bachy,Jonathan Detchart +3 more
- 01 Jul 2018
TL;DR: In this article, the authors propose new low storage nodes that store a reduced amount of data generated from the blockchain by using erasure codes, which can be easily rebuilt from a small number of such nodes.
RS + LDPC-Staircase codes for the erasure channel: Standards, usage and performance
Vincent Roca,Mathieu Cunche,Cédric Thienot,Jonathan Detchart,Jérôme Lacan +4 more
- 01 Oct 2013
TL;DR: R Reed-Solomon/LDPC-Staircase codes are introduced, two complementary AL-FEC codes that have recently been recognized as superior to Raptor codes in the context of the 3GPP-eMBMS call for technology.
16
Modular zk-Rollup On-Demand
TL;DR: In this paper , the authors propose an innovative design that allows multiple zk-rollups to coexist on the same smart contracts, simplifying their creation and customization, and evaluate the first implementation of their system highlighting a low overhead on existing transaction types and on proof generation while strongly decreasing the cost of new transaction types.
•Posted Content
Fast Xor-based Erasure Coding based on Polynomial Ring Transforms
Jonathan Detchart,Jérôme Lacan +1 more
TL;DR: This paper proposes 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, and shows that moving to a ring reduces the complexity.
2
FEC4Cloud: a research project promoting erasure coding for Cloud storage architectures
Benoît Parrein,Jérôme Lacan,Nicolas Normand,Dimitri Pertin,Jonathan Detchart,Alexandre van Kempen +5 more
- 01 May 2015
TL;DR: This talk will demonstrate (practically) that some erasure code can be used both for cold and hot data accesses in fault-tolerant Cloud storage architectures, and provide a comparison with coding schemes of Reed-Solomon codes and with a last update of results presented in [2] that brings a huge advantage to discrete geometric approaches.
1