Analysis and practice of uniquely decodable one-to-one code

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we consider the uniquely decodable one-to-one code (UDOOC) that is obtained by inserting a comma indicator, termed the unique word (UW), between consecutive one-to-one codewords for separation. As such, we analyze a class of UDOOCs and present practical algorithms for encoding and decoding such codes. Specifically, for various cases of UWs, we investigate the number of length-n codewords of UDOOCs and their asymptotic growth rates in n. The proposed encoding and decoding algorithms of UDOOCs can be implemented in parallel at low computational complexity without storing the codebook. Simulation results show that for proper choices of UWs, UDOOCs can achieve better compression efficiency than Lempel-Ziv codes even when the source is not statistically independent.

Original languageEnglish
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages1406-1410
Number of pages5
DOIs
StatePublished - 19 Dec 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: 7 Jul 201312 Jul 2013

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/07/1312/07/13

Fingerprint Dive into the research topics of 'Analysis and practice of uniquely decodable one-to-one code'. Together they form a unique fingerprint.

Cite this