On the sum capacity of a class of 3 user deterministic interference channels

A class of 3-user deterministic interference channels is considered in which there is no interference between two of the users. We refer to this channel as the `shoe-string' interference channel. Bounds on the sum-rate of this class of channels are given. These bounds are shown to be tight for several classes of symmetric linear deterministic models by providing explicit achievable schemes.