[sci.math] A question

richard@gryphon.COM (Richard Sexton) (02/08/89)

Does anybody now off hand, what the error rate would be for
a system that used hamming code with 8 bits of redundency
per 7 bits of data and had a 12 bit CRC ?

Thanks
-- 
                      ``Kern letters with a hacksaw''                
decwrl!gryphon!richard        killer!gryphon!richard       elroy!gryphon!richard

richard@gryphon.COM (Richard Sexton) (05/09/89)

given two objects with m and n elements:
these can be intersected in n*m amount of time.
if one of them is represented by a BSP tree than the
intersection takes n*log(m) time....

if both are represented by BSP trees...is the time
log(n)*log(m)... and exactly how is this intersection 
accomplished?

please send email
-- 
``But if she wants it (particularly if she wants it bad), I am going to have
a hard time saying "no".'' - Ted Kaldis
richard@gryphon.COM  decwrl!gryphon!richard   gryphon!richard@elroy.jpl.NASA.GOV