Polar Codes on Compound Channels
Event details
| Date | 16.07.2019 |
| Hour | 10:15 › 12:15 |
| Speaker | Reka Inovan |
| Location | |
| Category | Conferences - Seminars |
EDIC candidacy exam
Exam president: Prof. Michael Gastpar
Thesis advisor: Prof. Emre Telatar
Co-examiner: Dr. Nicolas Macris
Abstract
Although polar codes have been shown to achieve capacity for binary memoryless channel given a complete channel model, its performance under channel uncertainties is largely not known. In this proposal, we will discuss the theoretical framework for channel coding under some form of channel uncertainties and how polar codes fit into this framework. The first paper [1] will discuss one of the framework for derivingachievability results on this problem. The second paper [2] will provide a counter-example to the long-standing converse result,hence leaving the question of converse as once again an open question. The third paper [3] will discuss a method to boundthe compound capacity of polar codes. Finally, we will present several future research direction which will extend the method given in [3] to obtain a stronger bound.
Background papers
Channel capacity for a given decoding metric, by I. Csiszar and P. Narayan, 1995.
A Counter-Example to the Mismatched Decoding Converse for Binary-Input Discrete Memoryless Channels, by - J. Scarlett, A. Somekh-Baruch, A. Martinez and A. Guillén i Fàbregas, 2015.
The compound capacity of polar codes, by S. H. Hassani, S. B. Korada and R. Urbanke, 2009.
Exam president: Prof. Michael Gastpar
Thesis advisor: Prof. Emre Telatar
Co-examiner: Dr. Nicolas Macris
Abstract
Although polar codes have been shown to achieve capacity for binary memoryless channel given a complete channel model, its performance under channel uncertainties is largely not known. In this proposal, we will discuss the theoretical framework for channel coding under some form of channel uncertainties and how polar codes fit into this framework. The first paper [1] will discuss one of the framework for derivingachievability results on this problem. The second paper [2] will provide a counter-example to the long-standing converse result,hence leaving the question of converse as once again an open question. The third paper [3] will discuss a method to boundthe compound capacity of polar codes. Finally, we will present several future research direction which will extend the method given in [3] to obtain a stronger bound.
Background papers
Channel capacity for a given decoding metric, by I. Csiszar and P. Narayan, 1995.
A Counter-Example to the Mismatched Decoding Converse for Binary-Input Discrete Memoryless Channels, by - J. Scarlett, A. Somekh-Baruch, A. Martinez and A. Guillén i Fàbregas, 2015.
The compound capacity of polar codes, by S. H. Hassani, S. B. Korada and R. Urbanke, 2009.
Practical information
- General public
- Free
Contact
- edic@epfl.ch