## Abstract

The source-channel coding theorem was studied. For this purpose, an example of memoryless information stable source-channel for which the separation theorem fails to hold was considered first. It was observed that this example did not provide the necessary information, thus for such case a careful look at the statistical structure of the channel and the source must be considered. This proves that two similar conditions called domination and strict domination are necessary and sufficient for reliable transmissibility. Basing from this, the channels for which the classical statement of the separation theorem holds for every source is characterized. It is noted that when dealing with nonstationary probabilistic models, care should be exercised before applying the separation theorem.

Original language | English (US) |
---|---|

Title of host publication | IEEE International Symposium on Information Theory - Proceedings |

Publisher | IEEE |

State | Published - Dec 1 1994 |

Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: Jun 27 1994 → Jul 1 1994 |

### Other

Other | Proceedings of the 1994 IEEE International Symposium on Information Theory |
---|---|

City | Trodheim, Norw |

Period | 6/27/94 → 7/1/94 |

## All Science Journal Classification (ASJC) codes

- Electrical and Electronic Engineering