Changes between Version 9 and Version 10 of SageCodingRoadMap
 Timestamp:
 05/19/17 12:45:40 (5 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

SageCodingRoadMap
v9 v10 18 18 * Linear codes and category framework #18150 19 19 * Deprecate support for finite rings in `LinearCode` #20387 20 * `AbstractLinearCode` should throw sensible error messages on printing #2089921 * `LinearCode.basis()` should be an immutable Sequence #1925122 20 23 21 The following is some wishes: … … 32 30 33 31 * ReedMuller codes 34 * Base classes for ReedMuller codes #2070535 32 * Decoding algorithm for loworder qary or binary ReedMuller codes #20938 36 * Cyclic codes and BCH codes37 * A class for cyclic codes #2010038 * A class for BCH codes #2033539 33 * Goppa codes would be extremely nice to have. 40 34 * AG codes … … 47 41 == Other Code Families == 48 42 49 * Golay codes #20787.43 * Open a ticket for your favourite code family and add it here. 50 44 51 45 == Algorithms for generic codes == … … 53 47 * Information set decoder #20138 54 48 * Nonguava implementation for `covering_radius` #19913 55 * Rate of a linear code #2034256 * Improve `minimum_distance` generic method #2095357 * `AbstractLinearCode.minimum_distance` fails with GAP message for large fields #2023358 * `dimension` fails if `_dimension` is not set #21156 Bug59 49 * 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. 61 51 Sage is reasonably good at computing automorphisms of codes with the methods 62 52 `automorphisms_group_gens`, ` permutation_automorphism_group`, and the related … … 83 73 == Documentation == 84 74 85 * Document decoder types #2000186 * Improve `grs.py`'s documentation #2084987 * Rework index and catalogs for sage.coding #2090888 75 * Improve coding theory thematic tutorial on writing new structures #21361 89 76 * Improve the documentation for `HammingCode` #21305 … … 92 79 93 80 * Link to advanced fast polynomial arithmetic library functions such as multipoint 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] rootfinding #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]`). 97 82 * Ring extension support (related to e.g. subfield subcodes) #21413 98 83 * Submodules of `(ZZ/nZZ)^r` (prerequisite for codes over `ZZ/nZZ`) #6452 … … 101 86 102 87 * Clean `LinearCodeFromCheckMatrix` #19975 103 * `encode` as function call to an `Encoder` #20087104 * `decoder_type` only works on class instances #20443105 * GRS polynomial encoder fails if polynomial to encode is not in `x` #20744106 * Syndrome decoder for a linear code sometimes sets wrong decoder type #20898107 * Cached generator/parity check matrices should be immutable #21159108 88 109 89 == GSoC 2016: Rank metric codes == 110 90 Arpit Merchant was the student for this project, with David Lucas and Johan Rosenkilde as mentors. 111 91 112 * Skew polynomials #13215113 * Interpolation/evaluation methods for skew polynomials #21131114 92 * Advanced skew polynomial methods and optimised implementation for finite field 115 93 base rings #21088, #21259, #21262, #21264. Perhaps these should be closed as wontfix: