Re: Bug#750713: ITP: gf-complete -- Galois Field Arithmetic
On 06/17/2014 09:55 PM, Andreas Tille wrote:
> On Fri, Jun 06, 2014 at 04:15:48PM +0800, Thomas Goirand wrote:
>> Package: wnpp
>> Severity: wishlist
>> Owner: Thomas Goirand <zigo@debian.org>
>>
>> * Package name : gf-complete
>> Version : 1.02~0+2014.05.git259d53ea590b
>> Upstream Author : Jim Plank <plank@cs.utk.edu>
>> * URL : https://bitbucket.org/jimplank/gf-complete
>> * License : BSD-3-clause
>> Programming Lang: C
>> Description : Galois Field Arithmetic
>>
>> Galois Field arithmetic forms the backbone of erasure-coded storage systems,
>> most famously the Reed-Solomon erasure code. A Galois Field is defined over
>> w-bit words and is termed GF(2w). As such, the elements of a Galois Field are
>> the integers 0, 1, . . ., 2w − 1. Galois Field arithmetic defines addition and
>> multiplication over these closed sets of integers in such a way that they
>> work as you would hope they would work. Specifically, every number has a
>> unique multiplicative inverse. Moreover, there is a value, typically the value
>> 2, which has the property that you can enumerate all of the non-zero elements
>> of the field by taking that value to successively higher powers.
> Hi Thomas,
>
> looks like a nice target to be maintained in Debian Science.
>
> Kind regards
>
> Andreas.
Actually, this is very applied science. It's used by jerasure, which
itself is used by PyECLib, which itself will be used by Swift for doing
storage with erasure support. I believe Ceph already uses Jerasure too.
Which is why I'm packaging all this: this is useful for OpenStack.
Cheers,
Thomas
P.S: This already is waiting in the NEW queue.
Reply to: