How to Install and Uninstall libgf-complete1 Package on Ubuntu 21.10 (Impish Indri)
Last updated: December 23,2024
1. Install "libgf-complete1" package
This is a short guide on how to install libgf-complete1 on Ubuntu 21.10 (Impish Indri)
$
sudo apt update
Copied
$
sudo apt install
libgf-complete1
Copied
2. Uninstall "libgf-complete1" package
Learn how to uninstall libgf-complete1 on Ubuntu 21.10 (Impish Indri):
$
sudo apt remove
libgf-complete1
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libgf-complete1 package on Ubuntu 21.10 (Impish Indri)
Package: libgf-complete1
Architecture: amd64
Version: 1.0.2+2017.04.10.git.ea75cdf-3build1
Multi-Arch: same
Priority: extra
Section: libs
Source: gf-complete
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian OpenStack
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 195
Depends: libc6 (>= 2.14)
Filename: pool/main/g/gf-complete/libgf-complete1_1.0.2+2017.04.10.git.ea75cdf-3build1_amd64.deb
Size: 69816
MD5sum: c81d5a06baa0e9bfd8645efba1d94715
SHA1: 5db2b766768bb2a9adfb16816fc61f323af9ea60
SHA256: 743178396ff604107f20e406ec4d95064226f39a67f8f4b4a72d2f36ea1364c4
SHA512: 8fb3991be0aee53b2783359eb94f7b6458e4233ec364fb390cfa75d8cc7ad8dcd8becb97feb05fc0ec86381e9a34fdc1a90fd35636dd51fe1bdd48d69475833c
Homepage: http://jerasure.org/
Description-en: 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(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 the shared library.
Description-md5: c7ded48be9d1d80e5d0262e62078b9e1
Architecture: amd64
Version: 1.0.2+2017.04.10.git.ea75cdf-3build1
Multi-Arch: same
Priority: extra
Section: libs
Source: gf-complete
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian OpenStack
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 195
Depends: libc6 (>= 2.14)
Filename: pool/main/g/gf-complete/libgf-complete1_1.0.2+2017.04.10.git.ea75cdf-3build1_amd64.deb
Size: 69816
MD5sum: c81d5a06baa0e9bfd8645efba1d94715
SHA1: 5db2b766768bb2a9adfb16816fc61f323af9ea60
SHA256: 743178396ff604107f20e406ec4d95064226f39a67f8f4b4a72d2f36ea1364c4
SHA512: 8fb3991be0aee53b2783359eb94f7b6458e4233ec364fb390cfa75d8cc7ad8dcd8becb97feb05fc0ec86381e9a34fdc1a90fd35636dd51fe1bdd48d69475833c
Homepage: http://jerasure.org/
Description-en: 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(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 the shared library.
Description-md5: c7ded48be9d1d80e5d0262e62078b9e1