Capacity of a Class of Multicast Tree Networks

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 291
  • Download : 7
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.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2013-06
Language
English
Article Type
Article
Keywords

RELAY CHANNELS; INFORMATION-FLOW; THEOREMS

Citation

IEEE TRANSACTIONS ON INFORMATION THEORY, v.59, no.6, pp.3848 - 3857

ISSN
0018-9448
DOI
10.1109/TIT.2013.2253871
URI
http://hdl.handle.net/10203/175038
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0