Invariance Properties of Binary Linear Codes Over a Memoryless Channel With Discrete Input
暂无分享,去创建一个
[1] Sae-Young Chung,et al. Sphere-bound-achieving coset codes and multilevel coset codes , 2000, IEEE Trans. Inf. Theory.
[2] Robert F. H. Fischer,et al. Multilevel codes: Theoretical concepts and practical design rules , 1999, IEEE Trans. Inf. Theory.
[3] Xiao Ma,et al. Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds , 2003, IEEE Transactions on Information Theory.
[4] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[5] Amir K. Khandani,et al. Some Properties of Bit Decoding Algorithms for Binary Linear Block Codes , 2002 .
[6] G. David Forney,et al. Geometrically uniform codes , 1991, IEEE Trans. Inf. Theory.
[7] David Burshtein,et al. On the application of LDPC codes to arbitrary discrete-memoryless channels , 2003, IEEE Transactions on Information Theory.
[8] Philippe Piret,et al. Algebraic constructions of Shannon codes for regular channels , 1982, IEEE Trans. Inf. Theory.
[9] Dariush Divsalar,et al. Labelings and encoders with the uniform bit error property with applications to serially concatenated trellis codes , 2002, IEEE Trans. Inf. Theory.
[10] Paul H. Siegel,et al. Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes , 2003, IEEE Trans. Inf. Theory.
[11] Manabu Hagiwara,et al. Comment on "Quasi-Cyclic Low Density Parity Check Codes From Circulant Permutation Matrices" , 2009, IEEE Trans. Inf. Theory.
[12] Some Properties of Bit Decoding Algorithms Over A Generalized Channel Model , 2002 .
[13] Shu Lin,et al. Cyclic unequal error protection codes constructed from cyclic codes of composite length , 1988, IEEE Trans. Inf. Theory.
[14] Amir K. Khandani,et al. On Some Properties of the Bit Decoding Algorithms , 2001 .
[15] R. Gallager. Information Theory and Reliable Communication , 1968 .