Show simple item record

dc.contributor.authorGadouleau, Men_US
dc.contributor.authorRiis, Sen_US
dc.date.accessioned2017-05-10T14:27:20Z
dc.date.available2011-04-22en_US
dc.date.issued2011-10en_US
dc.date.submitted2017-03-30T23:43:56.473Z
dc.identifier.issn0018-9448en_US
dc.identifier.urihttp://qmro.qmul.ac.uk/xmlui/handle/123456789/22923
dc.format.extent6703 - 6717en_US
dc.relation.ispartofIEEE T INFORM THEORYen_US
dc.subjectCyclic codesen_US
dc.subjectguessing gamesen_US
dc.subjectnetwork codingen_US
dc.subjectnetwork designen_US
dc.subjectCONSTANT-WEIGHT CODESen_US
dc.subjectINFORMATION INEQUALITIESen_US
dc.subjectMULTICASTen_US
dc.subjectFLOWen_US
dc.titleGraph-Theoretical Constructions for Graph Entropy and Network Coding Based Communicationsen_US
dc.typeArticle
dc.rights.holder© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
dc.identifier.doi10.1109/TIT.2011.2155618en_US
pubs.issue10en_US
pubs.notesNot knownen_US
pubs.volume57en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record