Course

Credit Type:
Course
ACE ID:
NNCS-0697
Version:
4
Organization's ID:
MATH3330
Location:
Classroom-based
Length:
60 hours
Minimum Passing Score:
70
ACE Credit Recommendation Period:
Credit Recommendation & Competencies
Level Credits (SH) Subject
Upper-Division Baccalaureate 3 Algebraic Coding Theory
Description

Objective:

The course objective is to introduce information theory as well as classical and modern error-correcting codes for students with technical degree (mathematics, engineering, computer science, or physics).

Learning Outcomes:

  • design an implementation of an encoder or decoder for block codes
  • assess the limitations of a given error-correcting code
  • deduce the precise role that finite fields play in the design and implementation of error-correcting codes
  • assess the limitations of a given error-correcting code
  • illustrate the major connections of coding theory with linear recursive sequence theory and analysis
  • validate the tradeoffs between error correction capacity of a code
  • outline the major trends in error coding
  • evaluate mathematically, the major kinds of block codes used for error correction in digital communication

General Topics:

  • • Finite Fields • Block codes • Linear codes • Perfect codes • Cyclic codes • BCH codes • Reed-Solomon codes • Goppa codes • Convolutional codes • Parallel concatenated convolutional codes (PCCC) • Turbo Product codes (TPC) • Low Density Parity Check codes (LDPC) • Other applicable codes • Syndrome decoding • Berlekamp-Massy algorithm • Chien search • Viterbi decoding • Sequential decoding • BCJR algorithm • Min-Sum algorithm
Instruction & Assessment

Instructional Strategies:

  • Classroom Exercise
  • Discussion
  • Lectures
  • Practical Exercises

Methods of Assessment:

  • Other
  • exercise sets, classroom participation, programming exercises
Supplemental Materials
Equivalencies

Other offerings from National Cryptologic University