The Community for Technology Leaders
Green Image
We present a new source coding scheme with smaller expected length than Shannon-Fano-Elias codes. The ordering of source symbols input to the proposed encoding algorithm can be arbitrary. We show that this property leads to exponential complexity for eavesdropping even though an adversary knows the code construction rule and the probability mass function of the source.
Code length, data compression, encryption, Huffman codes, prefix codes, Shannon-Fano-Elias codes, source coding, variable-length codes.

X. Ruan and R. S. Katti, "A New Source Coding Scheme with Small Expected Length and Its Application to Simple Data Encryption," in IEEE Transactions on Computers, vol. 55, no. , pp. 1300-1305, 2006.
84 ms
(Ver 3.3 (11022016))