Uzi Pereg, Yossef Steinberg
Abstract
We study the arbitrarily varying relay channel, and establish the cutset bound, decode-forward bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider deterministic coding schemes, and derive the deterministic code capacity, under certain conditions.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We study the arbitrarily varying relay channel, and establish the cutset bound, decode-forward bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider deterministic coding schemes, and derive the deterministic code capacity, under certain conditions.
Key concepts: Relay, Channel code, Relay channel, Channel capacity, Upper and lower bounds, Computer science, Code (set theory), Channel (broadcasting)