2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/133786In 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.Submitted to the IEEE Transactions on Information Theory; Revised, November 2006. Substantial revision after the first round of reviewsInformation TheoryMultiterminal Source Coding with Two Encoders--I: A Computable Outer Boundtext