English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider the Gaussian Dirty Tape Channel (DTC) Y=X+S+Z, where S is anadditive Gaussian interference known causally to the transmitter. The generalexpression [max]\_top(P_U,f(.),X=f(U,S))I(U;Y) is presented for the capacity ofthis channel. For linear assignment to f(.), i.e. X=U-{\beta}S, this expressionleads to the compensation strategy proposed previously by Willems to obtain anachievable rate for the DTC. We show that linear assignment to f(.) is optimal,under the condition that there exists a real number {\beta}^* such that thepair (X+{\beta}^* S,U) is independent of interference S. Furthermore, byapplying a time-sharing technique to the achievable rate derived by linearassignment to f(.), an improved lower bound on the capacity of DTC is obtained.We also consider the Gaussian multiple access channel with additiveinterference, and study two different scenarios for this system. In the firstcase, both transmitters know interference causally while in the second, onetransmitter has access to the interference noncausally and the other causally.Achievable rate regions for these two scenarios are then established.

Achievable Rate Regions for Dirty Tape Channels and "Joint Writing on Dirty Paper and Dirty Tape"