Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
dc.contributor.author | Gadouleau, M | en_US |
dc.contributor.author | Riis, S | en_US |
dc.date.accessioned | 2017-05-10T14:27:20Z | |
dc.date.available | 2011-04-22 | en_US |
dc.date.issued | 2011-10 | en_US |
dc.date.submitted | 2017-03-30T23:43:56.473Z | |
dc.identifier.issn | 0018-9448 | en_US |
dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/22923 | |
dc.format.extent | 6703 - 6717 | en_US |
dc.relation.ispartof | IEEE T INFORM THEORY | en_US |
dc.subject | Cyclic codes | en_US |
dc.subject | guessing games | en_US |
dc.subject | network coding | en_US |
dc.subject | network design | en_US |
dc.subject | CONSTANT-WEIGHT CODES | en_US |
dc.subject | INFORMATION INEQUALITIES | en_US |
dc.subject | MULTICAST | en_US |
dc.subject | FLOW | en_US |
dc.title | Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications | en_US |
dc.type | Article | |
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.doi | 10.1109/TIT.2011.2155618 | en_US |
pubs.issue | 10 | en_US |
pubs.notes | Not known | en_US |
pubs.volume | 57 | en_US |