Abstract-We propose two coding schemes for discrete memoryless multicast networks with rate-limited feedback from receivers and relays to the transmitter. The coding schemes are based on block Markov coding, joint backward decoding and hybrid relaying strategy. In each block, the receivers and relays compress their outputs and send the compression indices to the transmitter through the feedback links. In the next block, after obtaining compression indices, the transmitter sends them together with the source message. Each receiver uses backward decoding to jointly decode the source message and all compression indices. It is shown that our coding schemes strictly improve on noisy network coding and generalize Gabbai and Bross's results for the single relay channel with partial feedback, where they proposed schemes based on restricted decoding and deterministic partitioning. Motivated by our feedback schemes, we propose a new coding scheme for discrete memoryless multicast networks without feedback.
I. INTRODUCTIONThe relay channel, first introduced by van de Meulen [1], describes a 3-node communication channel where the transmitter sends a message to the receiver with the assistance of relay. Cover and El Gamal [2] proposed two basic coding strategies: compress-forward and decode-forward, for the discrete memoryless relay channel. Both strategies are based on block Markov coding. In the compress-forward strategy, the relay compresses its outputs and sends compression index to the receiver. In the decode-forward strategy, the relay first decodes the full or part of source message and then sends the decoded message to the receiver. Both strategies have been generalized to multiple-relay channels [3]. The compressforward was later extended to a more general network-discrete memoryless networks [4], [5], [6], called noisy network coding (NNC). Recently, a distributed decode-forward coding (DDF) scheme was proposed for multicast [7] and broadcast relay networks [8], which uses the partial decode-forward at the relays and backward coding at the transmitter.Perfect feedback from the receiver to the relay makes the relay channel is physically degraded [2], and therefore decodeforward achieves the capacity. For the case with feedback from the receiver or relay to the transmitter, the capacity is unknown in general. In [9] Gabbai and Bross studied this problem and proposed inner bounds by using restricted decoding and deterministic partitioning [10].In this paper, we consider the general discrete memoryless multicast network with rate-limited feedback. This network