Cyclic redundancy check - Revision history

Jnc: +cat

2018-12-16T16:48:26Z

+cat

Jnc: Proper cat

2018-10-18T14:44:01Z

Proper cat

Jnc: Typo,slight expansion

2018-06-14T12:22:51Z

Typo,slight expansion

Jnc: A start

2018-03-28T20:45:59Z

A start

New page

A '''cyclic redundancy check''' (usually abbreviated to '''CRC''') is a mechanism for detecting (and sometimes repairing) errors in data. It is used to make sure that data stored in [[main memory]], or on [[secondary storage]], is not corrupted; and for data which is transmitted over a network (e.g. an [[Ethernet]]), to make sure that the data is not damaged in transmission. It is a more sophisticated modern successor to [[parity]].

It consists of the output of a polynomial function applied to the values in a block of data, and then attached to the data. Depending on the particular algorithm, and the size of the stored checksum, it may be possible to repair some errors. A typical CRC might be able to repair 1-[[bit]] errors, and detecy any 2-bit error.

{{stub}}

← Older revision		Revision as of 16:48, 16 December 2018
Line 4:		Line 4:

	{{semi-stub}}		{{semi-stub}}
		+
		+	[[Category: Theory]]

← Older revision		Revision as of 14:44, 18 October 2018
Line 3:		Line 3:
	It consists of the output of a polynomial function applied to the values in a block of data, and then attached to the data. Depending on the particular algorithm, and the sizes of the data item being protected, and the stored checksum, it may be possible to repair some errors. A typical CRC on memory [[word]]s might be able to repair 1-[[bit]] errors, and detect any 2-bit error.		It consists of the output of a polynomial function applied to the values in a block of data, and then attached to the data. Depending on the particular algorithm, and the sizes of the data item being protected, and the stored checksum, it may be possible to repair some errors. A typical CRC on memory [[word]]s might be able to repair 1-[[bit]] errors, and detect any 2-bit error.

−	{{stub}}	+	{{semi-stub}}

@@ Line 1: / Line 1: @@
 A '''cyclic redundancy check''' (usually abbreviated to '''CRC''') is a mechanism for detecting (and sometimes repairing) errors in data. It is used to make sure that data stored in [[main memory]], or on [[secondary storage]], is not corrupted; and for data which is transmitted over a network (e.g. an [[Ethernet]]), to make sure that the data is not damaged in transmission. It is a more sophisticated modern successor to [[parity]].
-It consists of the output of a polynomial function applied to the values in a block of data, and then attached to the data. Depending on the particular algorithm, and the size of the stored checksum, it may be possible to repair some errors. A typical CRC might be able to repair 1-[[bit]] errors, and detecy any 2-bit error.
+It consists of the output of a polynomial function applied to the values in a block of data, and then attached to the data. Depending on the particular algorithm, and the sizes of the data item being protected, and the stored checksum, it may be possible to repair some errors. A typical CRC on memory [[word]]s might be able to repair 1-[[bit]] errors, and detect any 2-bit error.
 {{stub}}