Speaker: Mohammad Hossein Taghavi
Ph.D. Candidate
University of California, San Diego, USA
Local Organizer: Dr. Marvasti
Title: Codes on Graphs: Recent Advances
Time: Tuesday, October 16, 2007
Location: Department of Electrical Engineering, Sharif University of Technology, Tehran
Abstract and Presentation Slides:
The area of coding theory has been very dynamic during the last decade. As a major breakthrough, graph-based codes and iterative decoding techniques have enabled us to reliably transmit information through communication channels at rates much closer to the Shannon capacity than was possible using (classical) algebraic codes. However, this area is far from being sufficiently explored. For example, most theoretical results in this area are asymptotic — they hold only as the code length goes to infinity. Therefore, much of the current research in this area is focused on the finite-length performance analysis of graph-based codes. In this talk, we will briefly review coding on graphs and some recent advances and research trends in this rich and interdisciplinary field.
This talk is intended for students and researchers with backgrounds in communications, mathematics, or statistical physics, and no prior knowledge in algebraic coding is required.
