Polyhedral description of the symmetrical latency capacity region of broadcast channels

Abstract

This paper provides a polyhedral description of the symmetrical latency capacity region of broadcast channels. The converse result is established via the recently proposed generalized cut-set bounds for broadcast networks. The achievability result is proved by considering a “pairwise exchange” scheme and successive encoding.