Package: libgf-complete1t64 (1.0.2+2017.04.10.git.ea75cdf-9.1 and others)

[ Source: gf-complete  ]

Galois Field Arithmetic - shared library

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 shared library.

Other Packages Related to libgf-complete1t64

• dep: libc6 (>= 2.14)

  GNU C könyvtár: megosztott könyvtárak
  also a virtual package provided by libc6-udeb

Download libgf-complete1t64

Download for all available architectures

Architecture	Version	Package Size	Installed Size	Files
amd64	1.0.2+2017.04.10.git.ea75cdf-9.1+b1	58.7 kB	194.0 kB	[list of files]