Title :
On synchronous coding
Author :
Long, Dongyang ; Jia, Weijia ; Li, Ming
Author_Institution :
Dept. of Comput. Sci., City Univ. of Hong Kong, Kowloon, China
Abstract :
Novel synchronous coding schemes are introduced and relationships between optimal synchronous codes and Huffman codes are also discussed. Although the problem of existence of optimal synchronous codes has not been resolved yet, we show that any synchronous code can consider as an optimal synchronous code for some information source and that there always exist optimal synchronous codes for the information source with a dyadic probability distribution. Comparing with Huffman coding, the synchronous coding is used not only for statistical modeling but also for dictionary methods. Moreover, it is proven that breaking a synchronous code is NP-complete.
Keywords :
Huffman codes; cryptography; data compression; encoding; Huffman codes; NP-complete problem; data compression; dictionary methods; dyadic probability distribution; information source; optimal maximal prefix codes; optimal synchronous codes; statistical modeling; synchronous coding; Computer science; Data compression; Dictionaries; Huffman coding; Partial response channels; Probability distribution; Sufficient conditions;
Conference_Titel :
Information Technology: Coding and Computing, 2002. Proceedings. International Conference on
Print_ISBN :
0-7695-1506-1
DOI :
10.1109/ITCC.2002.1000421
