The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 연구에서는 인코더와 디코더 모두에서 사용할 수 있는 부가 정보를 사용하여 데이터 압축을 고려합니다. 정보 소스는 접두어 없는 제약 조건을 만족할 필요가 없는 가변 길이 코드에 할당됩니다. 우리는 코드워드 길이와 오류 확률이 부가 정보 측면에서 최악의 기준을 만족하는 여러 클래스의 코드를 정의합니다. 주요 결과로 우리는 Θ(√로 스케일링된 2차 경계를 사용하여 정확한 1차 점근법을 조사합니다.n) 블록 길이로 n 사라지지 않는 오류 확률 체제 하에서 증가합니다. 이 결과를 얻기 위해 컷오프 연산을 사용하여 일회성 경계도 도출합니다.
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.
부
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
부
@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},}
부
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 -