By Topic

Minimax codes for finite alphabets (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:24 ,  Issue: 3 )