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

In this work, we consider a distributed source coding problem with a jointdistortion criterion depending on the sources and the reconstruction. Thisincludes as a special case the problem of computing a function of the sourcesto within some distortion and also the classic Slepian-Wolf problem,Berger-Tung problem, Wyner-Ziv problem, Yeung-Berger problem and theAhlswede-Korner-Wyner problem. While the prevalent trend in information theoryhas been to prove achievability results using Shannon's random codingarguments, using structured random codes offer rate gains over unstructuredrandom codes for many problems. Motivated by this, we present a new achievablerate-distortion region for this problem for discrete memoryless sources basedon "good" structured random nested codes built over abelian groups. Wedemonstrate rate gains for this problem over traditional coding schemes usingrandom unstructured codes. For certain sources and distortion functions, thenew rate region is strictly bigger than the Berger-Tung rate region, which hasbeen the best known achievable rate region for this problem till now. Further,there is no known unstructured random coding scheme that achieves these rategains. Achievable performance limits for single-user source coding usingabelian group codes are also obtained as parts of the proof of the main codingtheorem. As a corollary, we also prove that nested linear codes achieve theShannon rate-distortion bound in the single-user setting.

Distributed Source Coding using Abelian Group Codes