Compare

Quick Facts

Medium Of InstructionsMode Of LearningMode Of Delivery
EnglishSelf StudyVideo Based

Courses and Certificate Fees

Fees InformationsCertificate AvailabilityCertificate Providing Authority
INR 1000yesIIT Kanpur

The Syllabus

  • Lecture 1: Introduction to error control coding
  • Lecture 2: Introduction to linear block codes, generator matrix and parity check matrix
  • Lecture 3: Properties of linear block codes: Syndrome, error detection

  • Lecture 4: Decoding of linear block codes
  • Lecture 5: Distance properties of linear block codes

  • Lecture 6: Some simple linear block codes: Repetition codes, Single parity check codes, Hamming codes, Reed Muller codes
  • Lecture 7: Bounds on size of codes: Hamming bound, Singleton bound, Plotkin bound, Gilbert-Varshamov bound

  • Lecture 8: Introduction to convolutional codes-I: Encoding, state diagram, trellis diagram
  • Lecture 9: Introduction to convolutional codes-II: Classification, realization, distance properties
  • Lecture 10: Decoding of convolutional codes-I: Viterbi algorithm

  • Lecture 11: Decoding of convolutional codes-II: BCJR algorithm
  • Lecture 12: Performance bounds for convolutional codes

  • Lecture 13: Low density parity check codes
  • Lecture 14: Decoding of low density parity check codes: Belief propagation algorithm on BSC and AWGN channels

  • Lecture 15: Turbo codes
  • Lecture 16: Turbo decoding

  • Lecture 17: Distance properties of turbo codes
  • Lecture 18: Convergence of turbo codes 
  • Lecture 19: Automatic repeat request schemes
  • Lecture 20: Applications of linear codes

Instructors

Student Community: Where Questions Find Answers

Ask and get expert answers on exams, counselling, admissions, careers, and study options.