The capacity of the arbitrarily varying channel revisited: Positivity, constraints
نویسندگان
چکیده
A well-known result of Ahlswede asserts that the determinis-tic code capacity of an arbitrarily varying channel (AVC), under the average error probability criterion, either equals its random code capacity or else is zero. A necessary and sufficient condition is identified for deciding between these alternatives, namely, the capacity is zero if and only if the AVC is symmetrizable. The capacity of the AVC is also determined with constraints on the transmitted codewords as well as on the channel state sequences, and it is demonstrated that it may be positive but less than the corresponding random code capacity. A special case of the results resolves a weakened version of a fundamental problem of coding theory.
منابع مشابه
Nonconvexity of the capacity region of the multiple-access arbitrarily varying channel subject to constraints
Abstruct-The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.
متن کاملReliable Communication under the Influence of a State-Constrained Jammer: A Novel Perspective on Receive Diversity
The question of robust direct communication in vehicular networks is discussed. In most stateof-the-art approaches, there is no central entity controlling channel access, so there may be arbitrary interference from other parties. Thus, a suitable channel model for Vehicle-to-X (V2X) communication is the Arbitrarily Varying Channel (AVC). Employing multiple antennas on a vehicle or sending over ...
متن کاملNonconvexity of the Capacity Region of theMultiple - Access
| The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.
متن کاملThe Arbitrarily Varying Relay Channel
We study the arbitrarily varying relay channel, and establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under which the deterministic code capacity is determined as well. In addition, we consider the arbitrarily varying Gaussian relay channel with sender frequency d...
متن کاملClassical-quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation
We establish the Ahlswede dichotomy for arbitrarily varying classicalquantum wiretap channels, i.e., either the deterministic secrecy capacity of the channel is zero, or it equals its randomness-assisted secrecy capacity. We analyze the secrecy capacity of these channels when the sender and the receiver use various resources. It turns out that randomness, common randomness, and correlation as r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 1988