By Topic

Reducing the Length of Shannon-Fano-Elias Codes and Shannon-Fano Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiaoyu Ruan ; Dept. of Electr. & Comput. Eng., North Dakota State Univ., Fargo, ND ; Katti, R.

In some applications, both data compression and encryption are required. If the cryptanalyst knows the code construction rule and the probability mass function (PMF) of the source, then Huffman code provides no ambiguity, but Shannon-Fano-Elias coding is a good candidate since the order of symbols can be arbitrary in the encoding process, which produces exponential complexity for deciphering. However, the conventional Shannon-Fano-Elias code has relatively large expected length which makes it inefficient. In this paper, we propose two simple algorithms to reduce the expected length of Shannon-Fano-Elias code so that its efficiency is improved. This is achieved by first utilizing some proper PMF instead of the actual PMF in encoding, and then performing a codeword truncation. By applying the same strategy we can also reduce the length of Shannon-Fano codes

Published in:

Military Communications Conference, 2006. MILCOM 2006. IEEE

Date of Conference:

23-25 Oct. 2006