Pakket: gf-complete-tools (1.0.2+2017.04.10.git.ea75cdf-3)
Verwijzigingen voor gf-complete-tools
Trisquel bronnen:
Het bronpakket gf-complete downloaden:
- [gf-complete_1.0.2+2017.04.10.git.ea75cdf-3.dsc]
- [gf-complete_1.0.2+2017.04.10.git.ea75cdf.orig.tar.xz]
- [gf-complete_1.0.2+2017.04.10.git.ea75cdf-3.debian.tar.xz]
Beheerder:
Original Maintainers:
- Debian OpenStack
- Thomas Goirand
- Shengjing Zhu
Externe bronnen:
- Homepage [jerasure.org]
Vergelijkbare pakketten:
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(2w). 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.
Andere aan gf-complete-tools gerelateerde pakketten
|
|
|
-
- dep: libc6 (>= 2.14) [amd64]
- GNU C Library: Shared libraries
Ook een virtueel pakket geboden door: libc6-udeb
- dep: libc6 (>= 2.7) [armhf]
-
- dep: libgf-complete1 (= 1.0.2+2017.04.10.git.ea75cdf-3)
- Galois Field Arithmetic - shared library