gf-complete-tools binary package in Ubuntu Lunar ppc64el

 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.

Publishing history

Date Status Target Pocket Component Section Priority Phased updates Version
  2022-11-06 19:04:57 UTC Published Ubuntu Lunar ppc64el release universe libs Extra 1.0.2+2017.04.10.git.ea75cdf-9
  • Published
  • Copied from ubuntu lunar-proposed ppc64el in Primary Archive for Ubuntu
  Deleted Ubuntu Lunar ppc64el proposed universe libs Extra 1.0.2+2017.04.10.git.ea75cdf-9
  • Removal requested .
  • Deleted by Ubuntu Archive Auto-Sync

    Moved to lunar

  • Published
  2022-11-06 19:08:22 UTC Superseded Ubuntu Lunar ppc64el release universe libs Extra 1.0.2+2017.04.10.git.ea75cdf-7build1
  • Removal requested .
  • Superseded by ppc64el build of gf-complete 1.0.2+2017.04.10.git.ea75cdf-9 in ubuntu lunar PROPOSED
  • Published
  • Copied from ubuntu jammy-release ppc64el in 4810 - 2022-03-24