gf-complete 1.0.2-1ubuntu1 source package in Ubuntu
Changelog
gf-complete (1.0.2-1ubuntu1) wily; urgency=medium
* Updates for Ubuntu MIR:
- d/control,copyright: Update upstream location to jerasure.org.
- d/rules: Enable parallel build.
- d/rules: Enable unit test execution.
- d/control: Add Multi-Arch: same for libgf-complete{1,-dev}.
- d/control: Add gf-complete-tools package, providing misc
tooling for using/testing gf-complete based solutions such
as jerasure.
* d/control: Bumped Standards-Version to 3.9.6, no changes.
* d/copyright: Switch BSD -> BSD-3-clause.
-- James Page <email address hidden> Mon, 14 Sep 2015 14:15:58 +0100
Upload details
- Uploaded by:
- James Page
- Uploaded to:
- Wily
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| gf-complete_1.0.2.orig.tar.xz | 275.0 KiB | c16e9ef092576017b886eb3d2e1abebc5ebddb21c7edb6c931bbf2c093c7206b |
| gf-complete_1.0.2-1ubuntu1.debian.tar.xz | 4.1 KiB | 902af94eb4796ffad20c815c2f48cfe799d82b60f5774093b1d066aab940f76b |
| gf-complete_1.0.2-1ubuntu1.dsc | 2.1 KiB | cd5b32753a9f7ece55f02938e5a3c9f22a7be34412a017e8656b6f44047597ae |
Available diffs
Binary packages built by this source
- gf-complete-tools: No summary available for gf-complete-tools in ubuntu wily.
No description available for gf-complete-tools in ubuntu wily.
- gf-complete-tools-dbgsym: debug symbols for package gf-complete-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.
- 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: No summary available for libgf-complete1 in ubuntu wily.
No description available for libgf-complete1 in ubuntu wily.
- libgf-complete1-dbgsym: debug symbols for package libgf-complete1
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.
