Low-density parity-check matrices for coding of correlated sources

Authors:
J. Muramatsu;T. Uyematsu;T. Wadayama
Affiliations:
NTT Commun. Sci. Labs., NTT Corp., Kyoto, Japan;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 10

Construction of Universal Codes Using LDPC Matrices and Their Error Exponents

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An Application of Linear Codes to the Problem of Source Coding with Partial Side Information

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Performance bounds and codes design criteria for channel decoding with a-priori information

IEEE Transactions on Wireless Communications
Linear-codes-based lossless joint source-channel coding for multiple-access channels

IEEE Transactions on Information Theory
Coset codes for compound multiple access channels with common information

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Coding theorem for general stationary memoryless channel based on hash property

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Hash property and coding theorems for sparse matrices and maximum-likelihood coding

IEEE Transactions on Information Theory
Hash property and fixed-rate universal coding theorems

IEEE Transactions on Information Theory
Non-cooperative block-faded orthogonal multiple access with source correlation: performance limits and practical schemes

ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Full Length Article: Information fusion in wireless sensor networks with source correlation

Information Fusion

Quantified Score

Hi-index	755.02

Visualization

Abstract

Linear codes for a coding problem of correlated sources are considered. It is proved that we can construct codes by using low-density parity-check (LDPC) matrices with maximum-likelihood (or typical set) decoding. As applications of the above coding problem, a construction of codes is presented for multiple-access channel with correlated additive noises and a coding theorem of parity-check codes for general channels is proved.