FR3.R4.2

Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining

Uri Erez, Tel Aviv University, Israel; Or Ordentlich, Hebrew University of Jerusalem, Israel; Shlomo Shamai (Shitz), Technion, Israel
Session:
Information Inequalities 2
Track:
9: Shannon Theory
Location:
Omikron II
Presentation Time:
Fri, 12 Jul, 14:55 - 15:15
Session Chair:
Venkat Anantharam, University of California, Berkeley
Presentation
Not logged in.
Discussion
Not logged in.
Session FR3.R4
FR3.R4.1: On the Optimality of Dictator functions and Isoperimetric Inequalities on Boolean Hypercubes
Zijie Chen, Chandra NAIR, The Chinese University of Hong Kong, Hong Kong SAR of China
FR3.R4.2: Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining
Uri Erez, Tel Aviv University, Israel; Or Ordentlich, Hebrew University of Jerusalem, Israel; Shlomo Shamai (Shitz), Technion, Israel
FR3.R4.3: A Quantitative Version of More Capable Channel Comparison
Donald Kougang-Yombi, Jan Hązła, AIMS Rwanda, Rwanda
FR3.R4.4: An information-theoretic proof of the Shannon-Hagelbarger theorem
Venkat Anantharam, University of California at Berkeley, United States
Resources
No resources available.