Changes between Version 48 and Version 49 of Ticket #18846


Ignore:
Timestamp:
06/29/16 11:57:26 (5 years ago)
Author:
dlucas
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #18846 – Description

    v48 v49  
    77- implement numerous code families, alongside their encoders and decoders
    88
    9 The following table gives a quick access to all tickets related to the project.
     9The following tables gives a quick access to all tickets related to the project:
     10
     11- The first table contains references to every ticket adding major features, like new code families, decoders...
     12- The second table contains references to every small ticket: bug fixes, minor quality of life upgrades, etc
     13- The last table contains references to every ticket which has been positive reviewed and/or closed.
     14
    1015
    1116The `Nature` column gives the "type" of the ticket :
     
    1621- `Enhancement` means it's a ticket which makes some existing code better, either in matter of speed or design.
    1722
     23
     24= Major features =
     25
     26
    1827|| Topic || Ticket number || Nature ||
    1928|| Linear codes and category framework || #18150|| Structure||
     29|| A class for subfield subcodes || #20039|| Content||
     30|| A class for cyclic codes || #20100|| Content||
     31|| Information set decoder || #20138|| Content||
     32|| A class for BCH codes || #20335|| Content||
     33|| Benchmarking tool for codes || #20526|| Content||
     34|| A class for Golay codes || #20787|| Content||
     35|| A class for a generic systematic encoder || #20835|| Content||
     36|| Base classes for Reed-Muller codes || #20705|| Content||
     37
     38= Small tickets =
     39
     40
     41|| Topic || Ticket number || Nature ||
     42|| Non-guava impl. for `covering_radius` || #19913|| Cleanup||
     43|| Clean `LinearCodeFromCheckMatrix` || #19975|| Cleanup||
     44|| Stop and restart features for benchmarks || #20684|| Content||
     45|| Multithread option for benchmarks || #20786|| Content||
     46|| Document decoder types || #20001|| Documentation||
     47|| Improve `grs.py`'s documentation || #20849|| Documentation||
     48|| `encode` as application to `Encoder` || #20087|| Enhancement||
     49|| Method for the rate of a linear code || #20342|| Enhancement||
     50||  `AbstractLinearCode.minimum_distance` fails with GAP message for large fields || #20233|| Bug||
     51|| `decoder_type` only works on class instances || #20443|| Bug||
     52|| GRS polynomial encoder fails if polynomial to encode is not in `x` || #20744|| Bug||
     53|| Deprecate support for finite rings in `LinearCode` || #20387|| Defect||
     54|| Syndrome decoder for a linear code sometimes sets wrong decoder type || #20898|| Defect||
     55|| `AbstractLinearCode` should throw sensible error messages on printing || #20899|| Defect||
     56|| `LinearCode.basis()` should be an immutable Sequence || #19251|| Defect||
     57
     58= Old tickets =
     59
     60
     61|| Topic || Ticket number || Nature ||
    2062|| Structure for code families || #18099|| Structure||
    2163|| Encoding structure || #18376|| Structure||
     
    2769|| Generic impl. for `__ne__` || #19743|| Cleanup||
    2870|| Clean-up index of modules || #19907|| Cleanup||
    29 || Non-guava impl. for `covering_radius` || #19913|| Cleanup||
    30 || Clean `LinearCodeFromCheckMatrix` || #19975|| Cleanup||
    3171|| Clean `AbstractLinearCode.zero` || #20113|| Cleanup||
    3272|| Better checks in GRS decoders || #20177|| Cleanup||
     
    4181|| Syndrome decoder is a nearest neighbor decoder || #19623|| Content||
    4282|| A proper class for Hamming codes || #19930|| Content||
    43 || A class for subfield subcodes || #20039|| Content||
    44 || A class for cyclic codes || #20100|| Content||
    4583|| A class for extended codes || #20124|| Content||
    46 || Information set decoder || #20138|| Content||
    4784|| A class for non-prime fields embedding || #20284|| Content||
    48 || A class for BCH codes || #20335|| Content||
    49 || Benchmarking tool for codes || #20526|| Content||
    50 || Stop and restart features for benchmarks || #20684|| Content||
    51 || Multithread option for benchmarks || #20786|| Content||
    52 || Base classes for Reed-Muller codes || #20705|| Content||
    53 || A class for Golay codes || #20787|| Content||
    54 || A class for a generic systematic encoder || #20835|| Content||
    5585|| API thematic tutorial || #19745|| Documentation||
    5686|| Introductory thematic tutorial || #19897|| Documentation||
    57 || Document decoder types || #20001|| Documentation||
    58 || Improve `grs.py`'s documentation || #20849|| Documentation||
    59 || `encode` as application to `Encoder` || #20087|| Enhancement||
    6087|| `LinearCode(C)` for some code `C` should construct a code || #20198|| Enhancement||
    61 ||  Rewrite module doc of `LinearCode` || #20232|| Enhancement||
    62 || Method for the rate of a linear code || #20342|| Enhancement||
     88|| Rewrite module doc of `LinearCode` || #20232|| Enhancement||
    6389|| Improve efficiency of nearest neighbor decoder || #20201|| Enhancement||
    6490|| Automatically register generic encoders/decoders in any code family || #20840|| Enhancement||
    6591|| Fix LinearCode.wtdist_gap method || #20565|| Defect||
    66 ||  `AbstractLinearCode.minimum_distance` fails with GAP message for large fields || #20233|| Bug||
    67 || `decoder_type` only works on class instances || #20443|| Bug||
    68 || GRS polynomial encoder fails if polynomial to encode is not in `x` || #20744|| Bug||
    69 || Deprecate support for finite rings in `LinearCode` || #20387|| Defect||
    70 || Syndrome decoder for a linear code sometimes sets wrong decoder type|| #20898|| Defect||
    71 || `AbstractLinearCode` should throw sensible error messages on printing|| #20899|| Defect||
    72 || `LinearCode.basis()` should be an immutable Sequence|| #19251|| Defect||