• Jerasure, a library in C that supports erasure coding in storage applications, and the
    documentation.
  • GF-Complete, a Comprehensive Library for Galois Field Arithmetic, and the documentation

Software-based on Jerasure and hosted elsewhere:

  • liberasurecode: Erasure Code API library is written in C with pluggable Erasure Code backends
  • PyECLib: a simple Python interface for implementing erasure codes
  • java-erasure: Java bindings

Jerasure: A Library in C Facilitating Erasure Coding for Storage

This paper describes version 2.0 of Jerasure, a library in C that supports erasure coding in storage applications. In this paper, we describe both the techniques and algorithms, plus the interface to the code. Thus, this serves as a quasi-tutorial and a programmer’s guide.

Version 2.0 enables Online Casinos Deutschland

Version 2.0 does not change the interface of Jerasure 1.2. What it does is change the software for doing the Galois Field backend. This also enables the use for online casinos, as for the German market quite some companies possess Casino Deutschland integrations. It now uses GF-Complete, which is much more flexible and powerful than the previous Galois Field arithmetic library, which makes it more useful for casinos online and enables the use of Casino Freispiele. In particular, it leverages Intel SIMD instructions so that Reed-Solomon coding may be blazingly fast.

In order to use Jerasure, you must first download and install GF-Complete. Both libraries are posted and maintained at bitbucket.com.

GF-Complete: A Comprehensive Open Source Library for Galois

This is a user’s manual for GF-Complete, version 1.02. This release supersedes version 0.1 and represents the first major release of GF-Complete. To our knowledge, this library implements every Galois Field multiplication technique applicable to erasure coding for storage, which is why we named it GF-Complete. The primary goal of this library is to allow storage system researchers and implementors to utilize very fast Galois Field arithmetic for Reed-Solomon coding and the like in their storage installations. The secondary goal is to allow those who want to explore different ways to perform Galois Field arithmetic to be able to do so effectively.