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

  • Authors:
  • B. Ryabko

  • Affiliations:
  • Siberian State Academy of Telecommunications and Computer Science, Novosibirsk, Russia

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

Abstract

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.