Skip to content

Releases: tkluck/GaloisFields.jl

v1.2.1

24 Aug 20:53
Compare
Choose a tag to compare

GaloisFields v1.2.1

Diff since v1.1.1

Closed issues:

  • Usage report / open discussions tab? (#18)
  • Update Polynomials dependency to the latest (#19)
  • llvm.x86.pclmulqdq on Julia over Apple M1 (#21)
  • Incompatible with the built-in @profview of VSCode (#23)

Merged pull requests:

  • CompatHelper: bump compat for HTTP to 1, (keep existing compat) (#22) (@github-actions[bot])

v1.1.1

14 Jul 23:33
Compare
Choose a tag to compare

GaloisFields v1.1.1

Diff since v1.1.0

v1.1.0

06 Mar 22:41
Compare
Choose a tag to compare

GaloisFields v1.1.0

Diff since v0.3.0

Closed issues:

  • Release v0.4 (#2)
  • Display confusion between PrimeField and BinaryField (#5)
  • Any plans on supporting creation finite fields over finite fields? (#7)
  • Nested extension continued (#8)
  • tr() doesn't work over F2^p (#13)

Merged pull requests:

  • Fix divisions of form 0/k for Zech's logarithms (#1) (@b-reinke)
  • Add code for computing n-th roots of unity (#3) (@Keno)
  • Small typo fix (#4) (@Keno)
  • Slight rework of BitInt logic to allow larger integers (#6) (@Keno)
  • Update README.md (#11) (@kirtsar)

v0.3.0

18 Feb 22:35
Compare
Choose a tag to compare
  • Add support for Zech's logarithms for faster multiplication
  • Fix integer overflow issues for certain primes.

v0.2.2

12 Feb 14:06
Compare
Choose a tag to compare

This release fixes a critical bug related to the internal representation of -0. All users are encouraged to upgrade.

v0.2.1

04 Nov 21:48
Compare
Choose a tag to compare

This release contains two important fixes:

  • a byte overflow for characteristic-2 fields of order greater than 2^8, resulting in an endless loop in the multiplication operation
  • a stack overflow when trying to convert between identified Conway fields

All users of v0.2.0 are encouraged to upgrade.

v0.2.0

04 Nov 12:48
Compare
Choose a tag to compare

This release fixes an integer overflow bug, and adds support for Frank Lübeck's library of Conway polynomials. This means you do not have to pass your own minimum polynomial any more.

All users are encouraged to upgrade.

v0.1.0

21 Oct 18:14
Compare
Choose a tag to compare

First release.