Codes approaching the Shannon limit with polynomial complexity per information bit
2021 IEEE International Symposium on Information Theory (ISIT)（2021）
摘要
We consider codes for channels with extreme noise that emerge in various low-power applications. Simple LDPC codes with parity checks of weight 3 are first studied for any code dimension m → ∞. These codes form modulation schemes: they improve the original channel outputs for any SNR > -6 dB (per information bit) and gain 3 dB over uncoded modulation as SNR grows. However, they also have a floo...
更多查看译文
关键词
Upper bound,Simulation,Bit error rate,Modulation,Parity check codes,Complexity theory,Polar codes
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要