|
Size: 1539
Comment:
|
Size: 2215
Comment: hacking ideas. And a few fixes.
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 11: | Line 11: |
| The overall theme of this Sage Days is coding theory, but there will be lots of general hacking. Even if you don't have any particular interest in coding theory, you should participate! |
|
| Line 13: | Line 16: |
| * introduce Sage to coding theorists | * Introduce Sage to coding theorists. |
| Line 15: | Line 18: |
| * have presentations about the enhancements we made to Sage's coding theory library during Inria's [[https://bitbucket.org/lucasdavid/sage_coding_project/wiki/Home|ACTIS]] project | * Have presentations about the enhancements we made to Sage's coding theory library during Inria's [[https://bitbucket.org/lucasdavid/sage_coding_project/wiki/Home|ACTIS]] project |
| Line 17: | Line 20: |
| * help people to work on their projects | * Help people to work on their own projects. |
| Line 19: | Line 22: |
| Anyone, even without any particular interest to coding theory can participate! | |
| Line 27: | Line 29: |
== Ideas for hacking projects == Feel free to add your own ideas here. * Review any open coding theory ticket, see [[http://trac.sagemath.org/ticket/18846|#18846]]. * Port implementation of asymptotically fast (GF(q)[x])[y] root-finding from [[https://bitbucket.org/jsrn/codinglib|Codinglib]]. * Link to advanced fast polynomial arithmetic library functions such as multi-point evaluation and Lagrange interpolation. * Link to fast GF(2)[x] library (currently used is NTL generic GF(p)[x]). * Link to new features of new LinBox release. |
Sage Days 75 will be held from August 22-26, 2016 at Inria Saclay, France.
Organizers
Daniel Augot, David Lucas, Johan S. R. Nielsen, Clément Pernet.
Please contact David Lucas (david.lucas[at]inria.fr) for any question.
Focus & Topics
The overall theme of this Sage Days is coding theory, but there will be lots of general hacking. Even if you don't have any particular interest in coding theory, you should participate!
The aim of this Sage Days is to:
- Introduce Sage to coding theorists.
Have presentations about the enhancements we made to Sage's coding theory library during Inria's ACTIS project
- Help people to work on their own projects.
We plan on having talks on the mornings, and coding sprints on the afternoons. The first 3 days' talks will be focused on basic functionalities of our library, the last 2 days on advanced functionalities, with an emphasis on Sage development.
Schedule
TBA
Ideas for hacking projects
Feel free to add your own ideas here.
* Review any open coding theory ticket, see #18846.
* Port implementation of asymptotically fast (GF(q)[x])[y] root-finding from Codinglib.
* Link to advanced fast polynomial arithmetic library functions such as multi-point evaluation and Lagrange interpolation.
* Link to fast GF(2)[x] library (currently used is NTL generic GF(p)[x]).
* Link to new features of new LinBox release.
Funding
We plan on having some funding to invite a few participants.
Logistics
Lodging
TBA
Transportation
See directions here.
Participants
Please add you name to the list if you want to attend this Sage Days.
- Daniel Augot (Inria Saclay - LIX)
- David Lucas (Inria Saclay - LIX)
- Johan S. R. Nielsen (DTU)
- Clément Pernet (U. Grenoble Alpes, U. de Lyon - LIP)
- Luca De Feo (U. Versailles)
- Miguel Marco (U. de Zaragoza)
- Irene Márquez (Inria)