Hi all,

I need to solve a mathematical problem for an Engineering purpose.

Imagine I have a string of bits of length N.

And I have a bit sequence pattern of length M.

I would like to knowwhat is the expected number of pattern matches in the string. You can assume 0 and 1's are equally likely and there bits are totally uncorrelated.

An approximation would also help.

Thanks!