Пакет: gf-complete-tools (1.0.2+2017.04.10.git.ea75cdf-9.1 и други)

[ Източник: gf-complete  ]

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.

Етикети: Role: Shared Library

Други пакети, свързани с gf-complete-tools

• dep: libc6 (>= 2.34)

  GNU C Library: Shared libraries
  също и виртуален пакет, предлаган от libc6-udeb

• dep: libgf-complete1t64 (= 1.0.2+2017.04.10.git.ea75cdf-9.1+b1)

  Galois Field Arithmetic - shared library

Изтегляне на gf-complete-tools

Изтегляне за всички налични архитектури

Архитектура	Версия	Големина на пакета	Големина след инсталиране	Файлове
amd64	1.0.2+2017.04.10.git.ea75cdf-9.1+b1	21,2 кБ	144,0 кБ	[списък на файловете]