4.5 Article

Quadratically Constrained Myopic Adversarial Channels

Related references

Note: Only part of the references are listed.
Article Computer Science, Information Systems

Covert Communication Over Adversarially Jammed Channels

Qiaosheng Zhang et al.

Summary: The study explores covert communication against active adversaries and finds that shared keys are necessary in this scenario unlike against passive adversaries. Lower and upper bounds on the information-theoretically optimal throughput are proposed, and a computationally efficient coding scheme is presented.

IEEE TRANSACTIONS ON INFORMATION THEORY (2021)

Article Engineering, Electrical & Electronic

Stealthy Communication Over Adversarially Jammed Multipath Networks

Jianhan Song et al.

IEEE TRANSACTIONS ON COMMUNICATIONS (2020)

Proceedings Paper Computer Science, Theory & Methods

Quadratically Constrained Two-way Adversarial Channels

Yihan Zhang et al.

2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2020)

Proceedings Paper Computer Science, Theory & Methods

Symmetrizability for Myopic AVCs

Amitalok J. Budkuley et al.

2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2020)

Article Physics, Multidisciplinary

List-Decoding Capacity of the Gaussian Arbitrarily-Varying Channel

Fatemeh Hosseinigoki et al.

ENTROPY (2019)

Article Computer Science, Information Systems

Sufficiently Myopic Adversaries Are Blind

Bikash Kumar Dey et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2019)

Proceedings Paper Computer Science, Information Systems

When are large codes possible for AVCs?

Xishi (Nicholas) Wang et al.

2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2019)

Proceedings Paper Computer Science, Information Systems

List Decoding Random Euclidean Codes and Infinite Constellations

Yihan Zhang et al.

2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2019)

Proceedings Paper Computer Science, Information Systems

Shared Randomness in Arbitrarily Varying Channels

Sagnik Bhattacharya et al.

2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2019)

Article Computer Science, Information Systems

Arbitrarily Varying Wiretap Channels With Type Constrained States

Ziv Goldfeld et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2016)

Article Computer Science, Information Systems

A Channel Under Simultaneous Jamming and Eavesdropping Attack-Correlated Random Coding Capacities Under Strong Secrecy Criteria

Moritz Wiese et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2016)

Article Computer Science, Information Systems

The Arbitrarily Varying Wiretap Channel-Secret Randomness, Stability, and Super-Activation

Janis Notzel et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2016)

Article Mathematics

SPHERE PACKING BOUNDS VIA SPHERICAL CODES

Henry Cohn et al.

DUKE MATHEMATICAL JOURNAL (2014)

Article Computer Science, Information Systems

MIMO Wiretap Channels With Unknown and Varying Eavesdropper Channel States

Xiang He et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2014)

Article Computer Science, Information Systems

MIMO Multiple Access Channel With an Arbitrarily Varying Eavesdropper: Secrecy Degrees of Freedom

Xiang He et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2013)

Article Computer Science, Information Systems

Strong Secrecy From Channel Resolvability

Matthieu R. Bloch et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2013)

Article Computer Science, Information Systems

Mutual Information Games in Multiuser Channels With Correlated Jamming

Shabnam Shafiee et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2009)

Article Computer Science, Information Systems

Oblivious communication channels and their capacity

Michael Langberg

IEEE TRANSACTIONS ON INFORMATION THEORY (2008)