A New Source Coding Scheme with Small Expected Length and Its Application to Simple Data Encryption

Authors:
Xiaoyu Ruan;Rajendra S. Katti
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
2006

Citing 7
Cited 1

Storing text retrieval systems on CD-ROM: compression and encryption considerations

ACM Transactions on Information Systems (TOIS)
Source coding algorithms for fast data compression.

Source coding algorithms for fast data compression.
Cypress: Compression and Encryption of Data and Code for Embedded Multimedia Systems

IEEE Design & Test
Improving Memory Encryption Performance in Secure Processors

IEEE Transactions on Computers
On compressing encrypted data

IEEE Transactions on Signal Processing - Part II
On breaking a Huffman code

IEEE Transactions on Information Theory
The context-tree weighting method: basic properties

IEEE Transactions on Information Theory

Transparent encryption techniques for H.264/AVC and H.264/SVC compressed video

Signal Processing

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.