New Upper and Lower Bounds on Exponentially Weighted Average Length of Optimal Binary Prefix Codes

摘要：

In this paper, we consider the exponen tially weighted average codeword length introduced by Campbell as a performance measure for source codes. This criterion assumes that the cost is an exponential function of the codeword length and includes the usual expected codeword length criterion as a special case. Such situations could arise when the cost for encoding and decoding is significant, or if the buffer overflow caused by long codewords is a serious issue.Under Campbells average codeword length criterion,we derive new upper and lower bounds on the exponentiated expected length of optimal binary prefix codes when partial information about the source symbol probabilities is available.

作者: Yen-Yi Lee Jay Cheng Tien-Ke Huang

作者单位: Department of Electrical Engineering and Institute of Communications Engineering National Tsing Hua University Hsinchu, Taiwan 30013, R.O.C.

会议类型: 国际会议

会议名称: 2006年IEEE信息理论国际会议(Proceedings of 2006 IEEE Information Theory Workshop ITW06)

会议地点: 成都

会议语种:英文

页码: 318-321

在线出版日期: 2006-10-22（万方平台首次上网日期，不代表论文的发表时间）