Changes between Version 9 and Version 10 of SageCodingRoadMap


Ignore:
Timestamp:
05/19/17 12:45:40 (2 years ago)
Author:
jsrn
Comment:

Cleaned up closed tickes

Legend:

Unmodified
Added
Removed
Modified
  • SageCodingRoadMap

    v9 v10  
    1818* Linear codes and category framework #18150
    1919* Deprecate support for finite rings in `LinearCode`  #20387
    20 * `AbstractLinearCode` should throw sensible error messages on printing  #20899
    21 * `LinearCode.basis()` should be an immutable Sequence  #19251
    2220
    2321The following is some wishes:
     
    3230
    3331* Reed--Muller codes
    34   * Base classes for Reed-Muller codes #20705
    3532  * Decoding algorithm for low-order q-ary or binary Reed-Muller codes #20938
    36 * Cyclic codes and BCH codes
    37   * A class for cyclic codes  #20100
    38   * A class for BCH codes  #20335
    3933* Goppa codes would be extremely nice to have.
    4034* AG codes
     
    4741== Other Code Families ==
    4842
    49 * Golay codes #20787.
     43* Open a ticket for your favourite code family and add it here.
    5044
    5145== Algorithms for generic codes ==
     
    5347* Information set decoder #20138
    5448* Non-guava implementation for `covering_radius` #19913
    55 * Rate of a linear code  #20342
    56 * Improve `minimum_distance` generic method  #20953
    57 * `AbstractLinearCode.minimum_distance` fails with GAP message for large fields  #20233
    58 * `dimension` fails if `_dimension` is not set  #21156 Bug
    5949* Bounds and optimal codes: Not very easy, no support yet. What to do with [[http://codetables.de]]?
    60 * Representing automorphisms of codes
     50* Representing automorphisms of codes.
    6151  Sage is reasonably good at computing automorphisms of codes with the methods
    6252  `automorphisms_group_gens`, ` permutation_automorphism_group`, and the related
     
    8373== Documentation ==
    8474
    85 * Document decoder types #20001
    86 * Improve `grs.py`'s documentation  #20849
    87 * Rework index and catalogs for sage.coding  #20908
    8875* Improve coding theory thematic tutorial on writing new structures  #21361
    8976* Improve the documentation for `HammingCode`  #21305
     
    9279
    9380* Link to advanced fast polynomial arithmetic library functions such as multi-point evaluation and Lagrange interpolation.
    94 * Link to fast GF(2)[x] library (currently used is NTL generic GF(p)[x]).
    95 * Asymptotically fast (GF(q)[x])[y] root-finding #21333.
    96 * Faster `k[x]` matrix reduction #21024, #16742.
     81* Link to fast `GF(2)[x]` library (currently used is NTL generic `GF(p)[x]`).
    9782* Ring extension support (related to e.g. subfield subcodes) #21413
    9883* Submodules of `(ZZ/nZZ)^r` (prerequisite for codes over `ZZ/nZZ`) #6452
     
    10186
    10287* Clean `LinearCodeFromCheckMatrix` #19975
    103 * `encode` as function call to an `Encoder`  #20087
    104 * `decoder_type` only works on class instances  #20443
    105 * GRS polynomial encoder fails if polynomial to encode is not in `x` #20744
    106 * Syndrome decoder for a linear code sometimes sets wrong decoder type  #20898
    107 * Cached generator/parity check matrices should be immutable  #21159
    10888
    10989== GSoC 2016: Rank metric codes ==
    11090Arpit Merchant was the student for this project, with David Lucas and Johan Rosenkilde as mentors.
    11191
    112 * Skew polynomials #13215
    113 * Interpolation/evaluation methods for skew polynomials  #21131
    11492* Advanced skew polynomial methods and optimised implementation for finite field
    11593  base rings #21088, #21259, #21262, #21264. Perhaps these should be closed as wont-fix: