By Topic

An easily implementable universal code for the binary source (Corresp.)

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
$33 $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

1 Author(s)

Recently Gallager has given the construction for an optimal source code for geometrically distributed integer alphabets. Gallager's code can be modified to perform as a universal code for the memoryless binary source; this code construction has several important practical advantages over previous universal codes for the binary source.

Published in:

IEEE Transactions on Information Theory  (Volume:28 ,  Issue: 4 )