Communication of dependent messages over degraded compound channels

In the communication of source-coded messages, certain dependency structures often exist among the messages, where a source model is proposed to model arbitrary dependency structure of such kind. Under a message-dependency model, the problem of communicating dependent messages subject to certain del...

Full description

Saved in:
Bibliographic Details
Published in2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) pp. 156 - 159
Main Authors Zhong Cheng, Yongyi Mao, Chan, Terence
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2015
Subjects
Compounds
Decoding
Delays
Encoding
Entropy
Receivers
Online AccessGet full text
DOI10.1109/CWIT.2015.7255175

Cover

More Information
Summary:In the communication of source-coded messages, certain dependency structures often exist among the messages, where a source model is proposed to model arbitrary dependency structure of such kind. Under a message-dependency model, the problem of communicating dependent messages subject to certain delay constraint is formulated as the problem of maximizing the average utility at the receiver. In this paper we derive the maximal achievable utilities for superposition codes and conventional channel codes over degraded compound channels. Analytic and numerical results are presented.
DOI:10.1109/CWIT.2015.7255175