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 and exact linear algebra related to it, but there will be lots of general hacking. Even if you don't have any particular interest in coding theory, you should participate! Similarly, even if don't know Sage at all but are interested in coding theory, you should also participate! There will be an installation session, introductory talks to Sage and its development workflow.

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

Disclaimer: This is a preliminary schedule which is subject to change!

Plenary talks

Coding sprints

	Monday, 22nd August	Tuesday, 23rd August	Wednesday, 24th August	Thursday, 25th August	Friday, 26th August
Room	Gilles Kahn	Gilles Kahn	Gilles Kahn	Gilles Kahn	Gilles Kahn
9am	Welcome and install session	Coding sprints session	Coding sprints session	Coding sprints session	Coding sprints session
9.30am
10am
10.30am	Introduction to Sage
11am	Introduction to Sage	Presentation of LinBox (Clément Pernet)	Decoding techniques for algebraic codes: algorithmic and implementation (Johan S. R. Nielsen)	Rank-metric codes in Sage (Arpit Merchant)	TBA
11.30am	Hands-on Sage (tutorials, ...)	Presentation of LinBox (Clément Pernet)		Rank-metric codes in Sage (Arpit Merchant)	TBA
12am	Lunch break	Lunch break	Lunch break	Lunch break	Lunch break
1.30pm	Introduction to coding theory in Sage (David Lucas)	Coding sprints session	Coding sprints session	Coding sprints session	Coding sprints session
2pm	Introduction to coding theory in Sage (David Lucas)
2.30pm	Break
3pm	Status report on ACTIS (David Lucas)
3.15pm	Brainstorming on coding sprints (David Lucas)
3.30pm	Coding sprints session
5.30pm	Coding sprints session	Status report on coding sprints	Status report on coding sprints	Status report on coding sprints	Status report on coding sprints
6pm	End	End	End	End	End

We also expect to have informal lightning talks by the participants throughout the week on any subject that comes up.

Ideas for coding sprints

Feel free to add your own ideas here.

* Review any open coding theory ticket, see #18846.

* Fix any open issue with linear_code.py as noted on the ACTIS Bitbucket wiki.

* Improve documentation of sage.coding

* Improve integration of finite field non-prime basis representation introduced in #20284.

* Port implementation of asymptotically fast (GF(q)[x])[y] root-finding from Codinglib.

