DocumentCode :
2364753
Title :
Approximations for the capacity of binary input discrete memoryless channels
Author :
Moskowitz, Ira S.
Author_Institution :
Center for High Assurance Comput., Naval Res. Lab., Washington, DC, USA
fYear :
2010
fDate :
17-19 March 2010
Firstpage :
1
Lastpage :
5
Abstract :
In this paper, we present our results on lower and upper bounds for the capacity of binary input discrete memoryless channels. These bounds also serve as good approximations for the capacity of these channels. Our results generalize previous analysis of bounds for binary input, binary output discrete memoryless channels and also constitute an extension of the new field of algebraic information theory.
Keywords :
algebra; information theory; memoryless systems; algebraic information theory; binary input discrete memoryless channels; binary output discrete memoryless channels; discrete memoryless channel capacity; Channel capacity; Entropy; Information analysis; Information theory; Laboratories; Memoryless systems; Monte Carlo methods; Mutual information; Random variables; Upper bound; Capacity; Information theory; Pinsker´s inequality;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Sciences and Systems (CISS), 2010 44th Annual Conference on
Conference_Location :
Princeton, NJ
Print_ISBN :
978-1-4244-7416-5
Electronic_ISBN :
978-1-4244-7417-2
Type :
conf
DOI :
10.1109/CISS.2010.5464826
Filename :
5464826
Link To Document :
بازگشت