We had some troubles with Inria's guest network. Here's a command to make git fetch trac work on the InriaGuest network:
git remote set-url trac [email protected]:sage.git
# Sprints
* Review open coding theory tickets, see #18846 : David, Johan Édouard, Julien (Cyclic codes, BCH codes), Daniel, Clément, Arpit (Add the ticket you review to this list as a specific item.)
#20342 as author (David) -> Open for review
- #20100 Cyclic code (Julien) work in progress
- Daniel is picky on 20087
#21306 doc on divisor (Ricardo) -> Positive review
#21315 relative distance (David, Tania, Fangan) -> Open for review. Positive review.
#20908 doc bugs -> in progress
#21326 Prevent creation of code with length 0 (Fangan) -> Open for review
#21165 Various cleanup to sage/coding -> positive review
#20342 Rate -> positive review
#19913 non guava covering radius -> positve review
#19251 immutable basis -> positive review
#20443 decoder_type on non class instances ->positive review
#19975 -> invalid/wontfix
#20787 Golay codes -> WIP
#20233 minimum_distance() fails for large fields (Joe) -> needs review
Reminder: remember to add keyword 'sd75' on all Sage tickets you may be working on during these Sage days.
* Fix any open minor issue with linear_code.py as noted on the ACTIS Bitbucket wiki. Ricardo, Daniel, David
- see #21306 above
issue 151 -> #20001 decoder types (Ricardo), https://bitbucket.org/lucasdavid/sage_coding_project/issues/151/definition-of-decoders-types
(* Implement the Hartmann-Tzeng bound for cyclic codes. See #20100 for cyclic codes.)
(* Cython implementation of the Brouwer-Zimmermann algorithm for computing the minimum distance of a linear code. Bruno, Johan, David)
* #21328 Implement parity check codes as a code class: David, Tania, Nicolas
-> Open for review
* Finish the implementation of Golay codes: David, Tania, Arpit
-> work in progress
(* Create a proper code class for any construction in code_constructions.py, and endow it with (some of) the known properties for that class.)
* Implement a class for Goppa codes. Implement a decoder, e.g. based on its formulation as a subfield subcode of a GRS code: Daniel, Tania, Johan, David -> Discussions
* Finish and review Groebner basis decoding of any linear code (Irene, Miguel, David)
- work in progress (David will give a hand on the code design) almost there
(* Create a class for binary codes and move the binary-code specific methods of AbstractLinearCode into this class. Possibly think the efficient binary code methods in sage.coding.binary_code.pyx into it.)
(* Create a class for two-weight codes. Rewrite sage.coding.two_weight_db.py such that it creates elements of this class.)
(* Create a class for self-dual codes. Think sage.coding.sd_codes into it. Be sure to merge in trac #21165 before working on this, since it does relevant renaming and refactoring.)
(* Create an abstract class AbstractSubfieldLinearCode for codes which are linear over a *subfield* of the base field. Examples include interleaved codes, folded RS codes, and rank-metric codes which are linear over the matrix base field. Should AbstractLinearCode inherit from this?)
* Create a base class for codes over (ZZ mod N). See #6452 for the relevant base module structure. Create a class for the famous Z4 codes and their embedding into binary codes. Joe Fields , Johan, Ricardo, David -> discussions in progress
* Discuss guava and improve its integration in Sage: Daniel, David Joe:
-> sage -i gap_packages offers no granularity -> Joe did a review of main features of guava : we would like to have a place to point them and discuss them wrt to sage-actis (ticket ? bitbucket ?) -> wiki page at https://wiki.sagemath.org/Coding_Theory/Guava -> Joe pointed the issue with codetables.de and magma -> few algorithms (minimum distance, code equivalence, automorphism group) have been implemented in C for guava. So the calling path is sage->gap->guave->adhoc ->The most valuable seems to be Leon's code for computing the automorphism group of a code
* Update https://wiki.sagemath.org/Coding_Theory. Done: Complete rewrite. Please check it out.
* Write and review related tickets (#13215)
experimental warning needs to be thrown properly -> done.
- In needs_review now
- A lot of changes and improvements were made to the documentation of the ticket.
* skew polys over finite fields (#21088)
- This ticket is no longer relevant: it mainly implements inplace methods but they are not faster that standard ones
* skew polynomials over (R, theta) where theta has finite order (#21262)
- needs_review
* Interpolation and minimal vanishing poly for skew polys #21131
- Working on rewriting history. Otherwise pretty close to setting needs_review.
- After a final check, this will be opened for review.
* Abstract base class for Rank Metric Codes #21226
- Add documentation and remaining methods.
* Gabidulin Code + decoder: #20970
* Improve the integration of finite field non-prime basis representation that was introduced in #20284. Johan, Luca, David, Turku, Édouard, Bruno
* Port implementation of asymptotically fast (GF(q)[x])[y] root-finding from Codinglib. Bruno, Johan => needs review: http://trac.sagemath.org/ticket/21333
* 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) Johan, Bruno, Turku:
- Needs review work (again...) review https://trac.sagemath.org/ticket/21331 positive review
* List decoding should return empty list instead of None when no codeword is found: needs review http://trac.sagemath.org/ticket/21347
(* Fix and review http://trac.sagemath.org/ticket/16742 regarding faster F[x] matrix reduction: Clément, Johan, Turku
- discussion needed, simplification of the code)
(* 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]).)
* Refactoring class hierarchy for univariate polynomials : Johan, Bruno
Look at overall picture Wednesday evening. Get master-advice from Nicolas Thursday. => Got super advice! (And even skeleton of code => in good way ;-))
* Fix and review http://trac.sagemath.org/ticket/17635 : update LinBox, fflas-ffpack and givaro packages : Clément, Charles
- 23/08: fixed cygwin + cleanup -> needs-review
* Link to new features of new LinBox release (linalg mod p > 23 bits, ZZ) https://trac.sagemath.org/ticket/19076 : Clément, Charles * Links to old features of old LinBox releases (sparse det/charpoly/rank/minpoly, for instance): Clément, Charles (Johan?)
- https://trac.sagemath.org/ticket/13915
23/08, Givaro: Fixed GMP detection using autotools, sent pull request upstream to Givaro: https://github.com/linbox-team/givaro/pull/28 24/08, Trying to replace .pxi files with .pxd, to prevent type aliasing. https://trac.sagemath.org/ticket/21321 (needs review) 24/08, need to remove the sage-interface in LinBox (by improving the linbox-interface in Sage). https://trac.sagemath.org/ticket/21327 work in progress
25/08, need to improve IML wrapping in sage. https://trac.sagemath.org/ticket/21341
* Fix matrix subdivisions (https://trac.sagemath.org/ticket/14064 ): Fangan, Charles, Turku. positive review
*#21332 Creation of a method 'canonicalize_radical' for matrices : Fangan. Needs_review -> positive review
*#21352 Creation of a class for McEliece cryptosystem : Fangan (in progress)
coerce_binop rewrite #21322 -> Positive Review > Closed!
* Learn about implementing codes over finite rings in Sage: Ricardo, Johan, Joe
* Fix the libFES experimental package (Charles), https://trac.sagemath.org/ticket/15209, http://cristal.univ-lille.fr/~bouillag/fes/ (gave up, no time)
* Design a more general Benchmark framework for all of Sage (or even more).
Discussion pad: https://mensuel.framapad.org/p/sage-days-75-benchmarking
- Discuss Thursday. David, Clément, Johan, Nicolas, Miguel, Luca, Thiery
* https://trac.sagemath.org/ticket/20241 CyPari (Luca, Miguel?????)
* https://trac.sagemath.org/ticket/19971 SCSCP (Luca,Miguel????)
- mostly working client
https://trac.sagemath.org/ticket/18010 Multiple Zeta (Akhilesh)
https://trac.sagemath.org/ticket/18019 MPFI slowness (Akhilesh)
- Cleaning old tickets:
- https://trac.sagemath.org/ticket/10261 -> needs review (Sebastien) - https://trac.sagemath.org/ticket/10948 -> needs review (Sebastien)
- have a 'sage -rst2ipyb' command (Thierry), ticket(s) to come (involves a few new packages)
- review https://trac.sagemath.org/ticket/20690 and package thebe.js for that purpose https://trac.sagemath.org/ticket/21309 (Thierry) - Continue to work on improving Sage infrastructure, in particular: (Thierry)
- - finalize backup system for : ask, patchbot, fileserver - uniformize ssl certificate management - publish the (sysadmin) doc that is spread among maintained services
- Nicolas: "Introduction aux codes correcteurs" Option C Agregation http://nicolas.thiery.name/Enseignement/Agregation/ - Luca: Bachelor level IT class taught in Java http://defeo.lu/in420/ (in french) - Johan: Master level class, with a focus on the maths - Clément: Master level: a classical CT course, with not much computer programming. Another one, more oriented to CIRC codes with a practical implementation project. (http://lig-membres.imag.fr/pernet/M2SCCI_Coding.html) - Visualization of Coding Theory (maybe using Graphs???) Images would have to be bit map images/png (see: bit-array module in Python). But an idea is to have product codes that decode it. The main idea is to create a project that is open and the students have a free choice to decide what the final visualization looks like. - Evaluations of students/their submissions using Sage. - Getting students to contribute to Sage as part of a course - write a Wikipedia page on a particular topic and the prof evaluates based on that (makes changes if there are mistakes). Or maybe add code or documentation to Sage. - SageMathCloud- advantage over other CMS is that it has Sage built right in and students can be up and running immediately. - Another takeaway is to augment theoretical explanations of codes using Sage, for exampleone can create worksheets that can be shared so that students can see visually (perfect codes - see Nicolas' course notes) how a code looks or follow step wise the properties of codes and a virtual pipeline of message->encoding->adding errors (channel)-> decoding. - Using advanced CT features to support learning. Live demos (pick code, channel, encode, etc), functions for data, applications. Have students take a text file/image/video/sound and encode it and then add noise and then decode and analyze/compare it. Very fun for students to understand. - Demonstrate code efficiency, etc. - Demonstrate code efficiency, etc. - Interactive documentation base (Miguel) https://riemann.unizar.es/sage-wiki
* Nicolas: Improving my class notes
- Btw: feel free to reuse any chunk of those notes if useful (e.g. for a tutorial)
Potentially useful features for those course notes: parity code, code from a set of words, drawing codes, text <-> vectors conversions
- Tutorial: contributing to Sage: git and trac (David): Daniel, Tania, Fangan Édouard : Fangan Édouard, Ricardo, Joe, Clément
done -> Fix found for Mac OS, slides have been uploaded
- Tutorial: implementing new codes (David): Tania, Édouard.... - Learning more about codes over rings (Ricardo): David, Tania, Joe, Daniel, ...
- we discussed on what Ricardo would like to have in Sage
- I (David) took some notes.
- Johan, Wednesday 11:00: "Decoding algebraic codes for the lazy mathematician". Done.
- Interactive documentation base (Miguel) https://riemann.unizar.es/sage-wiki - Writing Sage documentation?: Xavier... - parallel linear algebra
Traduire Traduire