Henry P. Romero

  • Citations Per Year
Learn More
An approximate capacity result is demonstrated for a specific class of interference channels with common information (IC-CI). The class is the semideterministic interference channel of Telatar and Tse, and the outer bound herein generalizes their bound from the case where each transmitter sends only private information to the case where each transmitter(More)
Two different random coding techniques, both referred to as superposition coding in the literature, have been widely used to obtain inner bounds for the capacity regions of various communication networks. In one, auxiliary codewords are generated independently, and in the other, they are generated in a dependent manner. Using the multiple-access channel(More)
The conditions which govern reliable communication over networks are often given as a union of polyhedra. As increasingly larger networks are considered, these conditions become unwieldy and intractable, unless useful structure can be found in them. An example of a polyhedron with a useful underlying structure is a polymatroid, which despite its exponential(More)
We present an inner bound for the combination network based on superposition coding and partial interference decoding. This inner bound is tight in the three-user and K-user symmetric cases, where capacity has been previously characterized. However, unlike previous achievability schemes, the scheme presented herein does not require network coding. By(More)
The multiple access channel with private messages has a single accepted capacity characterization. By contrast, when the same channel is considered with message sources that may be commonly known to multiple transmitters, a plurality of distinct capacity descriptions arises. Two descriptions currently exist in the literature, with the capacity region(More)
The capacity region of the <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula>-user vector Gaussian multiple-access channel with general message sets is established. Furthermore, due to the presence of convexity, both in the discrete and continuous senses, it is shown that this capacity region is efficiently computable. The capacity(More)
An explicit and efficient capacity characterization of the K-user discrete memoryless multiple access channel with common information and discrete memoryless state is provided. Messages are indexed according to which transmitters are aware of the messages, and any of 2<sup>K</sup>-1 possible such messages may exist. A superposition coding scheme, which(More)
A general inner bound is given for the discrete memoryless broadcast channel with an arbitrary number of users and general message sets, a setting that accounts for the most general form of concurrent groupcasting, with up to exponentially many messages intended for any set of subsets of receivers. Achievability is based on superposition coding and(More)
The capacity of the K-user fading multiple access channel with multiple antennas and common information is approximately characterized. In this model, any possible common message may exist. While the exact capacity appears to be difficult to characterize, it may be attained to within a gap independent of the power allocation by a simple separable coding(More)
  • 1