Matrix analysis
Integer and combinatorial optimization
Integer and combinatorial optimization
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Coding for intersymbol interference channels-combined coding and precoding
IEEE Transactions on Information Theory
On the capacity of some channels with channel state information
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
The Gaussian watermarking game
IEEE Transactions on Information Theory
Information-theoretic analysis of information hiding
IEEE Transactions on Information Theory
On the achievable throughput of a multiantenna Gaussian broadcast channel
IEEE Transactions on Information Theory
Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality
IEEE Transactions on Information Theory
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
IEEE Transactions on Information Theory
Sum capacity of Gaussian vector broadcast channels
IEEE Transactions on Information Theory
On channels with partial channel state information at the transmitter
IEEE Transactions on Information Theory
Capacity and lattice strategies for canceling known interference
IEEE Transactions on Information Theory
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
IEEE Transactions on Information Theory
| Hi-index | 754.84 |
For a state-dependent discrete memoryless channel with input alphabet X, state alphabet S, and output alphabet Y where the independent and identically distributed (i.i.d.) state sequence is known causally at the transmitter, it is shown that by using at most min{|X||S| - |S| + 1, |Y|} out of |X||S| inputs of the Shannon's derived channel, the capacity is achievable. As an example of state-dependent channels with side information at the transmitter. M-ary signal transmission for the additive white Gaussian noise (AWGN) channel with additive Q-ary interference where the sequence of i.i.d. interference symbols is known causally at the transmitter is considered. The optimal precoding scheme is derived under the constraint that the channel input given any current interference symbol is uniformly distributed over the channel input alphabet. It is shown that at low signal-to-noise ratio (SNR) not doing precoding is optimal. For the special case where the Gaussian noise power is zero, it is shown that the rate log2 M is achievable by a one-shot coding scheme if X is an arithmetic progression.