CCSP Seminar: Min Ye, "Strong converse on bitwise decoding for random linear code ensemble"

Thursday, October 29, 2020
9:30 a.m.-11:30 a.m.
Online presentation
Zitan Chen
chenztan@umd.edu

Communication, Control and Signal Processing Seminar

Strong converse on bitwise decoding for random linear code ensemble

Min Ye
Tsinghua-Berkeley Shenzhen Institute

Abstract
In this talk, I will prove a strong converse result on bitwise decoding when communicating with random linear codes over binary symmetric channels (BSC). Our converse theorem shows extreme unpredictability of even a single message bit for random coding at rates slightly above capacity. This talk is based on joint work with Venkatesan Guruswami and Andrii Riazanov (arXiv:1911.03858), where we proved a more general version of this converse theorem that holds for arbitrary binary-input memoryless symmetric (BMS) channels, and we further used this converse theorem to construct polar codes with near-optimal convergence to channel capacity.

Please see http://ccsp.ece.umd.edu for more details of the talk.

Zoom meeting at https://umd.zoom.us/j/94110827620

Audience: Graduate  Undergraduate  Faculty  Post-Docs 

remind we with google calendar

 

October 2020

SU MO TU WE TH FR SA
27 28 29 30 1 2 3
4 5 6 7 8 9 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25 26 27 28 29 30 31
1 2 3 4 5 6 7
Submit an Event