### Abstract

The overflow probability is one of criteria that evaluate the performance of fixed-to-variable length (FV) codes. 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. In particular, 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 |
---|---|

Pages (from-to) | 2083-2091 |

Number of pages | 9 |

Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |

Volume | E94-A |

Issue number | 11 |

DOIs | |

Publication status | Published - 2011 Nov |

### Fingerprint

### Keywords

- Achievability
- Overflow probability
- Side information

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Computer Graphics and Computer-Aided Design
- Applied Mathematics
- Signal Processing

### Cite this

**On the overflow probability of fixed-to-variable length codes with side information.** / Nomura, Ryo; Matsushima, Toshiyasu.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - On the overflow probability of fixed-to-variable length codes with side information

AU - Nomura, Ryo

AU - Matsushima, Toshiyasu

PY - 2011/11

Y1 - 2011/11

N2 - The overflow probability is one of criteria that evaluate the performance of fixed-to-variable length (FV) codes. 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. In particular, 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.

AB - The overflow probability is one of criteria that evaluate the performance of fixed-to-variable length (FV) codes. 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. In particular, 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.

KW - Achievability

KW - Overflow probability

KW - Side information

UR - http://www.scopus.com/inward/record.url?scp=80155211364&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80155211364&partnerID=8YFLogxK

U2 - 10.1587/transfun.E94.A.2083

DO - 10.1587/transfun.E94.A.2083

M3 - Article

VL - E94-A

SP - 2083

EP - 2091

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 11

ER -