Differences between revisions 1 and 3 (spanning 2 versions)
Revision 1 as of 2016-08-29 09:31:37
Size: 13080
Editor: dlucas
Comment:
Revision 3 as of 2016-08-29 12:27:48
Size: 11617
Editor: dlucas
Comment:
Deletions are marked like this. Additions are marked like this.
Line 6: Line 6:
git remote set-url trac [email protected]:sage.git {{{git remote set-url trac [email protected]:sage.git}}}
Line 8: Line 8:
# Sprints = Sprints =
Line 10: Line 10:
## Sprints on Coding theory
* Review open coding theory tickets, see [[http://trac.sagemath.org/ticket/18846|#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.)
== Sprints on Coding theory ==

 
* Review open coding theory tickets, see [[http://trac.sagemath.org/ticket/18846|#18846]] : David, Johan Édouard, Julien (Cyclic codes, BCH codes), Daniel, Clément, Arpit
Line 14: Line 14:
    *#20100 Cyclic code (Julien) work in progress

         * Daniel is picky on 20087
    * #20100 Cyclic code (Julien) work in progress
Line 27: Line 24:
    *  #19975 -> invalid/wontfix
    * #20787 Golay codes -> WIP
    * #19975 -> invalid/wontfix
    * #20787 Golay codes -> needs review
Line 33: Line 30:
* Fix any open minor issue with `linear_code.py` as noted on the [[https://bitbucket.org/lucasdavid/sage_coding_project/issues/155/problems-with-linear_codepy|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
 * Fix any open minor issue with `linear_code.py` as noted on the [[https://bitbucket.org/lucasdavid/sage_coding_project/issues/155/problems-with-linear_codepy|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
    * #21328 Implement parity check codes as a code class: Tania, David, Nicolas -> Open for review
Line 45: Line 36:
* Finish the implementation of Golay codes: David, Tania, Arpit
 
-> work in progress
 * Finish the implementation of Golay codes: David, Tania, Arpit -> open for review
Line 48: Line 38:
(* 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
Line 50: Line 40:
* 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) -> WIP, see #21339
Line 52: Line 42:
* 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 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
Line 55: Line 44:
(* 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.)  * Discuss guava and improve its integration in Sage: Daniel, Joe, David. Some details follow:
    * 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
Line 57: Line 51:
(* 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.

## GSoC 2016 related projects: Arpit, David, Xavier, Johan
* 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

## Algebra

* Improve the integration of finite field non-prime basis representation that was introduced in [[http://trac.sagemath.org/ticket/20284|#20284]]. Johan, Luca, David, Turku, Édouard, Bruno
 - See https://gist.github.com/defeo/cabab27ea93aeb9e0deb0ba8c5bc745b

* Port implementation of asymptotically fast (GF(q)[x])[y] root-finding from [[https://bitbucket.org/jsrn/codinglib|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 [[http://trac.sagemath.org/ticket/19666|#19666]]) Johan, Bruno, Turku:

        - Needs review work (again...) review https://trac.sagemath.org/ticket/21331 positive review
 * Update https://wiki.sagemath.org/Coding_Theory. Done: Complete rewrite. Please check it out.
Line 106: Line 54:
* List decoding should return empty list instead of None when no codeword is found: needs review http://trac.sagemath.org/ticket/21347 == GSoC 2016 related projects: Arpit, David, Xavier, Johan ==
Line 108: Line 56:
(* 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.)
 * Write and review related tickets (#13215)
Line 113: Line 58:
(* Link to fast GF(2)[x] library (currently used is NTL generic GF(p)[x]).)     * experimental warning needs to be thrown properly -> done.
    * A lot of changes and improvements were made to the documentation of the ticket.
    * In needs_review now
Line 115: Line 62:
* Refactoring class hierarchy for univariate polynomials : Johan, Bruno  * 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): in needs_review
 * Interpolation and minimal vanishing poly for skew polys #21131
   Working on rewriting history. Otherwise pretty close to setting needs_review.
 * Abstract base class for Rank Metric Codes #21226
   * Add documentation and remaining methods.
 * Gabidulin Code + decoder: #20970

== Algebra ==

 * Improve the integration of finite field non-prime basis representation that was introduced in [[http://trac.sagemath.org/ticket/20284|#20284]]. Johan, Luca, David, Turku, Édouard, Bruno
   * See https://gist.github.com/defeo/cabab27ea93aeb9e0deb0ba8c5bc745b

 * Port implementation of asymptotically fast (GF(q)[x])[y] root-finding from [[https://bitbucket.org/jsrn/codinglib|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 [[http://trac.sagemath.org/ticket/19666|#19666]]) Johan, Bruno, Turku:

        * https://trac.sagemath.org/ticket/21331 closed.


 * List decoding should return empty list instead of None when no codeword is found: needs review http://trac.sagemath.org/ticket/21347

 * Refactoring class hierarchy for univariate polynomials : Johan, Bruno
Line 118: Line 89:
## Linear Algebra == Linear Algebra ==
Line 120: Line 91:
* Fix and review http://trac.sagemath.org/ticket/17635 : update LinBox, fflas-ffpack and givaro packages : Clément, Charles  * Fix and review http://trac.sagemath.org/ticket/17635 : update LinBox, fflas-ffpack and givaro packages : Clément, Charles
Line 124: Line 95:
* 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
 * 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
Line 134: Line 104:
* Fix matrix subdivisions (https://trac.sagemath.org/ticket/14064 ): Fangan, Charles, Turku. positive review  * Fix matrix subdivisions (https://trac.sagemath.org/ticket/14064 ): Fangan, Charles, Turku. positive review
Line 136: Line 106:
*#21332 Creation of a method 'canonicalize_radical' for matrices : Fangan.   Needs_review -> positive review  * #21332 Creation of a method 'canonicalize_radical' for matrices : Fangan. -> positive review
Line 138: Line 108:
## Other == Other ==
Line 140: Line 110:
*#21352 Creation of a class for McEliece cryptosystem : Fangan (in progress)  * #21352 Creation of a class for McEliece cryptosystem : Fangan, David. Actually triggered a discussion about the design of sage.crypto abstract class system.
Line 144: Line 114:
* Learn about implementing codes over finite rings in Sage: Ricardo, Johan, Joe  * Learn about implementing codes over finite rings in Sage: Ricardo, Johan, Joe
Line 146: Line 116:
* Fix the libFES experimental package (Charles), https://trac.sagemath.org/ticket/15209, http://cristal.univ-lille.fr/~bouillag/fes/ (gave up, no time)  * Fix the libFES experimental package (Charles), https://trac.sagemath.org/ticket/15209, http://cristal.univ-lille.fr/~bouillag/fes/ (gave up, no time)
Line 148: Line 118:
* 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
 * 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
    * Agreed on working on something larger than just coding theory.
    * Decided to start a new project, aiming at designing a Python package: https://github.com/miguelmarco/bleachermark
Line 152: Line 124:
* https://trac.sagemath.org/ticket/20241 CyPari (Luca, Miguel?????)  * https://trac.sagemath.org/ticket/20241 CyPari (Luca, Miguel?????)
Line 154: Line 126:
* https://trac.sagemath.org/ticket/19971 SCSCP (Luca,Miguel????)
  * mostly working client
 * https://trac.sagemath.org/ticket/19971 SCSCP (Luca,Miguel????)
    * mostly working client
Line 162: Line 134:
     - https://trac.sagemath.org/ticket/10261 -> needs review (Sebastien)
     - https://trac.sagemath.org/ticket/10948 -> needs review (Sebastien)
    * https://trac.sagemath.org/ticket/10261 -> needs review (Sebastien)
    * https://trac.sagemath.org/ticket/10948 -> needs review (Sebastien)
Line 166: Line 138:
- have a 'sage -rst2ipyb' command (Thierry), ticket(s) to come (involves a few new packages)  * have a 'sage -rst2ipyb' command (Thierry), ticket(s) to come (involves a few new packages)
Line 168: Line 140:
- 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
 * 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
Line 174: Line 146:
## Lightning or slightly slower talks and roundtable discussion = Lightning or slightly slower talks and roundtable discussion =
Line 176: Line 148:
### Teaching coding theory (Wednesday afternoon) == Teaching coding theory (Wednesday afternoon) ==
Line 178: Line 150:
- 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???)
 * 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???)
Line 184: Line 156:
- 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
 * 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.
 * 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
 * Razvan Barbulescu wishes to use Sage (especially Cyclic codes in Sage) in his course at the preparatory school for the french ''agrégation de mathématiques''
Line 193: Line 168:
* 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
== Talks conducted ==
Line 197: Line 170:
### Talks conducted

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

### Proposed talks

-
Interactive documentation base (Miguel) https://riemann.unizar.es/sage-wiki
- Writing Sage documentation?: Xavier...
- parallel linear algebra

## Requested talks

Traduire
Traduire
 * Tutorial: contributing to Sage: git and trac (David): Daniel, Tania, Fangan Édouard : Fangan Édouard, Ricardo, Joe, Clément
  * done -> 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

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

Sprints on Coding theory

  • Review open coding theory tickets, see #18846 : David, Johan Édouard, Julien (Cyclic codes, BCH codes), Daniel, Clément, Arpit

    • #20342 as author (David) -> Open for review

    • #20100 Cyclic code (Julien) work in progress
    • #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 -> needs review

    • #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

  • Finish the implementation of Golay codes: David, Tania, Arpit -> open for review

  • 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) -> WIP, see #21339

  • 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, Joe, David. Some details follow:
    • 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.

    • A lot of changes and improvements were made to the documentation of the ticket.
    • In needs_review now
  • 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): in needs_review
  • Interpolation and minimal vanishing poly for skew polys #21131
    • Working on rewriting history. Otherwise pretty close to setting needs_review.
  • Abstract base class for Rank Metric Codes #21226
    • Add documentation and remaining methods.
  • Gabidulin Code + decoder: #20970

Algebra

  • 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:

  • List decoding should return empty list instead of None when no codeword is found: needs review http://trac.sagemath.org/ticket/21347

  • 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 ;-))

Linear Algebra

Other

Lightning or slightly slower talks and roundtable discussion

Teaching coding theory (Wednesday afternoon)

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

  • Razvan Barbulescu wishes to use Sage (especially Cyclic codes in Sage) in his course at the preparatory school for the french agrégation de mathématiques

Talks conducted

  • Tutorial: contributing to Sage: git and trac (David): Daniel, Tania, Fangan Édouard : Fangan Édouard, Ricardo, Joe, Clément
    • done -> 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

days75/status-report (last edited 2016-08-29 14:20:26 by bruno)