Universal Source Coding Over Generalized Complementary Delivery Networks
From MaRDI portal
Publication:4975779
DOI10.1109/TIT.2008.2011438zbMATH Open1367.94206arXiv0710.4987OpenAlexW3102670541MaRDI QIDQ4975779FDOQ4975779
Authors: Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka, Shun Watanabe 
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: This 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.
Full work available at URL: https://arxiv.org/abs/0710.4987
This page was built for publication: Universal Source Coding Over Generalized Complementary Delivery Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975779)
