Package: libgf-complete1t64
Source: gf-complete
Version: 1.0.2+2017.04.10.git.ea75cdf-10
Architecture: arm64
Maintainer: Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
Original-Maintainer: Debian OpenStack <team+openstack@tracker.debian.org>
Installed-Size: 217
Depends: libc6 (>= 2.38)
Breaks: libgf-complete1 (<< 1.0.2+2017.04.10.git.ea75cdf-10)
Replaces: libgf-complete1
Provides: libgf-complete1 (= 1.0.2+2017.04.10.git.ea75cdf-10)
Section: libs
Priority: optional
Multi-Arch: same
Homepage: http://jerasure.org/
Description: Galois Field Arithmetic - shared library
 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(2^w). As such, the elements of a Galois Field are
 the integers 0, 1, . . ., 2^w − 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.
 .
 This package contains the shared library.
