Sisyphus repository
Last update: 19 march 2023 | SRPMs: 18279 | Visits: 27127294
en ru br
ALT Linux repos

Group :: System/Libraries
RPM: gf-complete

 Main   Changelog   Spec   Patches   Sources   Download   Gear   Bugs and FR  Repocop 

Current version: 1.0.2-alt2.gita6862d
Build date: 6 september 2021, 14:24 ( 80.1 weeks ago )
Size: 293.05 Kb

Home page:

License: BSD-3-Clause
Summary: Galois Field Arithmetic

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.

Current maintainer: Ilya Kurdyukov

List of contributors

List of rpms provided by this srpm:

  • gf-complete-tools
  • gf-complete-tools-debuginfo
  • libgf-complete
  • libgf-complete-debuginfo
  • libgf-complete-devel
    design & coding: Vladimir Lettiev aka crux © 2004-2005, Andrew Avramenko aka liks © 2007-2008
    current maintainer: Michael Shigorin