| Package | libgf-complete-dev |
| Source | gf-complete |
| Version | 1.0.2+2017.04.10.git.ea75cdf-9~bpo11+1 |
| Architecture | amd64 |
| Maintainer | Debian OpenStack |
| Installed-Size | 27 |
| Depends | libgf-complete1 (= 1.0.2+2017.04.10.git.ea75cdf-9~bpo11+1) |
| Filename | pool/bullseye-zed-backports/main/g/gf-complete/libgf-complete-dev_1.0.2+2017.04.10.git.ea75cdf-9~bpo11+1_amd64.deb |
| Size | 7560 |
| MD5sum | 2c6139c15be0605c276ede33347878a9 |
| SHA1 | 0c35b837828dc207fc6e1a8c508935290d539af6 |
| SHA256 | 3ec9d050ee429ee75226e11f60ac68a7600a5c0b7f366a949ac4afbacd2a3e74 |
| Section | libdevel |
| Priority | optional |
| Multi-Arch | same |
| Homepage | http://jerasure.org/ |
| Description | Galois Field Arithmetic - development files
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 development files needed to build against the shared
library. |
| Description-md5 | |