* Improve integration of the (GF(q)[x])[y] root-finding so that it is tab-expansion-available for any such polynomial (a reasonably fast implementation of such root-finding was introduced in #19666)

* Fix and review #16742 regarding faster F[x] matrix reduction.

* 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.

* Implement the Hartmann-Tzeng bound for cyclic codes.

* Implement Goppa codes.

* Cython implementation of the Brouwer-Zimmermann algorithm for computing the minimum distance of a linear code.

Logistics

Lodging

We booked a holiday cottage (The Tower and Le grenier royal and will provide free lodging. As there is a limited number of rooms, please contact David Lucas (david.lucas[at]inria.fr) if you want to stay at the cottage.

Transportation

How to reach Inria Saclay

Board the RER B, direction Saint Rémy lès Chevreuse, Orsay or Massy-Palaiseau and stop at Massy-Palaiseau. Exit on Massy-Atlantis side and board 91.06B or 91.06C bus. Stop at Polytechnique - Laboratoire. A map of Massy-Palaiseau RER/Bus station is available here (pdf)

How to reach the cottage

From Orly Airport: Take the Orlyval to Paris, and stop at Antony. Then, board the RER B to Saint Rémy lès Chevreuse and stop at Saint Rémy lès Chevreuse. We will drive you to the cottage from there.

From Charles de Gaulle Airport: Take the RER B to Saint Rémy lès Chevreuse and stop at Saint Rémy lès Chevreuse. We will drive you to the cottage from there.

We will also provide transportation by cars between the cottage and Inria Saclay.

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)
Julien Lavauzelle (LIX & Inria Saclay)
Xavier Caruso (IRMAR) (to be confirmed)
Jean-Pierre Flori (ANSSI) (I'll show up randomly and will be commuting from Paris)
Arpit Merchant (IIIT-H, India)
Bruno Grenet (U. Montpellier)
Alain Couvreur (Inria Saclay - LIX)
Tania Richmond (U. de Toulon)
Razvan Barbulescu (IMJ - PRG)
Ricardo Alfaro (U. of Michigan - Flint)
Charles Bouillaguet (U. Lille 1)
Nicholas Coxon (Inria Saclay - LIX)
Joe Fields (SCSU - New Haven, CT, USA)
Fangan Dosso (U. de Toulon)

-  ⇤ ← Revision 33 as of 2016-07-11 08:10:03 → 
  Size: 6268
  Editor: dlucas
  Comment:
+   ← Revision 34 as of 2016-07-27 08:39:20 → ⇥
  Size: 7102
  Editor: dlucas
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 40:
-||<#FFFFAA> 11am    ||<#AFEFEF:|2>Presentation of LinBox||<#AFEFEF:|2>Decoding techniques for algebraic codes: algorithmic and implementation||<#AFEFEF:|2>Rank-metric codes in Sage||<#AFEFEF:|2>TBA||
+||<#FFFFAA> 11am    ||<#AFEFEF:|2>Presentation of LinBox (Clément Pernet)||<#AFEFEF:|2>Decoding techniques for algebraic codes: algorithmic and implementation (Johan S. R. Nielsen)||<#AFEFEF:|2>Rank-metric codes in Sage (Arpit Merchant)||<#AFEFEF:|2>TBA||
 Line 43:
-||<#FFFFAA> 1.30pm  ||<#AFEFEF:|2>Introduction to coding theory in Sage||<#D0FFD0:|6>Coding sprints session||<#D0FFD0:|6>Coding sprints session||<#D0FFD0:|6>Coding sprints session||<#D0FFD0:|6>Coding sprints session||
+||<#FFFFAA> 1.30pm  ||<#AFEFEF:|2>Introduction to coding theory in Sage (David Lucas)||<#D0FFD0:|6>Coding sprints session||<#D0FFD0:|6>Coding sprints session||<#D0FFD0:|6>Coding sprints session||<#D0FFD0:|6>Coding sprints session||
 Line 46:
-||<#FFFFAA> 3pm     ||<#AFEFEF:>Status report on ACTIS||
||<#FFFFAA> 3.15pm  ||<#AFEFEF:>Brainstorming on coding sprints||
+||<#FFFFAA> 3pm     ||<#AFEFEF:>Status report on ACTIS (David Lucas)||
||<#FFFFAA> 3.15pm  ||<#AFEFEF:>Brainstorming on coding sprints (David Lucas)||
 Line 98:
-See directions [[http://www.lix.polytechnique.fr/cryptologie/directions|here]].
We will provide transportation by cars between the cottage and Inria Saclay.
+=== How to reach Inria Saclay ===

Board the RER B, direction ''Saint Rémy lès Chevreuse'', ''Orsay'' or ''Massy-Palaiseau'' and stop at Massy-Palaiseau.
Exit on ''Massy-Atlantis'' side and board 91.06B or 91.06C bus. Stop at ''Polytechnique - Laboratoire''.
A map of Massy-Palaiseau RER/Bus station is available
[[https://www.ensta-paristech.fr/sites/default/files/fichiers/menu_gauche/plan_gare_massy.pdf|here (pdf)]]

=== How to reach the cottage ===

From Orly Airport: Take the Orlyval to Paris, and stop at ''Antony''. Then, board the RER B to ''Saint Rémy lès Chevreuse'' and
stop at ''Saint Rémy lès Chevreuse''. We will drive you to the cottage from there.

From Charles de Gaulle Airport: Take the RER B to ''Saint Rémy lès Chevreuse'' and
stop at ''Saint Rémy lès Chevreuse''. We will drive you to the cottage from there.

We will also provide transportation by cars between the cottage and Inria Saclay.
-Line 112:
+Line 126:
- * Vincent Neiger (ENS Lyon) (to be confirmed)

Diff for "days75"