Пакет: gf-complete-tools (1.0.2+2017.04.10.git.ea75cdf-3)
Връзки за gf-complete-tools
Ресурси за Trisquel:
Изтегляне на пакет-източник gf-complete.
- [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]
Отговорник:
Original Maintainers:
- Debian OpenStack
- Thomas Goirand
- Shengjing Zhu
Външни препратки:
- Начална страница [jerasure.org]
Подобни пакети:
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.
Други пакети, свързани с gf-complete-tools
|
|
|
-
- dep: libc6 (>= 2.14) [amd64]
- GNU C Library: Shared libraries
също и виртуален пакет, предлаган от libc6-udeb
- dep: libc6 (>= 2.7) [armhf]
-
- dep: libgf-complete1 (= 1.0.2+2017.04.10.git.ea75cdf-3)
- Galois Field Arithmetic - shared library
Изтегляне на gf-complete-tools
| Архитектура | Големина на пакета | Големина след инсталиране | Файлове |
|---|---|---|---|
| amd64 | 21,5 кБ | 113 кБ | [списък на файловете] |
| armhf | 19,2 кБ | 84 кБ | [списък на файловете] |