### Abstract

In this paper, we generalize the achievability of variable-length coding from two viewpoints. One is the definition of an overflow probability, and the other is the definition of an achievability. We define the overflow probability as the probability of codeword length, not per symbol, is larger than η_{n} and we introduce the ε-achievability of variable-length codes that implies an existence of a code for the source under the condition that the overflow probability is smaller than or equal to ε. Then we show that the ε-achievability of variable-length codes is essentially equivalent to the ε-achievability of fixed-length codes for general sources. Moreover we show the condition of ε-achievability for some restricted sources given ε.

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

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

Pages | 441-445 |

Number of pages | 5 |

DOIs | |

Publication status | Published - 2007 Dec 1 |

Event | 2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France Duration: 2007 Jun 24 → 2007 Jun 29 |

### Publication series

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

ISSN (Print) | 2157-8101 |

### Conference

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

Country | France |

City | Nice |

Period | 07/6/24 → 07/6/29 |

### ASJC Scopus subject areas

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

## Cite this

*Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007*(pp. 441-445). [4557265] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2007.4557265