libgf-complete1 binary package in Ubuntu Jammy arm64
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.
Publishing history
Date | Status | Target | Component | Section | Priority | Phased updates | Version | ||
---|---|---|---|---|---|---|---|---|---|
2022-03-28 14:25:02 UTC | Published | Ubuntu Jammy arm64 | release | main | libs | Extra | 1.0.2+2017.04.10.git.ea75cdf-7build1 | ||
|
|||||||||
Deleted | Ubuntu Jammy arm64 | proposed | main | libs | Extra | 1.0.2+2017.04.10.git.ea75cdf-7build1 | |||
|
|||||||||
2022-03-28 14:26:32 UTC | Superseded | Ubuntu Jammy arm64 | release | main | libs | Extra | 1.0.2+2017.04.10.git.ea75cdf-7 | ||
|
|||||||||
2022-03-29 18:10:09 UTC | Deleted | Ubuntu Jammy arm64 | proposed | main | libs | Extra | 1.0.2+2017.04.10.git.ea75cdf-7 | ||
|
|||||||||
2021-12-30 18:53:51 UTC | Superseded | Ubuntu Jammy arm64 | release | main | libs | Extra | 1.0.2+2017.04.10.git.ea75cdf-6 | ||
|
|||||||||
2022-01-01 00:10:08 UTC | Deleted | Ubuntu Jammy arm64 | proposed | main | libs | Extra | 1.0.2+2017.04.10.git.ea75cdf-6 | ||
|
|||||||||
2021-11-18 17:44:22 UTC | Superseded | Ubuntu Jammy arm64 | proposed | main | libs | Extra | 1.0.2+2017.04.10.git.ea75cdf-5 | ||
|
|||||||||
2021-11-18 19:48:06 UTC | Superseded | Ubuntu Jammy arm64 | release | main | libs | Extra | 1.0.2+2017.04.10.git.ea75cdf-3build1 | ||
|