From owner-freebsd-hackers  Thu Jan 23 05:20:45 1997
Return-Path: <owner-hackers>
Received: (from root@localhost)
          by freefall.freebsd.org (8.8.5/8.8.5) id FAA18642
          for hackers-outgoing; Thu, 23 Jan 1997 05:20:45 -0800 (PST)
Received: from terra.Sarnoff.COM (terra.sarnoff.com [130.33.11.203])
          by freefall.freebsd.org (8.8.5/8.8.5) with SMTP id FAA18637
          for <hackers@freebsd.org>; Thu, 23 Jan 1997 05:20:43 -0800 (PST)
Received: (from rminnich@localhost) by terra.Sarnoff.COM (8.6.12/8.6.12) id IAA28217; Thu, 23 Jan 1997 08:19:37 -0500
Date: Thu, 23 Jan 1997 08:19:36 -0500 (EST)
From: "Ron G. Minnich" <rminnich@Sarnoff.COM>
X-Sender: rminnich@terra
To: Michael Smith <msmith@atrad.adelaide.edu.au>
cc: hackers@freebsd.org
Subject: Re: CRC-16 algorithms?
In-Reply-To: <199701231259.XAA21523@genesis.atrad.adelaide.edu.au>
Message-ID: <Pine.SUN.3.91.970123081644.28093E-100000@terra>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-hackers@freebsd.org
X-Loop: FreeBSD.org
Precedence: bulk

If anyone out there can get me the coefficients, I can deliver a program
that will do the crc-16. But working out the polynomial minus the
coefficients, well, I'll go with Barbie on this one: "Math is hard, let's
go shopping" 

Not impossible: assuming this crc is accumulated 16 bits at a time, there 
are only 2^16 possible polynomials, after all ... at least it's not some 
crc-32!

michael let me know if you don't get anywhere.

ron

Ron Minnich                |"Failure is not an option" -- Gene Kranz
rminnich@sarnoff.com       | -- except, of course, on Microsoft products
(609)-734-3120             |
ftp://ftp.sarnoff.com/pub/mnfs/www/docs/cluster.html