Capacity of the binomial channel, or minimax redundancy for memoryless sources

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2001, Pages 127-

  Komninakis, C ^a   Vandenberghe, L ^a   Wesel, R D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINOMIAL CHANNELS; CONVEX OPTIMIZATION; MEMORYLESS SOURCES; MINIMAX CODING REDUNDANCY;

ALGORITHMS; ASYMPTOTIC STABILITY; CONSTRAINT THEORY; LAGRANGE MULTIPLIERS; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; SIGNAL ENCODING;

CHANNEL CAPACITY;

EID: 0034849883     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Minimax redundancy for the class of memoryless sources
2. Some aspects of convexity useful in information theory
3. Convex optimization
4. Inequalities of the types of Chebyshev and Cramèr-Rao and mathematical programming