Team for Research in
Ubiquitous Secure Technology

A New Outer Bound to the Capacity Region of Deterministic-Code Discrete Memoryless Arbitrary Varying General Broadcast Channel
Amin Aminzadeh Gohari, Venkatachalam Anantharam

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


Internal. This publication has been marked by the author for TRUST-only distribution, so electronic downloads are not available without logging in.
Citation formats  
  • 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.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.