Title :
A coding theorem on the fixed-length homophonic coding for a general source
Author_Institution :
Fac. of Eng. Mech. & Syst., Tsukuba Univ., Ibaraki, Japan
Abstract :
The homophonic coding is useful for some cryptographic applications. This paper treats a coding theorem on the fixed-length homophonic coding with the vanishing decoding error probability. It is proved that the achievable rate region of the fixed-length homophonic coding for a general source X is completely expressed by using the spectral sup-entropy rate H¯(X) and a newly introduced quantity W(X) meaning the asymptotic width of the entropy-spectrum of X
Keywords :
cryptography; decoding; entropy; error statistics; source coding; spectral analysis; achievable rate region; asymptotic width; coding theorem; cryptographic applications; entropy-spectrum; fixed-length homophonic coding; general source; source coding; spectral sup-entropy rate; vanishing decoding error probability; Approximation methods; Codes; Cryptography; Decoding; Entropy; Probability distribution; Random variables; Statistics; Systems engineering and theory; Zinc;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.936080
