Joint optimization of multi-rate LDPC code ensembles for the AWGN channel based on shortening and puncturing
暂无分享,去创建一个
[1] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[2] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[3] David J. C. MacKay,et al. Good Codes Based on Very Sparse Matrices , 1995, IMACC.
[4] Evangelos Eleftheriou,et al. Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.
[5] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[6] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[7] Peter Vary,et al. Breaking Cycles with Dummy Bits: Improved Rate-Compatible LDPC Codes with Short Block Lengths , 2013 .
[8] Joachim Hagenauer,et al. Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.
[9] Steven W. McLaughlin,et al. Rate-compatible puncturing of low-density parity-check codes , 2004, IEEE Transactions on Information Theory.
[10] 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.
[11] Sae-Young Chung,et al. Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.
[12] Christopher R. Jones,et al. Construction of Rate-Compatible LDPC Codes Utilizing Information Shortening and Parity Puncturing , 2005, EURASIP J. Wirel. Commun. Netw..
[13] Tiffany Jing Li,et al. Rate-compatible Low Density Parity Check Codes for Capacity-approaching ARQ Schemes in Packet Data Communications , 2002, Communications, Internet, and Information Technology.