home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #30 / NN_1992_30.iso / spool / comp / theory / 2719 < prev    next >
Encoding:
Internet Message Format  |  1992-12-12  |  809 b 
  1. Xref: sparky comp.theory:2719 sci.crypt:5771
  2. Path: sparky!uunet!pipex!doc.ic.ac.uk!uknet!yorkohm!minster!george
  3. From: george@minster.york.ac.uk
  4. Newsgroups: comp.theory,sci.crypt
  5. Subject: High-order Primitive Polynomials for CRC's
  6. Message-ID: <724514081.15434@minster.york.ac.uk>
  7. Date: 16 Dec 92 13:54:41 GMT
  8. Organization: Department of Computer Science, University of York, England
  9. Lines: 10
  10.  
  11. Does anyone have a reference or references for primitive polynomials
  12. of order >40. Am needing very reliable burst-error detection. Also,
  13. references on burst-error detection techniques would be useful. Esp.
  14. interested in evaluating how effective a prim. polynomial of order N
  15. is for burst-error detection.
  16.  
  17. Many thanks - George Bolt
  18.  
  19. Email: george@psychmips.york.ac.uk
  20. (Try george@minster.york.ac.uk if any problems)
  21.