Graph-Entropic Characterization of Optimal Zero-Error Coding with Side Information


Click here to start


Table of Contents

Graph-Entropic Characterization of Optimal Zero-Error Coding with Side Information

Outline

Outline

Problem Definition

Graph-theoretic Formulation

PPT Slide

Extension to Vectors

Minimum Asymptotic Rate

Some Basic Graph Theory

Complementary Graph Entropy

Links with Zero-error Capacity

Main Result

Minimum Rate: Bounds

What We Prove

Further Results

Further Results

Author: Prashant Koulgi