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

Author

Ruan, Xiaoyu ; Katti, Rajendra S.

Author_Institution

Dept. of Electr. & Comput. Eng., North Dakota State Univ., Fargo, ND

Volume

55

Issue

10

fYear

2006

Firstpage

1300

Lastpage

1305

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

Keywords

Huffman codes; computational complexity; cryptography; probability; source coding; variable length codes; Huffman codes; Shannon-Fano-Elias codes; code construction rule; data compression; data encryption; eavesdropping; encoding algorithm; exponential complexity; prefix codes; source coding scheme; source probability mass function; source symbol ordering; variable-length codes; Arithmetic; Cryptography; Data communication; Data compression; Data security; Databases; Decoding; Information security; Protection; Source coding; Code length; Huffman codes; Shannon-Fano-Elias codes; data compression; encryption; prefix codes; source coding; variable-length codes.;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/TC.2006.155

Filename

1683760