A relaxed practical universal decoding algorithm for slepian-wolf system

In this paper, we will discuss universal decoding problem for Slepian-Wolf (SW) systems, as we know, for the first time. Based on former literature, we give a different interpretation for minimum entropy decoder and propose a relaxed linear programming decoding algorithm. With low computational complexity, the decoding algorithm can practically settle the universal decoding problems of SW systems.