Package - gf-complete-tools

Package: gf-complete-tools
apt-get install gf-complete-tools

Documentations in package:

Primary informations

Property	Value
Package	gf-complete-tools
Source	gf-complete
Version	1.0.2+2017.04.10.git.ea75cdf-10~bpo13+1
Architecture	amd64
Maintainer	Debian OpenStack
Installed-Size	144
Depends	libgf-complete1t64 (= 1.0.2+2017.04.10.git.ea75cdf-10~bpo13+1), libc6 (>= 2.34)
Filename	pool/trixie-flamingo-backports/main/g/gf-complete/gf-complete-tools_1.0.2+2017.04.10.git.ea75cdf-10~bpo13+1_amd64.deb
Size	21612
MD5sum	409aecb75080622a427144f0588e1388
SHA1	c12c056039171e7d5c4d83113735f4eeecd019ed
SHA256	f4e5615acb98758230598dbbf35b066fa5e1b93f216dca9d7d4d417d36ef1534
Section	math
Priority	optional
Homepage	http://jerasure.org/
Description	Galois Field Arithmetic - tools 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 miscellaneous tools for working with gf-complete.
Description-md5