How much information can one bit of memory retain about a Bernoulli sequence?

DOI10.1109/18.104320zbMath0741.94002OpenAlexW2118501246MaRDI QIDQ3987454

Santosh S. Venkatesh, J. N. Franklin

Publication date: 28 June 1992

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20190304-142847195

zbMATH Keywords

capacityBoolean functionsneuronrandom binary sequencesymmetric Bernoulli trialsmaximin covariancemaximin mutual informationmaximum average covarianceminimum amount of information

Mathematics Subject Classification ID

Information theory (general) (94A15)

Related Items (1)

Directed drift: A new linear threshold algorithm for learning binary weights on-line

This page was built for publication: How much information can one bit of memory retain about a Bernoulli sequence?