On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information

被引:4
|
作者
Nomura, Ryo [1 ]
Matsushima, Toshiyasu [2 ]
机构
[1] Senshu Univ, Sch Network & Informat, Kawasaki, Kanagawa 2148580, Japan
[2] Waseda Univ, Sch Fundamental Sci & Engn, Tokyo 1698555, Japan
关键词
overflow probability; side information; achievability; COMPRESSION;
D O I
10.1587/transfun.E94.A.2083
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:2083 / 2091
页数:9
相关论文
共 50 条
  • [1] On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information
    Nomura, Ryo
    Matsushima, Toshiyasu
    [J]. 2010 DATA COMPRESSION CONFERENCE (DCC 2010), 2010, : 548 - 548
  • [2] A Study on the Overflow Probability of Variable-to-Fixed Length Codes
    Kuzuoka, Shigeaki
    [J]. PROCEEDINGS OF 2020 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2020), 2020, : 26 - 30
  • [3] Almost Instantaneous Fixed-to-Variable Length Codes
    Yamamoto, Hirosuke
    Tsuchihashi, Masato
    Honda, Junya
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (12) : 6432 - 6443
  • [4] VARIABLE-TO-FIXED LENGTH CODES ARE BETTER THAN FIXED-TO-VARIABLE LENGTH CODES FOR MARKOV SOURCES
    ZIV, J
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (04) : 861 - 863
  • [5] Fixed-to-variable length source coding using turbo codes
    Haghighat, Javad
    Hamouda, Walaa
    Soleymani, M. Reza
    [J]. 2006 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS DESIGN AND IMPLEMENTATION, 2006, : 215 - 219
  • [6] On the Overflow Probability of Lossless Codes with Side Information
    Nomura, Ryo
    Matsushima, Toshiyasu
    [J]. 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 131 - 135
  • [7] VARIABLE-TO-FIXED LENGTH CODES PROVIDE BETTER LARGE DEVIATIONS PERFORMANCE THAN FIXED-TO-VARIABLE LENGTH CODES
    MERHAV, N
    NEUHOFF, DL
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (01) : 135 - 140
  • [8] Threshold of Overflow Probability Using Smooth Max-Entropy in Lossless Fixed-to-Variable Length Source Coding for General Sources
    Saito, Shota
    Matsushima, Toshiyasu
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2016, E99A (12): : 2286 - 2290
  • [9] Overflow Probability of Variable-Length Codes With Codeword Cost
    Nomura, Ryo
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (12) : 8194 - 8206
  • [10] Fixed-to-Variable Length Distribution Matching
    Amjad, Rana Ali
    Boecherer, Georg
    [J]. 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1511 - 1515