论文标题
具有众包应用程序的基于极地的LDGM代码
Capacity-achieving Polar-based LDGM Codes with Crowdsourcing Applications
论文作者
论文摘要
在本文中，我们研究了具有稀疏发电机矩阵的代码。更具体地说，考虑到发电机矩阵中所有列的重量的代码。最终结果是以下内容。对于任何二进制输入无内存的对称（BMS）频道和任何Epsilon> 2 Epsilon*，其中Epsilon^* = = \ frac {1} {6} {6} - \ frac {5} {3} {3} \ log {\ frac {\ frac {4} {4} {3}} {3}}} code code code cod cod cod cod cod of coid a extient and of cod of coid a extercention of Ane of coid发电机矩阵上部的wights在（\ log n）^{1+epsilon}的边界，其中n是代码块长度。这些结构基于极地代码。还显示了向众包的申请。
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 wights 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.
