libgf-complete1t64 - 1.0.2+2017.04.10.git.ea75cdf-9.1+b1 main

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.

Priority: optional
Section: libs
Suites: dawn landing 
Maintainer: Debian OpenStack <team+openstack [꩜] tracker.debian.org>
 
Homepage Source Package
 

Dependencies

Installed Size: 157.7 kB
Architectures: amd64  arm64 

 

Versions

1.0.2+2017.04.10.git.ea75cdf-9.1+b1 arm64 1.0.2+2017.04.10.git.ea75cdf-9.1+b1 amd64 1.0.2+2017.04.10.git.ea75cdf-9.1 arm64 1.0.2+2017.04.10.git.ea75cdf-9.1 amd64