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

Let (S1,i, S2,i), distributed according to i.i.d p(s1, s2), i = 1, 2, . . .be a memoryless, correlated partial side information sequence. In this work westudy channel coding and source coding problems where the partial sideinformation (S1, S2) is available at the encoder and the decoder, respectively,and, additionally, either the encoder's or the decoder's side information isincreased by a limited-rate description of the other's partial sideinformation. We derive six special cases of channel coding and source codingproblems and we characterize the capacity and the rate-distortion functions forthe different cases. We present a duality between the channel capacity and therate-distortion cases we study. In order to find numerical solutions for ourchannel capacity and rate-distortion problems, we use the Blahut-Arimotoalgorithm and convex optimization tools. As a byproduct of our work, we found atight lower bound on the Wyner-Ziv solution by formulating its Lagrange dual asa geometric program. Previous results in the literature provide a geometricprogramming formulation that is only a lower bound, but not necessarily tight.Finally, we provide several examples corresponding to the channel capacity andthe rate-distortion cases we presented.

Channel Coding and Source Coding with Increased Partial Side Information