Universal coding for correlated sources with complementary delivery

This paper deals with a universal coding problem for a certain kind of multiterminal source coding system that we call the complementary delivery coding system. In this system, messages from two correlated sources are jointly encoded, and each decoder has access to one of the two messages to enable it to reproduce the other message. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and bounds of the error probabilities are clarified via type-theoretical and graph-theoretical analyses. [[Keywords]] multiterminal source coding, complementary delivery, universal coding, types of sequences, bipartite graphsComment: 18 pages, some of the material in this manuscript has been already published in IEICE Transactions on Fundamentals, September 2007. Several additional results are also include

情報源符号化の有限長解析と漸近解析 -オーバーフロー確率に着目したアプローチ-

早大学位記番号:新7784早稲田大