modeled by two independent bit-pipes. New upper and lower bounds on the capacity are
derived. The proof technique for the upper bound generalizes the bounding techniques of
Ozarow for the Gaussian multiple description problem (1981) and Kang and Liu for the
Gaussian diamond network (2011). The lower bound is based on Marton's coding technique
and superposition coding. The bounds are evaluated for Gaussian and binary adder …