Instructor: : Z. Reichstein
Office: 1105 Math Annex
Office hour during final exam period:
Thursday, April 12, 2-3 (in Math Annex 1105)
Friday, April 13, 3-4 (in Math Annex 1105 or 1102)
3-4 Monday, Apri 16, 11-1 (in Math Annex 1118)
- Textbook :
Raymond Hill, A first course in coding theory, Oxford University Press
- Registration : Questions regarding
registering for this class, switching sections, etc., should
be addressed to the Mathematics Department office staff,
Rm. 121 Mathematics Building.
- Course description :
Math 342 is an introduction to abstract algebra and error-correcting codes.
Both proof and algorithmic techniques will be emphasized. Topics will include coding and decoding schemes, finite fields, vector spaces over finite fields, linear codes, syndrome decoding, Hamming codes, coding bounds,
BCH codes and
- Notes. The following rough notes
are based on Math 342 notes created by my colleague Brian Marcus.
I am grateful to Brian for allowing me to modify his notes and adopt
them for my class. I am solely responsible for all typos, omissions and
other imperfections in these notes.
Notes for Lecture 1, Thursday, January 4
Notes for Lecture 2, Tuesday, January 9
Notes for Lecture 3, Thursday, January 11
Notes for Lecture 4, Tuesday, January 16
Notes for Lecture 5, Thursday, January 18
Notes for Lecture 6, Tuesday, January 23
Notes for Lecture 7, Thursday, January 25
Notes for Lecture 8, Tuesday, January 30
Notes for Lecture 9, Thursday, February 1
Notes for Lecture 10, Tuesday, February 6
Notes for Lecture 11, Tuesday, February 13
Notes for Lecture 12, Thursday, February 15
Notes for Lecture 13, Tuesday, February 27
Notes for Lecture 14, Thursday, March 1
Notes for Lecture 15, Tuesday, March 6
Notes for Lecture 16, Thursday, March 8
Notes for Lecture 17, Tuesday, March 13
Notes for Lecture 18, Tuesday, March 20
Notes for Lecture 19, Thursday, March 22
Notes for Lecture 20, Tuesday, March 27
Notes for Lecture 21, Thursday, March 29
Notes for Lectures 22 and 23, Thursday, March 29
will be assigned bi-weekly and collected in class. Late homework
will NOT be accepted. The lowest homework grade will be dropped.
Students are allowed to consult one another concerning homework problems,
but solutions submitted for credit must be written by the student in his or her own words. Copying solutions from another student, from the web or from any other source, and turning them in as your own is a violation of the Academic Code.
Problem Set 1, due Thursday, January 18
Solutions to Problem Set 1
Problem Set 2, due Thursday, February 1.
Extended to Tuesday, February 6.
Solutions to Problem Set 2
Problem Set 3, due Thursday, March 1.
Solutions to Problem Set 3
Problem Set 4, due Tuesday, March 13.
Solutions to Problem Set 4
Problem Set 5, due Tuesday, March 27.
Solutions to Problem Set 5
Problem Set 6, due Thursday, April 6.
Solutions to Problem Set 6
- Evaluation : Course mark will be based on
the homework, two midterms and the final exam.
The total course mark will be the higher of the following:
Total1 := HW (out of 20) + Midterm1 (out of 20) + Midterm2 (out of 20) + Final (out of 40) or
Total2 := HW (out of 20) + Best Midterm (out of 20) + Final (out of 60)
- Midterm exams will be held in class Thursday,
February 8 and Thursday, March 15.
The final exam for this class
is scheduled for 7pm on Tuesday, April 17.
Midterm 1 syllabus
Practice problems for Midterm 1
Solutions to practice problems for Midterm 1
Midterm 1 problems and solutions
Midterm 2 syllabus
Practice problems for Midterm 2
Solutions to practice problems for Midterm 2
Midterm 2 problems and solutions
- The final exam for this class
will be held 7-9:30pm in
WOOD 5 on Tuesday, April 17.
The final exam will cover everything we have done during the term. This
includes Chapters 1, 2 (except for block designs), 3, 4, 5, 6 (except for
probability of correction), 7, 8, 10 (Singleton bound only)
and 11 (up to and including Theorem 11.4).
You are also responsible for the topics which we covered more extensively
in class than they are covered in the book, such as
the Gilbert-Varshamov and Plotkin bouns, integers modulo n,
the Euclidean algorithm and echelon forms of matrices.
Practice problems for the final exam:
1.5, 2.1, 2.2, 2.3, 2.6, 2.17, 3.1, 3.3, 3.6, 4.2, 4.3, 5.2, 5.5,
5.12, 6.1, 7.2, 7.3, 7.5, 7.6, 7.7, 8.1, 8.3, 8.6, 11.1. The answers
are in the back of the book.
- Missed exam policy:
Please make sure you do not make travel plans, work plans,
etc., without regard to the examination schedule in this class.
There will be no make-up or alternate exams.
If you miss a midterm, your score will be
recorded as 0, unless you have a serious documented
reason (an illness, a death in the family, etc.), in which case you
should discuss your circumstances with me as soon as possible,
in advance of the test. Note that
you may still get a 100% in the course, even if you get
a score of 0 on one midterm (see the marking scheme above).
Missed finals are not handled by me or the Mathematics
Department. Students with legitimate reasons
for missing the final exam should request
a ``Standing Deferred" status through their faculty.
- Students with disabilities :
Please see the instructor early in the term if you need any
- Academic Integrity.
The Mathematics Department strictly enforces
UBC's Academic Integrity code.