You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I am struggling to use Sage's Reed Solomon code. Although it has linting issue and more difficult to use than Galois (thanks again), I noticed that it is faster than Galois though, my tests are as follows:
importgaloisrs=galois.ReedSolomon(2**16-1, 3)
# time python test1.py# 32.38 user 2.56 system 98% cpu 41.630 total
fromsage.allimport*F=GF(Integer(2**16))
rs=codes.GeneralizedReedSolomonCode(F.list()[1:2**16], 3)
# time python test2.py# 0.50 user 0.11 system 99% cpu 0.619 total
I wonder why there is such a difference, is it something related to JIT? I'm a newbie in terms of symbolic computation (and Sage and Galois), any explanation or link to references would be much appreciated.
The text was updated successfully, but these errors were encountered:
Thanks for the very useful library!
I am struggling to use Sage's Reed Solomon code. Although it has linting issue and more difficult to use than Galois (thanks again), I noticed that it is faster than Galois though, my tests are as follows:
I wonder why there is such a difference, is it something related to JIT? I'm a newbie in terms of symbolic computation (and Sage and Galois), any explanation or link to references would be much appreciated.
The text was updated successfully, but these errors were encountered: