パッケージ: gf-complete-tools (1.0.2+2017.04.10.git.ea75cdf-9)

[ ソース: gf-complete  ]

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

タグ: 役割: 共有ライブラリ

その他の gf-complete-tools 関連パッケージ

• dep: libc6 (>= 2.34)

  GNU C ライブラリ: 共有ライブラリ
  以下のパッケージによって提供される仮想パッケージでもあります: libc6-udeb

• dep: libgf-complete1 (= 1.0.2+2017.04.10.git.ea75cdf-9)

  Galois Field Arithmetic - shared library

gf-complete-tools のダウンロード

すべての利用可能アーキテクチャ向けのダウンロード

アーキテクチャ	パッケージサイズ	インストールサイズ	ファイル
s390x	20.9 kB	119.0 kB	[ファイル一覧]