Date: Thu, 23 Jan 1997 08:19:36 -0500 (EST) From: "Ron G. Minnich" <rminnich@Sarnoff.COM> To: Michael Smith <msmith@atrad.adelaide.edu.au> Cc: hackers@freebsd.org Subject: Re: CRC-16 algorithms? Message-ID: <Pine.SUN.3.91.970123081644.28093E-100000@terra> In-Reply-To: <199701231259.XAA21523@genesis.atrad.adelaide.edu.au>
next in thread | previous in thread | raw e-mail | index | archive | help
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
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?Pine.SUN.3.91.970123081644.28093E-100000>