Name
Abstract | ||
|---|---|---|
In this letter, 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 eta(n) and we introduce the epsilon-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 epsilon. Then we show that the epsilon-achievability of variable-length codes is essentially equivalent to the epsilon-achievability of fixed-length codes for general sources. Moreover by using above results, we show the condition of epsilon-achievability for some restricted sources given epsilon. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1093/ietfec/e90-a.12.2965 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | DocType | Volume |
fixed-length codes, error probability, overflow probability, variable-length codes | Journal | E90A |
Issue | ISSN | Citations |
12 | 0916-8508 | 1 |
PageRank | References | Authors |
0.37 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. NOMURA | 1 | 6 | 2.55 |
| T. MATSUSHIMA | 2 | 1 | 0.37 |
| Shigeichi Hirasawa | 3 | 78 | 53.22 |