Ders Planı

CLASS 4

Lesson plan / INTRODUCTION TO CODING THEORY

Lesson Information

Course Credit	3.0
Course ECTS Credit	5.0
Teaching Language of Instruction	Türkçe
Level of Course	Bachelor's Degree, TYYÇ: Level 6, EQF-LLL: Level 6, QF-EHEA: First Cycle
Type of Course	Programme Elective
Mode of Delivery	Face-to-face
Does the course require compulsory or optional work experience?	S
Course Coordinator
Instructor (s)
Course Assistant

Purpose and Content

The aim of the course	This course aims to give the basic definitions of the coding theory, basic problems in coding theory.
Course Content	This course covers Error Detection, Error Correction and Decoding; communication channels, maximum likelihood decoding, hamming distance, distance of a code, Finite Fields; fields, polynomial rings, structure of finite fields, minimal polynomials. Linear Codes; vector spaces over finite fields, hamming weight, bases for linear codes, generator matrix and parity-check matrix, equivalence linear code, encoding and decoding of linear codes, syndrome decoding. Bounds in Coding Theory, Construction of Linear Codes; Propagation rules, Reed-Mullercode, Cyclic Codes; BCH codes, Reed-Solomon codes, Goppa Codes.

The aim of the course

This course aims to give the basic definitions of the coding theory, basic problems in coding theory.

Course Content

This course covers Error Detection, Error Correction and Decoding; communication channels, maximum likelihood decoding, hamming distance, distance of a code, Finite Fields; fields, polynomial rings, structure of finite fields, minimal polynomials. Linear Codes; vector spaces over finite fields, hamming weight, bases for linear codes, generator matrix and parity-check matrix, equivalence linear code, encoding and decoding of linear codes, syndrome decoding. Bounds in Coding Theory, Construction of Linear Codes; Propagation rules, Reed-Mullercode, Cyclic Codes; BCH codes, Reed-Solomon codes, Goppa Codes.

Learning Outcomes

Have advanced theoretical and practical knowledge in mathematics and computer science.
Gain an in-depth knowledge on Computer Science including computer programming, word processing, database functions, accessing the internet and softwares.
Possess the knowledge of advanced research methods in mathematics-computer field.
Possess theoretical and practical knowledge in mathematics, computation and computer science.
Define computer programming, word processing, data functions, internete access and software programs.
Describe advanced research methods in the field of Mathematics-Computer Science.
Evaluate and interpret data using the knowledge and skills gained in the fields of mathematics and computer science.
Identify, define and analyze problems in the fields of mathematics and computer science; develop solutions based on research and evidence.
Identify, define and model mathematics, computation and computer science problems; select and apply appropriate analysis and modeling methods for this purpose.
Design and apply interactive experimental environments to get the definitions and first solutions of the problems of computer science and computer science and evaluate these environments.
Having the discipline of mathematics, understand the operating logic of the computer and gain the ability to think based on account.
Perform all phases of life cycle in computer based systems.
Work effectively as an individual and as a team member to solve problems in the areas of mathematics and computer science.
Have the ability to act independently, use initiative and creativity.
Work effectively either individually or in multidisciplinary teams.
Evaluate advanced knowledge and skills in the field with a critical approach.
Follow current developments about the awareness of the necessity of continuous professional development and information and communication technologies.
Have the consciousness of the necessity of lifelong learning and continuously develop professional knowledge and skills.
Use the time effectively in the process of getting the conclusion with analytical thinking ability.
Have at least one foreign language knowledge and the ability to communicate effectively in Turkish, verbally and in writing.
Be aware of the effects of information applications on individual, institutional, social and universal dimensions and have the awareness about entrepreneurship, innovation.
Have the awareness of professional and ethical responsibility and legal consequences of information applications
Use the knowledge about the field for the benefit to society.

Weekly Course Subjects

1	Introduction; communication channel, distance, error detecting, correcting error, decoding
2	Review of abstract algebra; polynomial rings, finite field, minimal polynomials
3	Vector Spaces over finite fields
4	Linear Coding, Hamming weight, finding bases for linear codes, generator and parity check matrices
5	Coding and decoding of linear codes
6	Bounds, Lower bound, Sphere-Covering bounds, Gilbert-Varshamov bounds, Hamming bounds, Singleton bounds, Plotkin bounds
7	Hadamard Matrices codes, construction of linear codes
8	Reed Muller codes
9	Midterm
10	Cyclic codes
11	Cyclic codes
12	BCH codes
13	Goppa Codes
14	Reed Solomon Codes

Resources

1 - San Ling & Chaoping Xing, Coding theory. A first course. Cambridge University Press, Cambridge, 2004.
2 - W. Cary Huffman & Vera Pless, Fundamentals of error-correcting codes. Cambridge University Press, Cambridge, 2003.
3 - Wade Trappe, Lawrence C. Washington, Introduction to Cryptography with Coding Theory.

CLASS 1

CLASS 2

CLASS 3

CLASS 4

Lesson Information

Purpose and Content

Learning Outcomes

Weekly Course Subjects

Resources

ABOUT IAU

COMMITTEE

PUBLICATIONS

MEDIA CENTER