Binary package “libgf-complete1” in ubuntu jammy
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.
Published versions
- libgf-complete1 1.0.2+2017.04.10.git.ea75cdf-7build1 in amd64 (Proposed)
- libgf-complete1 1.0.2+2017.04.10.git.ea75cdf-7build1 in amd64 (Release)
- libgf-complete1 1.0.2+2017.04.10.git.ea75cdf-7build1 in arm64 (Proposed)
- libgf-complete1 1.0.2+2017.04.10.git.ea75cdf-7build1 in arm64 (Release)
- libgf-complete1 1.0.2+2017.04.10.git.ea75cdf-7build1 in armhf (Proposed)
- libgf-complete1 1.0.2+2017.04.10.git.ea75cdf-7build1 in armhf (Release)
- libgf-complete1 1.0.2+2017.04.10.git.ea75cdf-7build1 in ppc64el (Proposed)
- libgf-complete1 1.0.2+2017.04.10.git.ea75cdf-7build1 in ppc64el (Release)
- libgf-complete1 1.0.2+2017.04.10.git.ea75cdf-7build1 in riscv64 (Proposed)
- libgf-complete1 1.0.2+2017.04.10.git.ea75cdf-7build1 in riscv64 (Release)
- libgf-complete1 1.0.2+2017.04.10.git.ea75cdf-7build1 in s390x (Proposed)
- libgf-complete1 1.0.2+2017.04.10.git.ea75cdf-7build1 in s390x (Release)