DocumentCode :
1748020
Title :
Universal homophonic coding
Author :
Fionov, Andrei
Author_Institution :
Siberian State Univ. of Telecom., Novosibirsk, Russia
fYear :
2001
fDate :
2001
Firstpage :
116
Abstract :
Homophonic coding is expanded to memoryless sources with unknown statistics to produce an unbreakable and computationally efficient cryptosystem
Keywords :
cryptography; decoding; encoding; error statistics; memoryless systems; computationally efficient cryptosystem; decoding; error probability; memoryless sources; random sequence; secret key cipher system; stationary memoryless sources; statistics; unbreakable efficient cryptosystem; universal homophonic coding; Arithmetic; Counting circuits; Decoding; Encoding; Gaussian distribution; Random sequences; Reactive power; Redundancy; Statistics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
Type :
conf
DOI :
10.1109/ISIT.2001.935979
Filename :
935979
Link To Document :
بازگشت