Polarized Low-Density Parity-Check Codes on the BSC
暂无分享,去创建一个
[1] Li Deng,et al. An Improved Belief Propagation Decoding of Concatenated Polar Codes With Bit Mapping , 2018, IEEE Communications Letters.
[2] Erdal Arikan,et al. Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.
[3] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[4] Hua Xiao,et al. Improved progressive-edge-growth (PEG) construction of irregular LDPC codes , 2004, IEEE Communications Letters.
[5] Evangelos Eleftheriou,et al. Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.
[6] G. David Forney,et al. Concatenated codes , 2009, Scholarpedia.
[7] David J. C. MacKay,et al. Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.
[8] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[9] Daniel A. Spielman,et al. Analysis of low density codes and improved designs using irregular graphs , 1998, STOC '98.
[10] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[11] Sae-Young Chung,et al. On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.
[12] Richard D. Wesel,et al. Selective avoidance of cycles in irregular LDPC code construction , 2004, IEEE Transactions on Communications.
[13] Hossein Pishro-Nik,et al. On Finite-Length Performance of Polar Codes: Stopping Sets, Error Floor, and Concatenated Design , 2012, IEEE Transactions on Communications.