This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
en:courses:2008-2009:mct_handouts [2009/04/08 10:18] admin created |
en:courses:2008-2009:mct_handouts [2016/06/23 11:26] (current) |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | An introduction to Coding Theory - Spring 2009 | + | ===== An introduction to Coding Theory - Spring 2009 ===== |
- | Exercises: | + | |
- | 26.02 Exercise 1 Solutions | + | |
- | 05.03 Exercise 2 Solutions | + | ==== Exercises: ==== |
- | 12.03 Exercise 3 Solutions | + | |
- | 19.03 Exercise 4 Solutions | + | | 26.02 | {{:en:courses:2008-2009:ct_ex1.pdf|Exercise 1}} | {{:en:courses:2008-2009:ct_ex1sol.pdf|Solutions 1}} | |
- | 26.03 Exercise 5 Solutions | + | | 05.03 | {{:en:courses:2008-2009:ct_ex2.pdf|Exercise 2}} | {{:en:courses:2008-2009:ct_ex2sol.pdf|Solutions 2}} | |
- | 02.04 Exercise 6 | + | | 12.03 | {{:en:courses:2008-2009:ct_ex3.pdf|Exercise 3}} | {{:en:courses:2008-2009:ct_ex3sol.pdf|Solutions 3}} | |
- | Lecture notes: | + | | 19.03 | {{:en:courses:2008-2009:ct_ex4.pdf|Exercise 4}} | {{:en:courses:2008-2009:ct_ex4sol.pdf|Solutions 4}} | |
- | 01: Basic Notation | + | | 26.03 | {{:en:courses:2008-2009:ct_ex5.pdf|Exercise 5}} | {{:en:courses:2008-2009:ct_ex5sol.pdf|Solutions 5}} | |
- | 02: Linear Codes | + | | 02.04 | {{:en:courses:2008-2009:ct_ex6.pdf|Exercise 6}} | {{:en:courses:2008-2009:ct_ex6sol.pdf|Solutions 6}} | |
- | 03: Bounds on codes | + | | 09.04 | {{:en:courses:2008-2009:ct_ex7.pdf|Exercise 7}} | {{:en:courses:2008-2009:ct_ex7sol.pdf|Solutions 7}} | |
- | 04: Evaluation codes | + | | 23.04 | {{:en:courses:2008-2009:ct_ex8.pdf|Exercise 8}} | {{:en:courses:2008-2009:ct_ex8sol.pdf|Solutions 8}} | |
- | 05: Decoding binary BCH codes | + | | 30.04 | {{:en:courses:2008-2009:ct_ex9.pdf|Exercise 9}} | {{:en:courses:2008-2009:ct_ex9sol.pdf|Solutions 9}} | |
- | 06: Reed-Solomon codes | + | | 07.05 | {{:en:courses:2008-2009:ct_ex10.pdf|Exercise 10}} | {{:en:courses:2008-2009:ct_ex10sol.pdf|Solutions 10}} | |
- | 07: The Displacement Method I | + | | 14.05 | {{:en:courses:2008-2009:ct_ex11.pdf|Exercise 11}} | {{:en:courses:2008-2009:ct_ex11sol.pdf|Solutions 11}} | |
- | 08: The Displacement Method II | + | | 28.05 | {{:en:courses:2008-2009:ct_ex12.pdf|Exercise 12}} | | |
- | 09: AG-codes I | + | |
- | 10: AG-codes II | + | ==== Lecture notes: ==== |
+ | |||
+ | | 01: | {{:en:courses:2008-2009:mct_l01.pdf | Basic Notation }}| | ||
+ | | 02: | {{:en:courses:2008-2009:mct_l02.pdf | Linear Codes }}| | ||
+ | | 03: | {{:en:courses:2008-2009:mct_l03.pdf | Bounds on codes }}| | ||
+ | | 04: | {{:en:courses:2008-2009:mct_l04.pdf | Evaluation codes }}| | ||
+ | | 05: | {{:en:courses:2008-2009:mct_l05.pdf | Decoding binary BCH codes }}| | ||
+ | | 06: | {{:en:courses:2008-2009:mct_l06.pdf | Reed-Solomon codes }}| | ||
+ | | 07: | {{:en:courses:2008-2009:mct_l07.pdf | The Displacement Method I }}| | ||
+ | | 08: | {{:en:courses:2008-2009:mct_l08.pdf | The Displacement Method II }}| | ||
+ | | 09: | {{:en:courses:2008-2009:mct_l09.pdf | AG-codes I }}| | ||
+ | | 10: | {{:en:courses:2008-2009:mct_l10.pdf | AG-codes II }}| |