# Course

Course Summary
Credit Type:
Course
ACE Course Number:
NNCS-0697
Organization Course Number:
MATH3330
Location:
Classroom-based
Length:
8 days (60 hours)
Dates Offered:
Credit Recommendation & Competencies
Level Credits (SH) Subject
Upper-Division Baccalaureate 3 Mathematics, Computer Science, or Coding Theory
Description

## Objective:

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

## Learning Outcomes:

• Evaluate mathematically , the major kinds of block codes used for error correction in digital communication
• Design and implementation of an encoder or decoder for block codes
• Assess the limitations of a given error-correcting code
• Validate the tradeoffs between error correction capacity of a code
• As well as outline the major trends in error coding
• Deduce the precise role that finite fields play in the design and implementation of error-correcting codes
• Illustrate the major connections of coding theory with linear recursive sequence theory and analysis

## General Course Topics:

• Block codes
• Linear codes
• Perfect codes
• Cyclic codes
• SCH codes
• Reed-Solomon codes
• Convolutional codes
• Parallel concatenated convolutional codes (PCCC)
• Turbo product codes (TPC)
• Low density parity check codes (LDPC)
• Syndrome decoding
• Berlekamp-Massy algorithm
• Chien search
• Viterbi decoding
• Sequential decoding
• BCJR algorithm
• Min-Sum algorithm
Instruction & Assessment

## Instructional Strategies:

• Discussion
• Lectures
• Practical Exercises

## Minimum Passing Score:

70%
Supplemental Materials