The capacity for the discrete memoryless arbitrarily varying channel (AVC) with cost constraints on the jammer is studied using deterministic list codes under both the maximal and average probability of error criteria. For a cost function l(.) on the state set and constraint Lambda on the jammer, the achievable rates are upper bounded by the random coding capacity Cr(Lambda). For maximal error, the rate R = Cr(Lambda) - epsilon is achievable using list codes with list size O(epsilon^-1). For average error, an integer L_sym(Lambda), called the symmetrizability, is defined. It is shown that any rate below Cr(Lambda) is achievable under average error using list codes of list size L > L_sym. An example is given for a class of discrete additive AVCs.
Title
Deterministic list codes for state-constrained arbitrarily varying channels
Published
2007-01-08
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
EECS-2007-6
Type
Text
Extent
27 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).
