By Topic

Comments on "A source matching approach to finding minimax codes" by Davisson, L. D. and Leon-Garcia, A.

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

1 Author(s)
Ryabko, B. ; Siberian State Academy of Telecommunications and Computer Science, Novosibirsk, Russia

In the above paper^{1}Davisson and Leon-Garcia prove a result equating the minimax redundancy for universal codes to a channel capacity that is computable by standard techniques. They point out that the result had been developed earlier in unpublished work by Gallager. I would like to point out an alternative development of this result and to compare this work with that of Davisson and Leon-Garcia.

Published in:

Information Theory, IEEE Transactions on  (Volume:27 ,  Issue: 6 )