Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound

Simple item page
dc.creatorServetto, Sergio D.
dc.date2006-04-03
dc.date2006-11-15
dc.date.accessioned2026-07-07T08:16:27Z
dc.date.available2026-07-07T08:16:27Z
dc.descriptionIn this first part, a computable outer bound is proved for the multiterminal source coding problem, for a setup with two encoders, discrete memoryless sources, and bounded distortion measures.
dc.descriptionSubmitted to the IEEE Transactions on Information Theory; Revised, November 2006. Substantial revision after the first round of reviews
dc.identifierhttps://arxiv.org/abs/cs/0604005
dc.identifierhttp://arxiv.org/abs/cs/0604005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133786
dc.subjectInformation Theory
dc.titleMultiterminal Source Coding with Two Encoders--I: A Computable Outer Bound
dc.typetext

Files

Collections

arXiv