| Package | gf-complete-tools |
| Source | gf-complete |
| Version | 1.0.2+2017.04.10.git.ea75cdf-9~bpo11+1 |
| Architecture | amd64 |
| Maintainer | Debian OpenStack |
| Installed-Size | 144 |
| Depends | libgf-complete1 (= 1.0.2+2017.04.10.git.ea75cdf-9~bpo11+1), libc6 (>= 2.14) |
| Filename | pool/bullseye-zed-backports/main/g/gf-complete/gf-complete-tools_1.0.2+2017.04.10.git.ea75cdf-9~bpo11+1_amd64.deb |
| Size | 22608 |
| MD5sum | fd73885be064a2bd814d2759d21d9048 |
| SHA1 | aba231b6ffc1769aaff84775750f193faf3ab4eb |
| SHA256 | 754786dc1ee2533f2bc71ef74c20e482fd531a1cb42a29267e35e89005c65477 |
| 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 | |