Hi all,
I just wanted to introduce myself, and mention my interest in doing a
project this summer through the Google Summer of Code with sympy,
specifically dealing with error-correcting codes. This is not a project on
the ideas page, but there seemed to be some interest in implementing some
Others can comment on the chosen field, however you might be
interested in checking out the `physics.quantum` module of sympy as
they might find it useful as well.
On 17 April 2013 04:22, Shravas Rao wrote:
> Hi all,
>
> I just wanted to introduce myself, and mention my interest in doing a
> proj
On Tue, Apr 16, 2013 at 10:22 PM, Shravas Rao wrote:
> Hi all,
>
> I just wanted to introduce myself, and mention my interest in doing a
> project this summer through the Google Summer of Code with sympy,
> specifically dealing with error-correcting codes. This is not a project on
> the ideas pa
In a previous discussion about implementing Coding Theory, it was mentioned
that stuff relating to finite fields, and algorithms on matrices whose
entries are finite fields need to be implemented too. It seems like the
Polynomial Manipulation Module has finite fields, but I can't seem to find
On Tue, Apr 23, 2013 at 6:01 PM, Shravas Rao wrote:
> In a previous discussion about implementing Coding Theory, it was
> mentioned that stuff relating to finite fields, and algorithms on matrices
> whose entries are finite fields need to be implemented too. It seems like
> the Polynomial Manipu
Only cyclic finite fields are implemented. F_q for q = p^n for n > 1
is not implemented yet.
Your main focus should be getting these to work in the polys domains.
Working with them in the matrices will be automatic once the matrices
support domains.
Aaron Meurer
On Tue, Apr 23, 2013 at 4:01 PM,
Will matrices support domains by the time the summer starts? Or should I
also plan on working on that as a part of my project?
Thanks,
- Shravas Rao
On Tuesday, April 23, 2013 6:19:15 PM UTC-4, Aaron Meurer wrote:
>
> Only cyclic finite fields are implemented. F_q for q = p^n for n > 1
> is no
I don't know (it depends on how much work Matuesz does). A contingency
would be to find suitable work-arounds.
Note that even the cyclic finite fields also need a lot of work. For
example, they are currently not instances of Basic, meaning that just
doing Matrix([[FF(2)(1)]]) does not work because
