Zero-Error Capacity of Broadcast Channels with Two Binary Outputs

This paper begins a systematic study of the zeroerror capacity problem of broadcast channels, where the message sent can be decoded by each receiver with zero error. A graph set is used to represent the broadcast channel. We particularly consider a set of two graphs, where each graph in the set contains only one edge. The corresponding zero-error capacity is determined in this paper.