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 asymptotics with second-order bounds scaled as Θ(√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.
Sho HIGUCHI
University of Hyogo
Yuta SAKAI
Shimane University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Sho HIGUCHI, Yuta SAKAI, "A Fundamental Limit of Variable-Length Compression with Worst-Case Criteria in Terms of Side Information" in IEICE TRANSACTIONS on Fundamentals,
vol. E107-A, no. 3, pp. 384-392, March 2024, doi: 10.1587/transfun.2023TAP0003.
Abstract: 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 asymptotics with second-order bounds scaled as Θ(√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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2023TAP0003/_p
Copy
@ARTICLE{e107-a_3_384,
author={Sho HIGUCHI, Yuta SAKAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Fundamental Limit of Variable-Length Compression with Worst-Case Criteria in Terms of Side Information},
year={2024},
volume={E107-A},
number={3},
pages={384-392},
abstract={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 asymptotics with second-order bounds scaled as Θ(√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.},
keywords={},
doi={10.1587/transfun.2023TAP0003},
ISSN={1745-1337},
month={March},}
Copy
TY - JOUR
TI - A Fundamental Limit of Variable-Length Compression with Worst-Case Criteria in Terms of Side Information
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 384
EP - 392
AU - Sho HIGUCHI
AU - Yuta SAKAI
PY - 2024
DO - 10.1587/transfun.2023TAP0003
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E107-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2024
AB - 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 asymptotics with second-order bounds scaled as Θ(√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.
ER -