Web page of Dmytro Savchuk |
# | Due on | Problems to solve | Problems to submit |
---|---|---|---|
1 | R 9/11 |
If you wish, you may use a computer. Then include the code in the solution. Section 2.13: 1, 2, 5, 6, 10, 11, 13, 15 Section 2.14: 1, 4, 8 |
Section 2.13: 5 Section 2.14: 4 Personal problem received via email |
2 | R 9/18 |
Section 3.13: 1, 2, 12, 13, 16, 18, 35, 36a, 38 Section 3.14: 1, 2, 3, 5, 10 Section 6.8: 1, 2, 4, 7, 10 |
Section 3.13: 13 (by hands) Section 3.14: 5 Section 6.8:7 |
3 | R 10/7 |
Section 6.8: 15, 16, 18, 27 Section 6.9: 1, 2, 4, 10, 13 |
Section 6.8: 16 Section 6.9: 10 Personal problem in Canvas |
4 | T 10/21 |
Section 6.8: 12, 13, 14 Section 6.9: 6, 7 Section 7.6: 1, 2, 3, 4, 5, 6, 7 Section 7.7: 2, 3, 4 |
Personal problem in Canvas (based on 6.8.14) Section 7.6: 4 (+ prove that 2 is a primitive root mod 19), 5 |
Here is the list of suggested projects | |||
5 | R 10/23 |
Section 7.6: 10, 11, 12 |
No need to submit - just solve before the test |
6 | T 11/4 |
Section 9.6: 1, 2, 4, 6 Section 9.7: 1, 2, 3 Section 8.8: 1, 3, 4, 5 Section 8.9: 1, 2 |
Section 9.6: 6 Section 8.8: 3 - Personal problem in Canvas over BSGS and Diffie-Hellman - Create a pair of keys using enigmail and upload your open key to the server pool.sks-keyservers.net. Send me an encrypted email using emigmail and my open key found on the same server. After this I will reply to your email with a simple arithmetic problem and ask you to send me an answer. |
7 | R 11/20 |
Section 18.12: 1, 2, 3, 4, 5, 6 |
Section 18.12: 3 - Prove that there is no (8,7,5) binary code. - Is that always possible to add more codewords to (8,27,2) binary code without changing its minimal distance? |
8 | Final |
I will not collect this homework. Section 18.12: 7, 9, 10, 17 Section 18.13: 2 |
Updated:
December 02nd, 2014
Back to course page