Package - libgf-complete1t64

Package: libgf-complete1t64
apt-get install libgf-complete1t64

Documentations in package:

Primary informations

Property	Value
Package	libgf-complete1t64
Source	gf-complete
Version	1.0.2+2017.04.10.git.ea75cdf-10~bpo13+1
Architecture	amd64
Maintainer	Debian OpenStack
Installed-Size	194
Depends	libc6 (>= 2.14)
Breaks	libgf-complete1 (<< 1.0.2+2017.04.10.git.ea75cdf-10~bpo13+1)
Replaces	libgf-complete1
Provides	libgf-complete1 (= 1.0.2+2017.04.10.git.ea75cdf-10~bpo13+1)
Filename	pool/trixie-flamingo-backports/main/g/gf-complete/libgf-complete1t64_1.0.2+2017.04.10.git.ea75cdf-10~bpo13+1_amd64.deb
Size	60004
MD5sum	b3461ed1bfa3f6b18c14382ce8612434
SHA1	a11b859599c34fd627ee3d8dbb814679294971be
SHA256	6a2237e8b55508d30b6af364a0e82c74e41dda4209d943a72b7233fcb0d64a7c
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.
Description-md5