Show simple item record

Which Boolean Functions Maximize Mutual Information on Noisy Inputs?

contributor authorCourtade, Thomas /A/.
contributor authorKumar, G. Ramesh
date accessioned2020-03-13T00:05:35Z
date available2020-03-13T00:05:35Z
date issued2014
identifier issn0018-9448
identifier other6822629.pdf
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/1134119?show=full
formatgeneral
languageEnglish
publisherIEEE
titleWhich Boolean Functions Maximize Mutual Information on Noisy Inputs?
typeJournal Paper
contenttypeMetadata Only
identifier padid8315388
subject keywordsBoolean functions
subject keywordsinformation theory
subject keywordsprobability
subject keywordsBoolean functions
subject keywordscrossover probability
subject keywordsdiscrete isoperimetric inequalities
subject keywordsindependent identically distributed Bernoulli
subject keywordsmaximum mutual information
subject keywordsmemoryless binary symmetric channel
subject keywordsnoisy inputs
subject keywordssimply stated conjecture
subject keywordsBoolean functions
subject keywordsContext
subject keywordsEntropy
subject keywordsMutual information
subject keywordsNoise measurement
subject keywordsRandom variables
subject keywordsTin
subject keywordsBoolean functions
subject keywordsextremal inequality
subject keywordsisoperimetric inequality
subject keywordsmutual information
identifier doi10.1109/TIT.2014.2326877
journal titleInformation Theory, IEEE Transactions on
journal volume60
journal issue8
filesize511657
citations0


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record