Coding strategies for bidirectional relaying for arbitrarily varying channels

Rafael F. Wyrembelski, Igor Bjelakovíc, Holger Boche

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations


In this work we study optimal coding strategies for bidirectional relaying under the condition of arbitrarily varying channels. We consider a three-node network where a relay node establishes a bidirectional communication between two nodes using a spectrally efficient decode-and-forward protocol. In the first phase the two nodes transmit their messages to the relay node, which decodes them. In the succeeding bidirectional broadcast phase the relay node broadcasts an optimal re-encoded composition of them so that both nodes can decode the intended message using their own message as side information. We assume that the whole communication is affected by channels which vary in an unknown and arbitrary manner during the transmission so that all nodes have only imperfect channel state information. For both phases of the bidirectional relaying protocol we present robust coding strategies, which mitigate the uncertainty in channel state information so that reliable communication can be guaranteed. Further, we characterize the corresponding capacity regions for random and deterministic coding strategies.

Original languageEnglish
Title of host publicationGLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference
StatePublished - 2009
Externally publishedYes
Event2009 IEEE Global Telecommunications Conference, GLOBECOM 2009 - Honolulu, HI, United States
Duration: 30 Nov 20094 Dec 2009

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference


Conference2009 IEEE Global Telecommunications Conference, GLOBECOM 2009
Country/TerritoryUnited States
CityHonolulu, HI


Dive into the research topics of 'Coding strategies for bidirectional relaying for arbitrarily varying channels'. Together they form a unique fingerprint.

Cite this