The Arbitrarily Varying Relay Channel
classification
💻 cs.IT
math.IT
keywords
capacitycodearbitrarilyboundchannelrandomrelayvarying
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.