In this paper we apply the "potential function method" introduced by the authors in (GA_SM) and (GA_CM) 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 (Liang-Kramer-Shamai).
Title
A New Outer Bound to the Capacity Region of Deterministic-Code Discrete Memoryless Arbitrary Varying General Broadcast Channel
Published
2008-06-09
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
EECS-2008-81
Type
Text
Extent
18 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
