How to Install and Uninstall libgf-complete1 Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: December 23,2024

1. Install "libgf-complete1" package

Please follow the instructions below to install libgf-complete1 on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libgf-complete1
            
                    
    
    Copied

2. Uninstall "libgf-complete1" package

Please follow the guidelines below to uninstall libgf-complete1 on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libgf-complete1
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libgf-complete1 package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: libgf-complete1
Priority: extra
Section: libs
Installed-Size: 205
Maintainer: Ubuntu Developers
Original-Maintainer: Thomas Goirand
Architecture: amd64
Source: gf-complete
Version: 1.0.2-2
Depends: libc6 (>= 2.14)
Filename: pool/main/g/gf-complete/libgf-complete1_1.0.2-2_amd64.deb
Size: 64468
MD5sum: 46f0eb66ae2d3044766d308adc1f85a0
SHA1: 85b2d81666fe263616d5e03cf5a884ae8d242be6
SHA256: efc9af586bcc9faa2731f0010d208ee61ef81d4b26906fe5d545e37d007195f2
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
Multi-Arch: same
Homepage: http://jerasure.org/
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu
Supported: 5y