Title :
On the entropy bound for optimum homophonic substitution
Author :
Da Rocha, Valdemar C., Jr. ; Massey, James L.
Author_Institution :
CODEC, Univ. Fed. de Pernambuco, Recife, Brazil
fDate :
29 Jun-4 Jul 1997
Abstract :
A proof is given of the fact that, for optimum binary prefix-free homophonic coding, the entropy of a homophone is less than 2 bits greater than that of its antecedent regardless of the alphabet size for this antecedent
Keywords :
cryptography; discrete systems; entropy; memoryless systems; optimisation; source coding; alphabet size; antecedent; cryptographic technique; discrete memoryless source; entropy bound; message redundancy reduction; optimum binary prefix-free homophonic coding; optimum homophonic substitution; source coding; Costs; Cryptography; Entropy; Probability distribution; Random variables; Upper bound;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613008
