package
0.0.0-20231112095356-70c1fabb2e7d
Repository: https://github.com/aecra/peercodex.git
Documentation: pkg.go.dev

# Functions

New takes n (a power of 2), p (a polynomial), and g (a generator), then uses them to construct an instance of GF(n).

# Variables

Some arbitrarily-chosen permutation of GF(256).
Some handy pre-chosen polynomial/generator combinations.
Some handy pre-chosen polynomial/generator combinations.
Some handy pre-chosen polynomial/generator combinations.
Some handy pre-chosen polynomial/generator combinations.
Some arbitrarily-chosen permutations of GF(n).
Some handy pre-chosen polynomial/generator combinations.
Some handy pre-chosen polynomial/generator combinations.
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
GF(4) p=(x^2 + x + 1) g=2.
GF(8) p=(x^3 + x + 1) g=2.
GF(16) p=(x^4 + x + 1) g=2.
GF(32) p=(x^5 + x^2 + 1) g=2.
GF(64) p=(x^6 + x + 1) g=2.
GF(64) p=(x^6 + x + 1) g=7.
GF(128) p=(x^7 + x + 1) g=2.
GF(256), p (x^8 + x^4 + x^3 + x + 1), g 3.
GF(256), p (x^8 + x^4 + x^3 + x^2 + 1), g 2.

# Structs

GF represents a particular permutation of GF(2**k) for some fixed k.