Comments on "A source matching approach to finding minimax codes" by Davisson, L. D. and Leon-Garcia, A.
- 1 November 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 27 (6) , 780-781
- https://doi.org/10.1109/TIT.1981.1056409
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.Keywords
This publication has 4 references indexed in Scilit:
- The performance of universal encodingIEEE Transactions on Information Theory, 1981
- Optimal key for taxons ordered in accordance with their frequenciesDiscrete Applied Mathematics, 1981
- Minimax codes for finite alphabets (Corresp.)IEEE Transactions on Information Theory, 1978
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975