DocumentCode :
928450
Title :
Minimax codes for finite alphabets (Corresp.)
Author :
Rissanen, J.
Volume :
24
Issue :
3
fYear :
1978
fDate :
5/1/1978 12:00:00 AM
Firstpage :
389
Lastpage :
392
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}\\log p_{i}) subject to \\Sigma _{i}2^{-l_{i}}\\leq1 over the set of monotonically nonincreasing distributions such that p_{1}\\leq1/m for m an integer greater than one.
Keywords :
Minimax optimization; Source coding; Computer languages; Encoding; Error correction codes; Frequency estimation; Minimax techniques; Page description languages; Registers; Research and development; Sequential circuits; Welding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1978.1055876
Filename :
1055876
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=928450
بازگشت