Universal source coding over generalized complementary delivery networks

Simple item page
dc.creatorKimura, Akisato
dc.creatorUyematsu, Tomohiko
dc.creatorKuzuoka, Shigeaki
dc.creatorWatanabe, Shun
dc.date2007-10-26
dc.date.accessioned2026-07-07T12:58:44Z
dc.date.available2026-07-07T12:58:44Z
dc.descriptionThis paper deals with a universal coding problem for a certain kind of multiterminal source coding network called a generalized complementary delivery network. In this network, messages from multiple correlated sources are jointly encoded, and each decoder has access to some of the messages to enable it to reproduce the other messages. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and the bounds of the error probabilities are clarified by using methods of types and graph-theoretical analysis.
dc.description18 pages, one column, submitted to IEEE Transactions on Information Theory, presented at a recent result session in ISIT2007
dc.identifierhttps://arxiv.org/abs/0710.4987
dc.identifierhttp://arxiv.org/abs/0710.4987
dc.identifierIEEE Transactions on Information Theory, Vol.55, No.3, pp.1360-1373, March 2009.
dc.identifierdoi:10.1109/TIT.2008.2011438
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/225343
dc.subjectInformation Theory
dc.titleUniversal source coding over generalized complementary delivery networks
dc.typetext

Files

Collections

arXiv