Paketti: gf-complete-tools (1.0.2+2017.04.10.git.ea75cdf-9.1 ja muut)
Links for gf-complete-tools
Debian-palvelut:
Imuroi lähdekoodipaketti gf-complete:
- [gf-complete_1.0.2+2017.04.10.git.ea75cdf-9.1.dsc]
- [gf-complete_1.0.2+2017.04.10.git.ea75cdf.orig.tar.xz]
- [gf-complete_1.0.2+2017.04.10.git.ea75cdf-9.1.debian.tar.xz]
Ylläpitäjät:
- Debian OpenStack (Laadunvalvontasivu)
- Thomas Goirand (Laadunvalvontasivu)
- Shengjing Zhu (Laadunvalvontasivu)
External Resources:
- Kotisivu [jerasure.org]
Samankaltaisia paketteja:
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.
Muut pakettiin gf-complete-tools liittyvät paketit
|
|
|
|
-
- dep: libc6 (>= 2.34)
- GNU-C-kirjasto: jaetut kirjastot
myös näennäispaketti, jonka toteuttaa libc6-udeb
-
- dep: libgf-complete1t64 (= 1.0.2+2017.04.10.git.ea75cdf-9.1+b1)
- Galois Field Arithmetic - shared library
Imuroi gf-complete-tools
Arkkitehtuuri | Versio | Paketin koko | Koko asennettuna | Tiedostot |
---|---|---|---|---|
amd64 | 1.0.2+2017.04.10.git.ea75cdf-9.1+b1 | 21.2 kt | 144.0 kt | [tiedostoluettelo] |