From owner-freebsd-hackers  Thu Jan 23 07:02:46 1997
Return-Path: <owner-hackers>
Received: (from root@localhost)
          by freefall.freebsd.org (8.8.5/8.8.5) id HAA22661
          for hackers-outgoing; Thu, 23 Jan 1997 07:02:46 -0800 (PST)
Received: from chai.plexuscom.com (chai.plexuscom.com [207.87.46.100])
          by freefall.freebsd.org (8.8.5/8.8.5) with ESMTP id HAA22651
          for <hackers@freebsd.org>; Thu, 23 Jan 1997 07:02:42 -0800 (PST)
Received: from chai.plexuscom.com (localhost [127.0.0.1]) by chai.plexuscom.com (8.8.4/8.6.12) with ESMTP id KAA15500; Thu, 23 Jan 1997 10:01:13 -0500 (EST)
Message-Id: <199701231501.KAA15500@chai.plexuscom.com>
To: Michael Smith <msmith@atrad.adelaide.edu.au>
Cc: hackers@freebsd.org
Subject: Re: CRC-16 algorithms? 
In-reply-to: Your message of "Thu, 23 Jan 1997 23:29:27 +1030."
             <199701231259.XAA21523@genesis.atrad.adelaide.edu.au> 
Date: Thu, 23 Jan 1997 10:01:13 -0500
From: Bakul Shah <bakul@torrentnet.com>
Sender: owner-hackers@freebsd.org
X-Loop: FreeBSD.org
Precedence: bulk

> I'm looking for any implementations of various CRC-16 polynomials; I'm
> trying to compute a checksum for a parameter save area for a
> peripheral, which is documented as "CRC-16", but no details of the
> polynomial are given. 8(

X^16 + X^15 + X^2 + 1 is what is most commonly referred to as the
"CRC-16" polynomial.  Another such polynomial is x^16+x^12+x^5+1.