- #1
chingkui
- 181
- 2
I am studying the performance statistic of some coding techniques on messages of 380 bits long. I studied it by generating bit sequences randomly and test the performance on each sample. But the sample space is so large (2^380) and practically I can only randomly test about 10^5-10^6 samples, how can I know if the statistic I get is accurate enough? Is there any mathematical theory that could be used to estimate how accurate it is?