Team for Research in
Ubiquitous Secure Technology

Citation
Amin Aminzadeh Gohari, Venkatachalam Anantharam. "A New Outer Bound to the Capacity Region of Deterministic-Code Discrete Memoryless Arbitrary Varying General Broadcast Channel". Technical report, UC Berkeley, UCB/EECS-2008-81, June, 2008.

Abstract
In this paper we apply the ``potential function method" introduced by the authors in [1] and [2] to prove a new outer bound on the capacity region of the deterministic-code arbitrarily varying general broadcast channel. Specializing by removing the variability of the channel, our outer bound gives another proof of the recent result of Liang, Kramer and Shamai, which is the currently best upper bound on the capacity region of the traditional broadcast channel [3].

Electronic downloads

• HTML

  Amin Aminzadeh Gohari, Venkatachalam Anantharam. <a
  href="http://www.truststc.org/pubs/407.html"
  ><i>A New Outer Bound to the Capacity Region of
  Deterministic-Code Discrete Memoryless Arbitrary Varying
  General Broadcast Channel</i></a>, Technical
  report,  UC Berkeley, UCB/EECS-2008-81, June, 2008.

• Plain text

  Amin Aminzadeh Gohari, Venkatachalam Anantharam. "A New
  Outer Bound to the Capacity Region of Deterministic-Code
  Discrete Memoryless Arbitrary Varying General Broadcast
  Channel". Technical report,  UC Berkeley,
  UCB/EECS-2008-81, June, 2008.

• BibTeX

  @techreport{GohariAnantharam08_NewOuterBoundToCapacityRegionOfDeterministicCodeDiscrete,
      author = {Amin Aminzadeh Gohari and Venkatachalam Anantharam},
      title = {A New Outer Bound to the Capacity Region of
                Deterministic-Code Discrete Memoryless Arbitrary
                Varying General Broadcast Channel},
      institution = {UC Berkeley},
      number = {UCB/EECS-2008-81},
      month = {June},
      year = {2008},
      abstract = {In this paper we apply the ``potential function
                method" introduced by the authors in [1] and [2]
                to prove a new outer bound on the capacity region
                of the deterministic-code arbitrarily varying
                general broadcast channel. Specializing by
                removing the variability of the channel, our outer
                bound gives another proof of the recent result of
                Liang, Kramer and Shamai, which is the currently
                best upper bound on the capacity region of the
                traditional broadcast channel [3].},
      URL = {http://www.truststc.org/pubs/407.html}
  }
  

Posted by Amin Aminzadeh Gohari on 10 Jun 2008.
For additional information, see the Publications FAQ or contact webmaster at www truststc org.