Capacity of a class of multicast tree networks
SCIE
SCOPUS
- Title
- Capacity of a class of multicast tree networks
- Authors
- Lee, Si-Hyeon; Chung, Sae-Young
- Date Issued
- 2013-06
- Publisher
- IEEE
- Abstract
- In this paper, we characterize the capacity of a new class of discrete memoryless multicast networks having a tree topology. For achievability, a novel coding scheme is constructed where some relays employ a combination of decode-and-forward and compress-and-forward and the other relays perform a random binning such that codebook constructions and relay operations are independent for each node and do not depend on the network topology. For converse, a new technique of iteratively manipulating inequalities exploiting the tree topology is used. This class of multicast tree networks includes the class of diamond networks studied by Kang and Ulukus as a special case.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/38063
- DOI
- 10.1109/TIT.2013.2253871
- ISSN
- 0018-9448
- Article Type
- Article
- Citation
- IEEE Transactions on Information Theory, vol. 59, no. 6, page. 3848 - 3857, 2013-06
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.