Article View: comp.protocols.ibm
Article #558CRC-16 algorithm wanted
From: Paolo Crini
Date: Fri, 10 Aug 1990 13:38
Date: Fri, 10 Aug 1990 13:38
18 lines
1141 bytes
1141 bytes
Hi, does anyone have any high-level language source for a routine calculating the Cyclic Redundancy Check (16th degree), using the BSC-3 like version of polynomial, i.e. NOT the CCITT one? I've got an old C language source, but it produces funny CRCs. Any source/help/pointer/idea would be extremely appreciated. Please e-mail, since I don't read these newsgroups too often. Thanks in advance, Paolo. -- * Paolo Crini | E-mail: paolo@sixcom.UUCP paolo@sixcom.it * | Sixcom S.p.A. | ...!Italy.EU.net!sixcom!paolo | * Milano-Italy | Voice: +39 (2) 3192.403, Fax: +39 (2) 33603112 *
Technical Details
Message-ID:
<1990Aug10.133824.24571@sixcom.sixcom.it>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!i2unix!sixcom!paoloShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!i2unix!sixcom!paolo From: paolo@sixcom.sixcom.it (Paolo Crini) Newsgroups: comp.protocols.ibm,comp.protocols.iso,comp.protocols.misc,comp.sources.wanted Subject: CRC-16 algorithm wanted Keywords: BSC3 CRC16 Message-ID: <1990Aug10.133824.24571@sixcom.sixcom.it> Date: 10 Aug 90 13:38:24 GMT Reply-To: paolo@sixcom.UUCP (Paolo Crini) Followup-To: poster Organization: Sixcom S.p.A., Milan - Italy Lines: 18