DocumentCode
2443720
Title
Fast homophonic coding with logarithmic memory size
Author
Ryabko, Boris ; Fionov, Andrey
Author_Institution
Siberian State Acad. of Telecommun., Novosibirsk, Russia
fYear
1998
fDate
16-21 Aug 1998
Firstpage
52
Abstract
A homophonic coding method is suggested that attains arbitrarily small redundancy and requires logarithmic memory and roughly logarithmic time. The complexity of the method is exponentially less that that for other known methods. The method is based on applying arithmetic coding with some modifications that ensure complete randomness of the code sequence
Keywords
arithmetic codes; computational complexity; random codes; arithmetic coding; complexity; fast homophonic coding; logarithmic memory size; logarithmic time; random code sequence; redundancy; secret-key cipher systems; Arithmetic; Block codes; Decoding; Encoding; Entropy; Random variables; Redundancy; Telecommunication computing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708633
Filename
708633
Link To Document