In the above paper <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">¹</tex> 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.
No takes yet. Share an insight, caveat, or question.
Boris Ryabko (1981) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: