Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

On the asymptotic redundancy of lossless block coding with two codeword lengths

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)
Figueroa, E. ; Dept. of Math., Purdue Univ., West Lafayette, IN, USA ; Houdre, C.

With the additional constraint of requiring only two codeword lengths, lossless codes of blocks of size n generated by stationary memoryless binary sources are studied. For arbitrary δ>0, classical large-deviation inequalities imply the existence of codes attaining an expected redundancy of the order O(n-12+δ/). It is shown that it is not possible to construct lossless codes with two codeword lengths having rate of order better or equal to O(n-12/).

Published in:

Information Theory, IEEE Transactions on  (Volume:51 ,  Issue: 2 )