gf-complete 1.0.2+2017.04.10.git.ea75cdf-9.1build1 source package in Ubuntu
Changelog
gf-complete (1.0.2+2017.04.10.git.ea75cdf-9.1build1) noble; urgency=medium * No-change rebuild for CVE-2024-3094 -- Steve Langasek <email address hidden> Sun, 31 Mar 2024 05:43:21 +0000
Upload details
- Uploaded by:
- Steve Langasek
- Uploaded to:
- Noble
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Oracular | release | main | misc | |
Noble | release | main | misc |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
gf-complete_1.0.2+2017.04.10.git.ea75cdf.orig.tar.xz | 289.0 KiB | 6a11e814556bda953c59510e893763bafafd346e05995c3c0fc6c0153c220069 |
gf-complete_1.0.2+2017.04.10.git.ea75cdf-9.1build1.debian.tar.xz | 5.2 KiB | 36b67d496c731c80c6488a702352f65fe5e6447b89b3d0215b6c88a4edd9fada |
gf-complete_1.0.2+2017.04.10.git.ea75cdf-9.1build1.dsc | 2.4 KiB | 6791b233b0088f8fa438a4bd52025b310d5f25a92a360a00ef37455abf02c935 |
Available diffs
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(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 miscellaneous tools for working with gf-complete.
- gf-complete-tools-dbgsym: debug symbols for gf-complete-tools
- 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(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 development files needed to build against the shared
library.
- libgf-complete1t64: 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.
- libgf-complete1t64-dbgsym: debug symbols for libgf-complete1t64