Пакунок: gf-complete-tools (1.0.2+2017.04.10.git.ea75cdf-3 and others)

[ Source: 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(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.

Tags: Role: Shared Library

Інші пакунки пов'язані з gf-complete-tools

• dep: libc6 (>= 2.7)

  Бібліотека GNU C: спільні бібліотеки
  also a virtual package provided by libc6-udeb

• dep: libgf-complete1 (= 1.0.2+2017.04.10.git.ea75cdf-3+b1)

  Galois Field Arithmetic - shared library

Завантажити gf-complete-tools

Завантаження для всіх доступних архітектур

Архітектура	Версія	Розмір пакунка	Розмір після встановлення	Файли
armel	1.0.2+2017.04.10.git.ea75cdf-3+b1	21.4 kB	89.0 kB	[список файлів]