Article View: comp.theory
Article #1730High-order Primitive Polynomials for CRC's
From: george
Date: Wed, 16 Dec 1992 13:54
Date: Wed, 16 Dec 1992 13:54
10 lines
783 bytes
783 bytes
Does anyone have a reference or references for primitive polynomials of order >40. Am needing very reliable burst-error detection. Also, references on burst-error detection techniques would be useful. Esp. interested in evaluating how effective a prim. polynomial of order N is for burst-error detection. Many thanks - George Bolt Email: george@psychmips.york.ac.uk (Try george@minster.york.ac.uk if any problems)
Technical Details
Message-ID:
<724514081.15434@minster.york.ac.uk>Path:
arc1-ca.pugleaf.net!sparky!uunet!pipex!doc.ic.ac.uk!uknet!yorkohm!minster!georgeShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!pipex!doc.ic.ac.uk!uknet!yorkohm!minster!george From: george@minster.york.ac.uk Newsgroups: comp.theory,sci.crypt Subject: High-order Primitive Polynomials for CRC's Message-ID: <724514081.15434@minster.york.ac.uk> Date: 16 Dec 92 13:54:41 GMT Organization: Department of Computer Science, University of York, England Lines: 10