On 06/06/2014 01:15 AM, 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, The description a decent synopsis of Galois fields, but the package description doesn't say anything at all about what's included in the package. Is it a library, a primer, or perhaps something else? It would be helpful to provide some details about the package before it's uploaded to the archive. Cheers, tony
Attachment:
signature.asc
Description: OpenPGP digital signature