Selected Topics of Coding Theory
Seminar
Piotr Chołda
Department of Telecommunications
Outline
1
Course Rules
Seminar in Selected Topics of Coding Theory
2/16
Teacher’s Data
Piotr Chołda, Dr.habil.
I Pavilion D-5, groundfloor, room 015
U After setting an appointment via e-mail
T (+48 12 617–)40–36
B [email protected]
m http://www.cholda.pl/teaching
Seminar in Selected Topics of Coding Theory
3/16
Purpose of the Course
To get knowledge on the contemporary coding.
To practice to learn on her/his own.
To exercise to prepare presentations, moderate discussion etc.
Seminar in Selected Topics of Coding Theory
4/16
Connection between Me and You
Representative (starosta):
Mr. Jakub Nawała
Seminar in Selected Topics of Coding Theory
5/16
How to Get a Credit (1)
NINE (9) meetings:
TWO (2) introductory meetings led by the teacher (basics of
the coding theory),
SIX (6) seminar meetings led by the students (independent
two per meeting) on the basis of the readings,
ONE (1) backup meeting.
Calendar is presented at the course webpage.
Presence is obligatory (up to three absences are allowable).
All the attendees are required to get acquainted with the
readings, even if they are not presenting.
Seminar in Selected Topics of Coding Theory
6/16
How to Get a Credit (2)
We base on the readings from the books.
Each attendant has to prepare one presentation to lead the
discussion on selected topics.
Duties of the presenter:
A presentation should be prepared for 45 minutes (appr. 25
slides).
A presentation must be prepared in the LATEX beamer class
(since there is a lot of mathematics): a link to the template is
given at the course webpage.
A set of slides must be sent to the teacher at last a week
before the scheduled presentation.
A concept of the discussion with the classmates should be
prepared: appr. 15 minutes of discussion (e.g. how to
implement, where the presented issues are or can be used in
current practice).
Seminar in Selected Topics of Coding Theory
7/16
How to Get a Credit (3)
The regular and advisable method to obtain the credit:
No more absences than three.
Provisioning the slides to the teacher on time (Wednesday,
11.59PM , a week prior to the presentation) and in the required
format.
Taking into account all the suggestions given by the teacher to
the initial version of the presentation.
Presentation of the scheduled topic to the classmates and
leading the discussion after the presentation.
Grade: based on the assessment of the teacher and a group:
max{m, n},
where:
m: is the grade proposed by the teacher,
n is the median of the grades proposed by other participants of
the course.
Seminar in Selected Topics of Coding Theory
8/16
How to Get a Credit (4)
The irregular and non-desirable way to obtain the credit:
Necessary when a student fails to conform to any of the
previously given condition.
Still: necessity to present the scheduled topic to the classmates
and leading the discussion (most probably the group will be
forced to find an additional meeting term).
Need to pass a test covering all the topics of the seminar (30
questions, 30 minutes).
Grade: according to the test results.
Seminar in Selected Topics of Coding Theory
9/16
Readings
WEL: Dominic Welsh. Codes and Cryptography.
Clarendon Press, Oxford, UK, 1988.
MOO: Todd K. Moon. Error Correction Coding.
John Wiley & Sons, Inc., Hoboken, NJ, 2005.
YEU: Raymond W. Yeung, Shuo-Yen Robert Li, Ning Cai,
and Zhen Zhang. Network Coding Theory.
now Publishers Inc., Delft, The Netherlands, 2006.
The books are available at a teacher and can be borrowed for scan,
xero, etc. (only via the group representative).
Seminar in Selected Topics of Coding Theory
10/16
Topics for Selection
The Selected Topics Should be Presented in the Given Order
For the topics numbered in a series (such as ‘Topic A (1)’, ‘Topic
A (2)’, . . . ), a topic number (n + 1) must not be selected if topic
number (n) is not selected!
MOO, chapters 1.1-1.5: A Context for Error Correction Coding (1).
MOO, chapters 1.6-1.10: A Context for Error Correction Coding (2).
MOO, chapters 1.11-1.12: A Context for Error Correction Coding (3).
WEL, chapter 1: Entropy = uncertainty = information.
WEL, chapter 2: The noiseless coding theorem for memoryless sources.
WEL, chapter 3: Communication through noisy channels.
MOO, chapters 2.1-2.2: Groups.
MOO, chapters 2.3-2.4: Fields and Vector Spaces.
WEL, chapters 4.1-4.5: Error-correcting codes: linear codes.
MOO, chapters 3.1-3.4: Linear Block Codes (1).
WEL, chapters 4.6-4.8: Error-correcting codes: advanced linear codes.
MOO, chapters 3.5-3.9: Linear Block Codes (2).
MOO, chapters 4.1-4.5: Rings.
MOO, chapters 4.6-4.8: Cyclic Codes (1).
Seminar in Selected Topics of Coding Theory
11/16
Topics for Selection (cont.)
The Selected Topics Should be Presented in the Given Order
MOO, appendix 4.A, chapters 4.9-4.10: Cyclic Codes (2).
MOO, chapters 4.11-4.13: Cyclic Codes (3).
WEL, chapter 5: General sources.
WEL, chapter 6: The structure of natural languages.
WEL, chapter 7: Cryptosystems.
WEL, chapter 8: The one-time pad and linear shift-register sequences.
WEL, chapter 9: Computational complexity.
WEL, chapter 10: One-way functions.
MOO, chapters 5.1-5.3: Rudiments of Number Theory.
WEL, chapter 11: Public-key cryptosystems.
WEL, chapter 12: Authentication and digital signatures.
WEL, chapter 13: Randomized encryption.
MOO, chapters 5.4-5.5: BCH Codes (1).
MOO, chapters 5.6-5.8: BCH Codes (2).
MOO, appendix 5.A, chapters 5.9-5.12: BCH Codes (3).
MOO, chapters 6.1-6.2: BCH Codes (4).
MOO, chapters 6.3-6.4: BCH Codes (5).
MOO, chapters 6.5-6.7: BCH Codes (6).
MOO, chapters 6.8-6.9: BCH Codes (7).
Seminar in Selected Topics of Coding Theory 12/16
Topics for Selection (cont.)
The Selected Topics Should be Presented in the Given Order
MOO, chapter 8: Other Important Block Codes.
MOO, chapter 9: Bounds on Codes.
MOO, chapter 10: Bursty Channels.
MOO, chapter 11: Soft Decoding.
MOO, chapter 12.1: Convolutional Codes (1).
MOO, chapters 12.2, 12.6-12.7: Convolutional Codes (2).
MOO, chapters 12.3-12.4: Decoding of Convolutional Codes (1).
MOO, chapter 12.5: Decoding of Convolutional Codes (2).
MOO, chapters 12.8-12.10: Decoding of Convolutional Codes (3).
MOO, chapters 13.1-13.3: Trellis Coded Modulation (1).
MOO, chapters 13.4-13.6: Trellis Coded Modulation (2).
MOO, chapters 13.7-13.8: Trellis Coded Modulation (3).
MOO, chapters 14.1-14.3.14: Turbo Codes (1).
MOO, chapters 14.3.15-14.7: Turbo Codes (2).
MOO, chapters 15.1-15.4: LDPC Codes (1).
MOO, chapters 15.5-15.8: LDPC Codes (2).
MOO, chapters 15.9-15.14: LDPC Codes (3).
MOO, chapters 17.1-17.3: Space-Time Codes (1).
MOO, chapters 17.4-17.7: Space-Time Codes (2).
Seminar in Selected Topics of Coding Theory 13/16
Topics for Selection (cont.)
The Selected Topics Should be Presented in the Given Order
YEU, chapters 1-2.1: Network Coding (1).
YEU, chapters 2.2-2.3: Network Coding (2).
YEU, chapters 2.4-2.5: Network Coding (3).
YEU, chapter 3: Network Coding (4).
YEU, chapter 4: Network Coding (5).
YEU, chapter 5: Network Coding (6).
YEU, chapter 6: Network Coding (7).
YEU, chapter 7: Network Coding (8).
Seminar in Selected Topics of Coding Theory
14/16
Next steps
Today and the next meeting: teacher’s introduction to the
information and coding theory.
You: with the given Google Docs document cover the topics.
The deadline for the declarations: Wednesday, October 12th ,
11.59PM .
The presentations are performed in the given order scheduled
in the previous slide. The non-covered topics are just skipped.
The final schedule with the presenters will be given at the
teacher’s webpage.
The first seminar meeting: Wednesday, October 26th .
The first two presentations must be sent to the teacher a
week before, on Wednesday, October 19th .
Seminar in Selected Topics of Coding Theory
15/16
Any questions about the
rules?
Seminar in Selected Topics of Coding Theory
16/16