Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound
<|reference_start|>Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound: In 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.<|reference_end|>
@article{servetto2006multiterminal,
    title={Multiterminal Source Coding with Two Encoders--I: A Computable Outer
  Bound},
    author={Sergio D. Servetto (Cornell University)},
    journal={arXiv preprint arXiv:cs/0604005},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0604005},
    primaryClass={cs.IT math.IT}
}