12 bit checksum and CRC for KERMIT

Thread View: comp.protocols.misc

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by David Goodenough Wed, 07 Sep 1988 21:54

#839

Author: David Goodenough
Date: Wed, 07 Sep 1988 21:54

18 lines
1206 bytes

I was reading back over an early issue of BYTE that talked about the
KERMIT protocol, and it mentioned that KERMIT can use a larger checksum
(12 or 14 bits I think), as well as a CRC for error checking. Does
anyone have any information on exactly how this is done: i.e. once I
have my big checksum, how do I send it, and how do I send the CRC, and
what polynomial is used. I gather that selection of CRC / checksum is
determined by a byte in the parameter packet exchange: and both ends have
to agree or normal 6 bit checksumming is used. Details of this would also
be welcome.

E-mail responses, as I don't usually read this newsgroup.

		Thanks in advance,
-- 
	dg@lakart.UUCP - David Goodenough		+---+
							| +-+-+
	....... !harvard!cca!lakart!dg			+-+-+ |
						  	  +---+

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads