[no subject]

You've got a huge job ahead of you.  Think about it.  You'll have to 
take a chunk of data, say N bits and compare it to bits 1-N in the file. 
  Next, you'll have to compare it to 2-(N+1)....

I think you have more analysis work then code to write.

There's probably a good statistical problem here where you take X bits 
of the N and see if that is found in the file, if so, then you take 2X 
bits of the N and so on...

-- 
Until later, Geoffrey


</pre>
<!--X-Body-of-Message-End-->
<!--X-MsgBody-End-->
<!--X-Follow-Ups-->
<hr>
<!--X-Follow-Ups-End-->
<!--X-References-->
<ul><li><strong>References</strong>:
<ul>
<li><strong><a name="00231" href="msg00231.html">[ale] Binary Matching</a></strong>
<ul><li><em>From:</em> atlantalinuxenthusiast at gmail.com (Mister Anonymous)</li></ul></li>
<li><strong><a name="00233" href="msg00233.html">[ale] Binary Matching</a></strong>
<ul><li><em>From:</em> esoteric at 3times25.net (Geoffrey)</li></ul></li>
<li><strong><a name="00239" href="msg00239.html">[ale] Binary Matching</a></strong>
<ul><li><em>From:</em> atlantalinuxenthusiast at gmail.com (Mister Anonymous)</li></ul></li>
</ul></li></ul>
<!--X-References-End-->
<!--X-BotPNI-->
<ul>
<li>Prev by Date:
<strong><a href="msg00241.html">[ale] MP3C</a></strong>
</li>
<li>Next by Date:
<strong><a href="msg00243.html">[ale] CUPS &amp; gimp-print</a></strong>
</li>
<li>Previous by thread:
<strong><a href="msg00239.html">[ale] Binary Matching</a></strong>
</li>
<li>Next by thread:
<strong><a href="msg00244.html">[ale] Binary Matching</a></strong>
</li>
<li>Index(es):
<ul>
<li><a href="maillist.html#00242"><strong>Date</strong></a></li>
<li><a href="threads.html#00242"><strong>Thread</strong></a></li>
</ul>
</li>
</ul>

<!--X-BotPNI-End-->
<!--X-User-Footer-->
<!--X-User-Footer-End-->
</body>
</html>