The Arbitrarily Varying Channel Under Constraints with Causal Side Information at the Encoder

被引：0

作者：

Pereg, Uzi ^{[1
]}

Steinberg, Yossef ^{[1
]}

机构：

[1] Technion, Dept Elect Engn, IL-32000 Haifa, Israel

来源：

2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2017年

基金：

以色列科学基金会;

关键词：

Arbitrarily varying channel; causal state information; Shannon strategies; side information; minimax theorem; deterministic code; random code; symmetrizability; RANDOM CODES; TRANSMITTER; STATES;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study the arbitrarily varying channel (AVC) with input and state constraints, when the encoder has state information in a causal manner. Lower and upper bounds on the random code capacity are developed. A lower hound on the deterministic code capacity is established in the case of a message-averaged input constraint. In the setting where a state constraint is imposed on the jammer, while the user is under no constraints, the random code hounds coincide, and the random code capacity is determined. Furthermore, for this scenario, a generalized non-symmetrizability condition is stated, under which the deterministic code capacity coincides with the random code capacity.

引用

页码：2805 / 2809

页数：5

共 12 条

[1] ARBITRARILY VARYING CHANNELS WITH STATES SEQUENCE KNOWN TO THE SENDER [J].