2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | C.7.5 | ||
| Paper Title | Capacity-achieving Polar-based LDGM Codes with Crowdsourcing Applications | ||
| Authors | James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan, University of Michigan, Ann Arbor, United States | ||
| Session | C.7: Polar Codes II | ||
| Presentation | Lecture | ||
| Track | Coding for Communications | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | In this paper we study codes with sparse generator matrices. More specifically, codes with a certain constraint on the weight of all the columns in the generator matrix are considered. The end result is the following. For any binary-input memoryless symmetric (BMS) channel and any $\epsilon > 2\epsilon^*$, where $\epsilon^* = \frac{1}{6}-\frac{5}{3}\log{\frac{4}{3}} \approx 0.085$, we show an explicit sequence of capacity-achieving codes with all the column weights of the generator matrix upper bounded by $(\log N)^{1+\epsilon}$, where $N$ is the code block length. The constructions are based on polar codes. Applications to crowdsourcing are also shown. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
