Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources

This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebraic structure can outperform i.i.d. codebooks...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings / IEEE International Symposium on Information Theory pp. 1681 - 1686
Main Authors: Pastore, Adriano, Lim, Sung Hoon, Feng, Chen, Nazer, Bobak, Gastpar, Michael
Format: Conference Proceeding
Language:English
Published: IEEE 25.06.2023
Subjects:
ISSN:2157-8117
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first