### Abstract

Lossless fixed-to-variable(FV) length codes are considered. The overflow probability is one of criteria that evaluate the performance of FV code. In the single source coding problem, there were many researches on the overflow probability. Recently, the source coding problem for correlated sources, such as Slepian-Wolf coding problem or source coding problem with side information, is one of main topics in information theory. In this paper, we consider the source coding problem with side information. Especially, we consider the FV code in the case that the encoder and the decoder can see side information. In this case, several codes were proposed and their mean code lengths were analyzed. However, there was no research about the overflow probability. We shall show two lemmas about the overflow probability. Then we obtain the condition that there exists a FV code under the condition that the overflow probability is smaller than or equal to some constant.

Original language | English |
---|---|

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

Pages | 131-135 |

Number of pages | 5 |

DOIs | |

Publication status | Published - 2010 Aug 23 |

Event | 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States Duration: 2010 Jun 13 → 2010 Jun 18 |

### Publication series

Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|

ISSN (Print) | 2157-8103 |

### Conference

Conference | 2010 IEEE International Symposium on Information Theory, ISIT 2010 |
---|---|

Country | United States |

City | Austin, TX |

Period | 10/6/13 → 10/6/18 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics

## Fingerprint Dive into the research topics of 'On the overflow probability of lossless codes with side information'. Together they form a unique fingerprint.

## Cite this

*2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings*(pp. 131-135). [5513268] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2010.5513268