DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Si-Hyeon | ko |
dc.contributor.author | Chung, Sae-Young | ko |
dc.date.accessioned | 2013-08-14T01:09:57Z | - |
dc.date.available | 2013-08-14T01:09:57Z | - |
dc.date.created | 2013-08-09 | - |
dc.date.created | 2013-08-09 | - |
dc.date.created | 2013-08-09 | - |
dc.date.created | 2013-08-09 | - |
dc.date.issued | 2013-06 | - |
dc.identifier.citation | IEEE TRANSACTIONS ON INFORMATION THEORY, v.59, no.6, pp.3848 - 3857 | - |
dc.identifier.issn | 0018-9448 | - |
dc.identifier.uri | http://hdl.handle.net/10203/175038 | - |
dc.description.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. | - |
dc.language | English | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | Capacity of a Class of Multicast Tree Networks | - |
dc.type | Article | - |
dc.identifier.wosid | 000320709800039 | - |
dc.identifier.scopusid | 2-s2.0-84877918194 | - |
dc.type.rims | ART | - |
dc.citation.volume | 59 | - |
dc.citation.issue | 6 | - |
dc.citation.beginningpage | 3848 | - |
dc.citation.endingpage | 3857 | - |
dc.citation.publicationname | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
dc.identifier.doi | 10.1109/TIT.2013.2253871 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Lee, Si-Hyeon | - |
dc.contributor.localauthor | Chung, Sae-Young | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Compress-and-forward | - |
dc.subject.keywordAuthor | decode-and-forward | - |
dc.subject.keywordAuthor | diamond network | - |
dc.subject.keywordAuthor | multicast tree network | - |
dc.subject.keywordAuthor | relay network | - |
dc.subject.keywordAuthor | tree topology | - |
dc.subject.keywordPlus | RELAY CHANNELS | - |
dc.subject.keywordPlus | INFORMATION-FLOW | - |
dc.subject.keywordPlus | THEOREMS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.