 |
||||
 |
Home> Course Search> |
|||
|
Search Results |
|||
|
||||
| Information Theory and Coding -- Electrical Engineering (EL ENG) 229A [3 units] | ||||
| Course Format: Three hours of lecture per week. | ||||
| Prerequisites: 226 recommended, Statistics 200A or equivalent. | ||||
| Formerly 229 | ||||
| Description: Fundamental bounds of Shannon theory and their application. Source and channel coding theorems. Galois field theory, algebraic error-correction codes. Private and public-key cryptographic systems. | ||||
| Offered alternate years. (SP) Anantharam, Tse |
||||
| |
||||
| Error Control Coding -- Electrical Engineering (EL ENG) 229B [3 units] | ||||
| Course Format: Three hours of lecture per week. | ||||
| Prerequisites: 126 or equivalent (some familiarity with basic probability). Prior exposure to information theory not necessary. | ||||
| Description: Error control codes are an integral part of most communication and recording systems where they are primarily used to provide resiliency to noise. In this course, we will cover the basics of error control coding for reliable digital transmission and storage. We will discuss the major classes of codes that are important in practice, including Reed Muller codes, cyclic codes, Reed Solomon codes, convolutional codes, concatenated codes, turbo codes, and low density parity check codes. The relevant background material from finite field and polynomial algebra will be developed as part of the course. Overview of topics: binary linear block codes; Reed Muller codes; Galois fields; linear block codes over a finite field; cyclic codes; BCH and Reed Solomon codes; convolutional codes and trellis based decoding, message passing decoding algorithms; trellis based soft decision decoding of block codes; turbo codes; low density parity check codes. | ||||
| (SP) Anatharam |
||||
| |
||||
 |
||||
 |
||||
Copyright 2007 UC Regents. All rights reserved. Contact us. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * |
||||
