Minimax codes for finite alphabets (Corresp.)
- 1 May 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 24 (3), 389-392
- https://doi.org/10.1109/tit.1978.1055876
Abstract
Minimax codes are designed for applications where the symbol probabilities are not known except for their order. A minimax code is defined by real-valued parameters/, (resembling the lengths of codewords) which minimize the maximum ratio(\Sigma_{i}p_{i}l_{i})/(--\Sigma_{i}p_{i}\logp_{i})subject to\Sigma_{i}2^{-l_{i}}\leq1over the set of monotonically nonincreasing distributions such thatp_{1}\leq1/mforman integer greater than one.Keywords
This publication has 4 references indexed in Scilit:
- Generalized Kraft Inequality and Arithmetic CodingIBM Journal of Research and Development, 1976
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975
- Universal noiseless codingIEEE Transactions on Information Theory, 1973
- Prediction and Entropy of Printed EnglishBell System Technical Journal, 1951