Chronology | Current Month | Current Thread | Current Date |
[Year List] [Month List (current year)] | [Date Index] [Thread Index] | [Thread Prev] [Thread Next] | [Date Prev] [Date Next] |
1) S/N = (log_2(3) - 2/3) bits = 0.918295834 bitsI looked at the entry for Binary Entropy in Wikipedia, here:
where N = # members in the ensemble
2) S/N = (P_A*log_2(1/P_A) + P_B*log_2(1/P_B)) bits
Substitution of P_A = 1/3 & P_B = 2/3 into the above formula
yields the result 1) above.
Which are the "Lots of 'authoritative' references will lead you
to the wrong answer"? Maybe I'm missing something, but I don't
see what is supposed to be so puzzling here. It seems pretty
straightforward to me with nothing subtle or tricky in the problem.
David Bowman