A construction of channel code, joint source-channel code, and universal code for arbitrary stationary memoryless channels using sparse matrices
暂无分享,去创建一个
[1] Ying Zhao,et al. Compression of binary memoryless sources using punctured turbo codes , 2002, IEEE Communications Letters.
[2] Martin J. Wainwright,et al. Low-density graph codes that are optimal for source/channel coding and binning , 2007, ArXiv.
[3] Shigeki Miyake,et al. Construction of Universal Codes Using LDPC Matrices and Their Error Exponents , 2007, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[4] David Burshtein,et al. Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes , 2000, IEEE Trans. Inf. Theory.
[5] Jun Muramatsu,et al. Low-density parity-check matrices for coding of correlated sources , 2003, IEEE Transactions on Information Theory.
[6] David Burshtein,et al. On the application of LDPC codes to arbitrary discrete-memoryless channels , 2003, IEEE Transactions on Information Theory.
[7] Jun Muramatsu,et al. Construction of a Lossy Source Code Using LDPC Matrices , 2007, ISIT.