Package - libgf-complete1
Primary informations
Download package: http://osbpo.debian.net/debian/pool/bullseye-zed-backports/main/g/gf-complete/libgf-complete1_1.0.2+2017.04.10.git.ea75cdf-9~bpo11+1_amd64.deb (Size: 58.2KiB)| Property | Value |
|---|---|
| Package | libgf-complete1 |
| Source | gf-complete |
| Version | 1.0.2+2017.04.10.git.ea75cdf-9~bpo11+1 |
| Architecture | amd64 |
| Maintainer | Debian OpenStack |
| Installed-Size | 187 |
| Depends | libc6 (>= 2.14) |
| Filename | pool/bullseye-zed-backports/main/g/gf-complete/libgf-complete1_1.0.2+2017.04.10.git.ea75cdf-9~bpo11+1_amd64.deb |
| Size | 59548 |
| MD5sum | b5dfe0cceac27b9f4dac8ebafa7d0e35 |
| SHA1 | 2f47121db62caf2be4817d1627e306740cedb013 |
| SHA256 | 4def052c4523f5d809b523c00091850b5e7b73e642f6b152570cdbaf8fab93b1 |
| 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 |