Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Rings of polynomials over fields #12

Open
kirtsar opened this issue Jan 20, 2020 · 3 comments
Open

Rings of polynomials over fields #12

kirtsar opened this issue Jan 20, 2020 · 3 comments

Comments

@kirtsar
Copy link
Contributor

kirtsar commented Jan 20, 2020

I was wondering if there is an implementation of rings over Galois Fields F[x, y ...]? It seems that SemialgebraicSets are not supposed to use with custom fields other from R or C. I know about Nemo, but this is really huge and pretty "monolithic".

@tkluck
Copy link
Owner

tkluck commented Jan 21, 2020

Does Polynomials.jl (single variable only) work for you?

using Polynomials, GaloisFields
const F = GaloisField(29)
f = Poly(F[0, 10], :x)

If you want multi-variate polynomials, there's TypedPolynomials.jl or my own PolynomialRings.jl. Both should work; I think PolynomialRings.jl may have more features and optimizations but it has rough edges too; TypedPolynomials.jl is a safe bet.

@kirtsar
Copy link
Contributor Author

kirtsar commented Jan 21, 2020

@tkluck It does, but I wonder how can I solve equation of the type f(X) == 0 over finite field? It is needed for example for decoding BCH codes.

@tkluck
Copy link
Owner

tkluck commented Jan 21, 2020

I haven't implemented polynomial factorization myself, but it would certainly be a worthwhile addition to the Julia ecosystem.

It's not entirely trivial to implement; see e.g. the wikipedia page on the topic.

Nemo.jl is probably your best bet in the short run.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants