Hi,(adsbygoogle = window.adsbygoogle || []).push({});

I am trying to write a function which would take two arguments:

-> number of bits (which are a binary 0 or 1 value) N

-> and acceptable number of mismatching bits M

The function would statistically determine the probability of having M or less mismatching bits when randomly generating two N long bit arrays and comparing them. Difference between 1001 and 1011 would be 1 for example as only the third bit differs. My testing indicates a bell curve is formed around N/2, but I've not done maths for years, it's hard for me to figure the formula out...

Thanks a lot

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# B Not sure what this problem would be called...

Tags:

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads - sure problem called | Date |
---|---|

Almost sure invariance principle | Apr 13, 2015 |

Almost sure convergance of sum of rv | Aug 14, 2012 |

Almost Surely vs Surely | Apr 26, 2012 |

Problem about almost sure and L1 convergence | Nov 11, 2009 |

I'm not sure I understand the problem, can someone clarify? | Oct 27, 2006 |

**Physics Forums - The Fusion of Science and Community**