School of Mathematics
MA346D - Finite Fields and Coding theory
2011-12 (JS & SS Mathematics and TSM
)
Lecturer:
Dr. Timothy Murphy & Dr. Michael Purser
Requirements/prerequisites:
Duration: Hilary Term (10 weeks)
Number of lectures per week: 3 inclduing tutorials
Assessment:
ECTS credits: 5
End-of-year Examination: 2 hour exam in Trinity Term (May)
Description:
The initial part of the module will be on finite fields by Dr. T.
Murphy.
The last part of the module by Dr. Purser will be about
Error-correcting codes and is described in some detail at
http://www.maths.tcd.ie/~mpurser/
Notes for the finite fields part of the module can be found at
http://www.maths.tcd.ie/pub/Maths/Courseware/FiniteFields/GF.pdf
The topics covered are:
- The Prime Fields
- The Prime Subfield of a Finite Field
- Finite Fields as Vector Spaces
- Looking for GF(4)
- The Multiplicative Group of a Finite Field
- Polynomials over a Finite Field
- The Universal Equation of a Finite Field
- Uniqueness of the Finite Fields
- Existence of GF(pn)
- Automorphisms of a Finite Field
- Wedderburn's Theorem
- Irreducible Polynomials over a Prime Field
- Irreducible Polynomials over a Prime Field
Appendix A. Galois Theory
Appendix B. The Normal Basis Theorem
In outline the topics on error correcting codes are:
- Introduction:
Block Codes, Distance, Errors and Probabilities of
Detection and Correction
Sphere-packing Bound;
Shannon's Theorem
Linear Codes, Weight
Generator Matrix, Null Matrix, Standard Array, Syndromes;
Non-binary codes
-
Hamming Codes, Perfect Codes
Varsharmov-Gilbert and Plotkin Bounds;
Modulation, FSK, PSK, DPSK;
Symbols and Bits, Gray Coding;
Noise, SNRs and relation to error-probabilities;
Shannon for AWGN;
Erasures
-
Cyclic Codes, Generating Polynomial, Systematic Codes
Roots and the Null Matrix;
Error-detection, Weight Distribution;
Feedback Shift Registers:
Error-correction with Cyclic Codes, Kasami;
Non-binary Cyclic;
BCH Codes, Roots of Generating Polynomial and distance;
Minimum Polynomials;
Error-correction with BCH Codes
-
RS Codes
Error-correction with RS Codes;
Performance of RS Codes:
Convolutional Codes, Trellises;
Decoding and Viterbi;
Performance Analysis of Convolutional Codes
-
Trellis Code Modulation
Examples with PSK;
SNR Gain:
Coding for Phase Invariance;
Outline of CDMA
Jan 27, 2012
File translated from
TEX
by
TTH,
version 3.89.
On 27 Jan 2012, 22:03.