Elements of information theory
Elements of information theory
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Joint Source-Channel Decoding of Correlated Sources over Noisy Channels
DCC '01 Proceedings of the Data Compression Conference
On the Performance of Linear Slepian-Wolf Codes for Correlated Stationary Memoryless Sources
DCC '05 Proceedings of the Data Compression Conference
Information-Spectrum Characterization of Multiple-Access Channels with Correlated Sources
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Signal Processing - Special section: Distributed source coding
Transmission of correlated senders over a Rayleigh fading multiple access channel
Signal Processing - Special section: Distributed source coding
LDGM codes for channel coding and joint source-channel coding of correlated sources
EURASIP Journal on Applied Signal Processing
On the application of LDPC codes to arbitrary discrete-memoryless channels
IEEE Transactions on Information Theory
Low-density parity-check matrices for coding of correlated sources
IEEE Transactions on Information Theory
On the joint source-channel coding error exponent for discrete memoryless systems
IEEE Transactions on Information Theory
Correlated sources over wireless channels: cooperative source-channel coding
IEEE Journal on Selected Areas in Communications
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
Hi-index | 754.84 |
A general lossless joint source-channel coding (JSCC) scheme based on linear codes and random interleavers for multiple-access channels (MACs) is presented and then analyzed in this paper. By the information-spectrum approach and the code-spectrum approach, it is shown that a linear code with a good joint spectrum can be used to establish limit-approaching lossless JSCC schemes for correlated general sources and general MACs, where the joint spectrum is a generalization of the input-output weight distribution. Some properties of linear codes with good joint spectra are investigated. A formula on the "distance" property of linear codes with good joint spectra is derived, based on which, it is further proved that, the rate of any systematic codes with good joint spectra cannot be larger than the reciprocal of the corresponding alphabet cardinality, and any sparse generator matrices cannot yield linear codes with good joint spectra. The problem of designing arbitrary rate coding schemes is also discussed. A novel idea called "generalized puncturing" is proposed, which makes it possible that one good low-rate linear code is enough for the design of coding schemes with multiple rates. Finally, various coding problems of MACs are reviewed in a unified framework established by the code-spectrum approach, under which, criteria and candidates of good linear codes in terms of spectrum requirements for such problems are clearly presented.