Ubuntu
gf-complete package

gf-complete 1.0.2-2build1 source package in Ubuntu

Changelog

gf-complete (1.0.2-2build1) bionic; urgency=high

  * No change rebuild to pick up -fPIE compiler default

 -- Balint Reczey <email address hidden>  Tue, 03 Apr 2018 12:25:02 +0000

Upload details

Uploaded by:
Balint Reczey
Uploaded to:
Bionic
Original maintainer:
Ubuntu Developers
Architectures:
any
Section:
misc
Urgency:
Very Urgent

See full publishing history Publishing

Series Pocket Published Component Section
Bionic release main misc

Downloads

File Size SHA-256 Checksum
gf-complete_1.0.2.orig.tar.xz 275.0 KiB c16e9ef092576017b886eb3d2e1abebc5ebddb21c7edb6c931bbf2c093c7206b
gf-complete_1.0.2-2build1.debian.tar.xz 4.2 KiB eb5e8cb1b1a6901575f1de20f2f4fe8599e5ea6551fd2b7357100b755a00b118
gf-complete_1.0.2-2build1.dsc 2.1 KiB 730f5f5c0c97cc9e1e45f1eb217349d8c575675df86af3e6cd9e9ff25b58625d

View changes file

Binary packages built by this source

gf-complete-tools: Galois Field Arithmetic - tools

 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 miscellaneous tools for working with gf-complete.

gf-complete-tools-dbgsym: No summary available for gf-complete-tools-dbgsym in ubuntu cosmic.

No description available for gf-complete-tools-dbgsym in ubuntu cosmic.

libgf-complete-dev: Galois Field Arithmetic - development files

 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 development files needed to build against the shared
 library.

libgf-complete1: 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.

libgf-complete1-dbgsym: debug symbols for libgf-complete1