BSC Thresholds for Code Ensembles Based on “Typical Pairs” Decoding
暂无分享,去创建一个
Robert J. McEliece | David J. C. MacKay | Hui Jin | Aamod Khandekar | Srinivas M. Aji | S. Aji | Hui Jin | A. Khandekar | D. Mackay | R. McEliece
[1] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[2] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .
[3] Robert J. McEliece,et al. The Theory of Information and Coding , 1979 .
[4] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[5] Laurent Decreusefond,et al. On the error-correcting capabilities of cycle codes of graphs , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.
[6] Niclas Wiberg,et al. Codes and Decoding on General Graphs , 1996 .
[7] Scott A. Vanstone,et al. Graphical codes revisited , 1997, IEEE Trans. Inf. Theory.
[8] Dariush Divsalar,et al. Coding theorems for 'turbo-like' codes , 1998 .
[9] David J. C. MacKay,et al. Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.
[10] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.