Entropy vectors and network codes

Simple item page
dc.creatorChan, Terence
dc.creatorGrant, Alex
dc.date2007-02-10
dc.date.accessioned2026-07-07T08:17:03Z
dc.date.available2026-07-07T08:17:03Z
dc.descriptionWe consider a network multicast example that relates the solvability of the multicast problem with the existence of an entropy function. As a result, we provide an alternative approach to the proving of the insufficiency of linear (and abelian) network codes and demonstrate the utility of non-Shannon inequalities to tighten outer bounds on network coding capacity regions.
dc.identifierhttps://arxiv.org/abs/cs/0702063
dc.identifierhttp://arxiv.org/abs/cs/0702063
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133995
dc.subjectInformation Theory
dc.subjectNetworking and Internet Architecture
dc.titleEntropy vectors and network codes
dc.typetext

Files

Collections

arXiv