DocumentCode
3275745
Title
Capacity of the binomial channel, or minimax redundancy for memoryless sources
Author
Komninakis, Christos ; Vandenberghe, Lieven ; Wesel, Richard D.
Author_Institution
Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA
fYear
2001
fDate
2001
Firstpage
127
Abstract
This paper computes the capacity of the binomial channel of order n, for any finite n via convex optimization and duality. The binomial channel capacity is also the minimax coding redundancy for a class of memoryless sources. The exact capacity for finite n computed here is compared to the asymptotic expression found by Xie and Barron (see IEEE Trans. Inform. Theory, vol.43, no.2, p.646-57 (March 1997))
Keywords
binomial distribution; channel capacity; memoryless systems; minimax techniques; redundancy; source coding; binomial channel; channel capacity; convex optimization; duality; memoryless sources; minimax coding redundancy; Channel capacity; Distributed computing; Ellipsoids; Entropy; Lagrangian functions; Minimax techniques; Random variables;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location
Washington, DC
Print_ISBN
0-7803-7123-2
Type
conf
DOI
10.1109/ISIT.2001.935990
Filename
935990
Link To Document