Learn More
We study the Han-Kobayashi (HK) achievable sum rate for the two-user symmetric Gaussian interference channel. We find the optimal power split ratio between the common and private messages (assuming no time-sharing), and derive a closed form expression for the corresponding sum rate. This provides a finer understanding of the achievable HK sum rate, and(More)
Let G<inf>k</inf> be the de Bruijn graph with 2<sup>k</sup> vertices. When reproduction labels from a 4-letter alphabet A<inf>4</inf> are assigned linearly to the edges of G<inf>k</inf> using a three row binary generating matrix, a 2<sup>k</sup>-state trellis code results which is suitable for encoding a source with alphabet A<inf>4</inf> at a rate of one(More)
A memoryless equiprobable source with four-letter alphabet is to be trellis encoded at an encoding rate of one code bit per source sample with respect to the Hamming fidelity criterion. Each possible trellis code for this encoding task is characterized by a binary generating matrix of fixed dimensions via which reproduction labels from the source alphabet(More)
  • 1