deb_control_files:
- control
- md5sums
deb_fields:
Architecture: amd64
Depends: libgf-complete1t64 (= 1.0.2+2017.04.10.git.ea75cdf-9.1+b1), libc6 (>= 2.34)
Description: "Galois Field Arithmetic - tools\n Galois Field arithmetic forms the\
\ backbone of erasure-coded storage systems,\n most famously the Reed-Solomon\
\ erasure code. A Galois Field is defined over\n w-bit words and is termed GF(2^w).\
\ As such, the elements of a Galois Field are\n the integers 0, 1, . . ., 2^w\
\ \u2212 1. Galois Field arithmetic defines addition\n and multiplication over\
\ these closed sets of integers in such a way that they\n work as you would hope\
\ they would work. Specifically, every number has a\n unique multiplicative inverse.\
\ Moreover, there is a value, typically the value\n 2, which has the property\
\ that you can enumerate all of the non-zero elements\n of the field by taking\
\ that value to successively higher powers.\n .\n This package contains miscellaneous\
\ tools for working with gf-complete."
Homepage: http://jerasure.org/
Installed-Size: '144'
Maintainer: Debian OpenStack <team+openstack@tracker.debian.org>
Package: gf-complete-tools
Priority: optional
Section: math
Source: gf-complete (1.0.2+2017.04.10.git.ea75cdf-9.1)
Version: 1.0.2+2017.04.10.git.ea75cdf-9.1+b1
srcpkg_name: gf-complete
srcpkg_version: 1.0.2+2017.04.10.git.ea75cdf-9.1