DocumentCode
2061244
Title
Perfect homophonic substitution with finite memory
Author
Da Rocha, Valdemar C., Jr.
Author_Institution
Comms. Res. Group, Univ. Fed. de Pernambuco, Recife, Brazil
fYear
2002
fDate
2002
Firstpage
409
Abstract
A finite memory technique is introduced for implementing the perfect homophonic coding scheme of Jendal-Kuhn-Massey, for sources whose symbol probabilities are rational numbers.
Keywords
cryptography; information theory; probability; source coding; Jendal-Kuhn-Massey scheme; discrete memoryless source; finite memory technique; homophonic substitution; perfect homophonic coding; rational numbers; symbol probabilities; Binary sequences; Brazil Council; Decoding; Dictionaries; Probability distribution; Random variables; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023681
Filename
1023681
Link To Document