@inproceedings{6e871ae2847741a6b9a85be56d9eae30,

title = "A lower bound on the redundancy of arithmetic-type delay constrained coding",

abstract = "In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite end-to-end strict delay constraint. It was shown that the redundancy decays exponentially with the delay constraint and that the redundancy-delay exponent is lower bounded by log(l/α) where α is the probability of the most likely source symbol. In this work, we prove a corresponding upper bound for the redundancy-delay exponent, C · log 1/β where β is the probability of the least likely source symbol. This bound is valid for almost all memoryless sources and for all arithmetic-type (possibly time-varying, memory dependent) lossless delay-constrained encoders. We also shed some light on the difference between our exponential bounds and the polynomial O(d -5/3) upper bound on the redundancy with an average delay constraint d, derived in an elegant paper by Bugeaud, Drmota and Szpankowski for another class of variable-to-variable encoders, and show that the difference is due to the precision needed to memorize the encoder's state.",

author = "Eado Meron and Ofer Shayevitz and Meir Feder and Ram Zamir",

year = "2008",

doi = "10.1109/DCC.2008.84",

language = "אנגלית",

isbn = "0769531210",

series = "Data Compression Conference Proceedings",

pages = "489--498",

booktitle = "Proceedings - 2008 Data Compression Conference, DCC 2008",

note = "null ; Conference date: 25-03-2008 Through 27-03-2008",

}