IEICE TRANSACTIONS on Fundamentals
Variable-Length Coding with Cost Allowing Non-Vanishing Error Probability
Summary :
We consider fixed-to-variable length coding with a regular cost function by allowing the error probability up to any constantε. We first derive finite-length upper and lower bounds on the average codeword cost, which are used to derive general formulas of two kinds of minimum achievable rates. For a fixed-to-variable length code, we call the set of source sequences that can be decoded without error the dominant set of source sequences. For any two regular cost functions, it is revealed that the dominant set of source sequences for a code attaining the minimum achievable rate under a cost function is also the dominant set for a code attaining the minimum achievable rate under the other cost function. We also give general formulas of the second-order minimum achievable rates.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.8 pp.1683-1692
- Publication Date
- 2017/08/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E100.A.1683
- Type of Manuscript
- PAPER
- Category
- Information Theory
Authors
Hideki YAGI
University of Electro-Communications
Ryo NOMURA
Senshu University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Hideki YAGI, Ryo NOMURA, "Variable-Length Coding with Cost Allowing Non-Vanishing Error Probability" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 8, pp. 1683-1692, August 2017, doi: 10.1587/transfun.E100.A.1683.
Abstract: We consider fixed-to-variable length coding with a regular cost function by allowing the error probability up to any constantε. We first derive finite-length upper and lower bounds on the average codeword cost, which are used to derive general formulas of two kinds of minimum achievable rates. For a fixed-to-variable length code, we call the set of source sequences that can be decoded without error the dominant set of source sequences. For any two regular cost functions, it is revealed that the dominant set of source sequences for a code attaining the minimum achievable rate under a cost function is also the dominant set for a code attaining the minimum achievable rate under the other cost function. We also give general formulas of the second-order minimum achievable rates.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.1683/_p
Copy
@ARTICLE{e100-a_8_1683,
author={Hideki YAGI, Ryo NOMURA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Variable-Length Coding with Cost Allowing Non-Vanishing Error Probability},
year={2017},
volume={E100-A},
number={8},
pages={1683-1692},
abstract={We consider fixed-to-variable length coding with a regular cost function by allowing the error probability up to any constantε. We first derive finite-length upper and lower bounds on the average codeword cost, which are used to derive general formulas of two kinds of minimum achievable rates. For a fixed-to-variable length code, we call the set of source sequences that can be decoded without error the dominant set of source sequences. For any two regular cost functions, it is revealed that the dominant set of source sequences for a code attaining the minimum achievable rate under a cost function is also the dominant set for a code attaining the minimum achievable rate under the other cost function. We also give general formulas of the second-order minimum achievable rates.},
keywords={},
doi={10.1587/transfun.E100.A.1683},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - Variable-Length Coding with Cost Allowing Non-Vanishing Error Probability
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1683
EP - 1692
AU - Hideki YAGI
AU - Ryo NOMURA
PY - 2017
DO - 10.1587/transfun.E100.A.1683
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2017
AB - We consider fixed-to-variable length coding with a regular cost function by allowing the error probability up to any constantε. We first derive finite-length upper and lower bounds on the average codeword cost, which are used to derive general formulas of two kinds of minimum achievable rates. For a fixed-to-variable length code, we call the set of source sequences that can be decoded without error the dominant set of source sequences. For any two regular cost functions, it is revealed that the dominant set of source sequences for a code attaining the minimum achievable rate under a cost function is also the dominant set for a code attaining the minimum achievable rate under the other cost function. We also give general formulas of the second-order minimum achievable rates.
ER -
English
