Structured low-density parity-check codes for next-generation digital communications

基本上没有错误的信息传输的承诺是数字通信的基石。下一代应用程序要求越来越有效的纠错，然而传统系统远远达不到大约50年前建立的基本容量限制。20世纪90年代中期出现了令人兴奋的突破，在图上提供了使用迭代解码算法的容量逼近代码，包括低密度奇偶校验（LDPC）代码。该项目应用离散数学技术来设计结构化的LDPC编码方案，以便广泛实施。这项研究的结果将是新的LDPC代码、编码算法和分析技术，应用于无线网络、数据存储和互联网通信。

The promise of essentially error-free information transmission is a cornerstone of digital communications. Next-generation applications demand increasingly effective error correction, yet traditional systems fall well short of fundamental capacity limits established some fifty years ago. Exciting breakthroughs in the mid-1990s delivered capacity-approaching codes on graphs employing iterative decoding algorithms, including low-density parity-check (LDPC) codes. This project applies techniques from discrete mathematics to design structured LDPC coding schemes for widespread implementation. Outcomes of this research will be new LDPC codes, encoding algorithms and analysis techniques for applications including wireless networks, data storage and Internet communications.