| Name : gf-complete-devel
| |
| Version : 1.0.20140410giteb4463f
| Vendor : obs://build_opensuse_org/Cloud:OpenStack
|
| Release : 1.40
| Date : 2015-08-04 14:00:00
|
| Group : Development/Libraries/C and C++
| Source RPM : gf-complete-1.0.20140410giteb4463f-1.40.src.rpm
|
| Size : 0.01 MB
| |
| Packager : (none)
| |
| Summary : Galois Field Arithmetic development files
|
Description :
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.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/Cloud:/OpenStack:/Mitaka/openSUSE_Tumbleweed/x86_64 |
