Paketti: libgf-complete-dev (1.0.2+2017.04.10.git.ea75cdf-9)
Links for libgf-complete-dev
Debian-palvelut:
Imuroi lähdekoodipaketti gf-complete:
- [gf-complete_1.0.2+2017.04.10.git.ea75cdf-9.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.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 - 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.
Muut pakettiin libgf-complete-dev liittyvät paketit
|
|
|
|
-
- dep: libgf-complete1 (= 1.0.2+2017.04.10.git.ea75cdf-9)
- Galois Field Arithmetic - shared library
Imuroi libgf-complete-dev
Arkkitehtuuri | Paketin koko | Koko asennettuna | Tiedostot |
---|---|---|---|
armel | 6.3 kt | 26.0 kt | [tiedostoluettelo] |