8 | | This ticket proposes a complete rework of this tutorial, which, instead of listing methods and constructions, gives some clues on how to build generic linear codes and perform standard operations (encoding, decoding, adding errors in words) for people working on coding theory. |
9 | | It also explains to the user how to find any method and construction he needs. |
10 | | Furthermore, it keeps things simple and never goes into technical details, or advanced scientific notions, preferring in that case to redirect the interested reader to manual pages instead. |
11 | | ---- |
12 | | New commits: |
13 | | ||[http://git.sagemath.org/sage.git/commit/?id=baa9f20fa041ece4f2c3d5eb3f76af74334ff2ce baa9f20]||{{{First version of the tutorial}}}|| |
14 | | ||[http://git.sagemath.org/sage.git/commit/?id=cb653141eced7deabf3cecffe3ba28bb85498bdc cb65314]||{{{Update to latest beta}}}|| |
15 | | ||[http://git.sagemath.org/sage.git/commit/?id=2057fee08a6657d419272ee0a2ecbb1b73d95d0b 2057fee]||{{{Small fixes and improvements}}}|| |
| 7 | - New decoders #19653 will introduce have interesting properties wrt their message space. I made this ticket a dependency of #19653 and created a new paragraph related to decoders and message spaces in #19653. |