Please note! Course description is confirmed for two academic years, which means that in general, e.g. Learning outcomes, assessment methods and key content stays unchanged. However, via course syllabus, it is possible to specify or change the course execution in each realization of the course, such as how the contact sessions are organized, assessment methods weighted or materials used.

LEARNING OUTCOMES

Credits: 5

Schedule: 20.04.2022 - 25.05.2022

Teacher in charge (valid for whole curriculum period):

Teacher in charge (applies in this implementation): Camilla Hollanti

Contact information for the course (applies in this implementation):

Instructor: Erik Hieta-aho
Email: erik.hieta-aho@aalto.fi

The best way to contact me will be through email. I will typically be able to respond quite quickly during the week days. Evenings and weekends my responses will most likely be delayed till the next working weekday. As I live in Tampere I will be commuting to Helsinki on the days that we have lectures, so I won't be on campus everyday. 

CEFR level (valid for whole curriculum period):

Language of instruction and studies (applies in this implementation):

Teaching language: English. Languages of study attainment: English

CONTENT, ASSESSMENT AND WORKLOAD

Content
  • applies in this implementation

    This course is designed to introduce error correcting coding theory and explore a variety of examples of codes to then introduce algebraic geometry codes. A few of the famous examples that will be covered are the Hamming, cyclic, BCH, and Reed-Solomon codes. With some of the the constructed examples we will then introduce algebraic geometry codes, also known as geometric Goppa codes. There are a few bounds that will also be discussed especially with respect to the algebraic geometry codes. 

Assessment Methods and Criteria
  • applies in this implementation

    Course Structure:
    The weekly lectures and exercise sessions will be in person though there will be streaming and recordings available (as long as technology allows). 

    There will be weekly assignments which will be graded on a scale of 0-5. The weights of the assignments will depend on the topic and difficulty. Assignments will be due at the beginning of the following weeks first lecture (submission preferably online). 

    Final Project:
    During exams week everyone will be required to take part in a 20 minute presentation on a chosen topic. A list of recommended topics will be provided to choose from. You are welcome to choose a topic that is not listed but you must receive my approval first. I will do my best to get you the list of topics by the end of the second week (April 29th) and you should make sure to send me your chosen topic before the end of the fourth week (May 13th). 

DETAILS

Study Material
  • applies in this implementation

    This course will be implementing multiple references for its material. 

    One primary source that will be referenced often is the following: 
    'Fundamentals of Error Correcting Codes' by Huffman and Pless, Cambridge University Press, 2003 

    Here is a list of other references:
    'Algebraic geometry codes' by Tom Høholdt, Jacobus H. van Lint and Ruud Pellikaan In the Handbook of Coding Theory, vol 1, pp. 871-961, (V.S. Pless, W.C. Huffman and R.A. Brualdi Eds.), Elsevier, Amsterdam 1998. 

    'Introduction to Coding Theory' by J.H. van Lint, Springer 1982

    Preliminary Coding Theory Text:
    'Coding Theory and Cryptography, The Essentials' 2nd Edition, Revised and Expanded by Handerson, Hoffman, Leonard, Lindner, Phelps, Rodger, Wall. CRC Press 2000

Substitutes for Courses
Prerequisites

FURTHER INFORMATION

Details on the schedule
  • applies in this implementation