Data Compression Conference (DCC'06) New Lower and Upper Bounds on the Expected Length of Optimal One-to-One Codes Snowbird, Utah March 28-March 30 ISBN: 0-7695-2545-8
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2006.52
In this paper, we consider one-to-one encodings for a discrete memoryless source, which are ?one-shot? encodings associating a distinct codeword with each source symbol. Such encodings could be employed when only a single source symbol rather than a sequence of source symbols needs to be transmitted. We consider two slightly different types of one-to-one encodings depending on whether the empty codeword is used or not. Given that the probability of the most likely source symbol is available, we provide several new lower and upper bounds on the expected length of optimal one-to-one codes.
Citation:
Jay Cheng, Tien-Ke Huang, "New Lower and Upper Bounds on the Expected Length of Optimal One-to-One Codes," dcc, pp.43-52, Data Compression Conference (DCC'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb