all options
[  buster  ] [  bullseye  ] [  bookworm  ] [  trixie  ] [  sid  ]
[ Source: gf-complete  ]

Package: gf-complete-tools (1.0.2+2017.04.10.git.ea75cdf-3)

Links for gf-complete-tools

Screenshot

Debian Resources:

Download Source Package gf-complete:

Maintainers:

External Resources:

Similar packages:

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(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.

Other Packages Related to gf-complete-tools

  • depends
  • recommends
  • suggests
  • enhances

Download gf-complete-tools

Download for all available architectures
Architecture Package Size Installed Size Files
amd64 22.6 kB120.0 kB [list of files]
arm64 20.3 kB120.0 kB [list of files]
armhf 20.4 kB84.0 kB [list of files]
i386 22.7 kB100.0 kB [list of files]