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 <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(\Sigma_{i}p_{i}l_{i})/(--\Sigma_{i}p_{i}\logp_{i})</tex> subject to <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\Sigma_{i}2^{-l_{i}}\leq1</tex> over the set of monotonically nonincreasing distributions such that <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p_{1}\leq1/m</tex> for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</tex> an integer greater than one.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
