A Fundamental Limit of Variable-Length Compression with Worst-Case Criteria in Terms of Side Information

抄録

In this study, we consider the data compression with side information available at both the encoder and the decoder. The information source is assigned to a variable-length code that does not have to satisfy the prefix-free constraints. We define several classes of codes whose codeword lengths and error probabilities satisfy worse-case criteria in terms of side-information. As a main result, we investigate the exact first-order asy mptotics with second-order bounds scaled as $\Theta(\sqrt{n})$ as blocklength n increases under the regime of nonvanishing error probabilities. To get this result, we also derive its one-shot bounds by employing the cutoff operation.