<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.cern.ch/index.php?action=history&amp;feed=atom&amp;title=Cyclic_redundancy_check</id>
	<title>Cyclic redundancy check - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.cern.ch/index.php?action=history&amp;feed=atom&amp;title=Cyclic_redundancy_check"/>
	<link rel="alternate" type="text/html" href="https://wiki.cern.ch/index.php?title=Cyclic_redundancy_check&amp;action=history"/>
	<updated>2026-04-11T02:40:48Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.44.0</generator>
	<entry>
		<id>https://wiki.cern.ch/index.php?title=Cyclic_redundancy_check&amp;diff=11571&amp;oldid=prev</id>
		<title>Vigen: Created page with &quot;A &#039;&#039;&#039;cyclic redundancy check&#039;&#039;&#039; (&#039;&#039;&#039;CRC&#039;&#039;&#039;) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to digital data. Blocks of data entering these systems get a short &#039;&#039;check value&#039;&#039; attached, based on the remainder of a polynomial division of their contents. On retrieval, the calculation is repeated and, in the event the check values do not match, corrective action can be taken against data corruption. CRCs can be us...&quot;</title>
		<link rel="alternate" type="text/html" href="https://wiki.cern.ch/index.php?title=Cyclic_redundancy_check&amp;diff=11571&amp;oldid=prev"/>
		<updated>2026-04-10T08:15:15Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;A &amp;#039;&amp;#039;&amp;#039;cyclic redundancy check&amp;#039;&amp;#039;&amp;#039; (&amp;#039;&amp;#039;&amp;#039;CRC&amp;#039;&amp;#039;&amp;#039;) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to digital data. Blocks of data entering these systems get a short &amp;#039;&amp;#039;check value&amp;#039;&amp;#039; attached, based on the remainder of a polynomial division of their contents. On retrieval, the calculation is repeated and, in the event the check values do not match, corrective action can be taken against data corruption. CRCs can be us...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;A &amp;#039;&amp;#039;&amp;#039;cyclic redundancy check&amp;#039;&amp;#039;&amp;#039; (&amp;#039;&amp;#039;&amp;#039;CRC&amp;#039;&amp;#039;&amp;#039;) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to digital data. Blocks of data entering these systems get a short &amp;#039;&amp;#039;check value&amp;#039;&amp;#039; attached, based on the remainder of a polynomial division of their contents. On retrieval, the calculation is repeated and, in the event the check values do not match, corrective action can be taken against data corruption. CRCs can be used for error correction (see bitfilters).&lt;br /&gt;
&lt;br /&gt;
CRCs are so called because the &amp;#039;&amp;#039;check&amp;#039;&amp;#039; (data verification) value is a &amp;#039;&amp;#039;redundancy&amp;#039;&amp;#039; (it expands the message without adding information) and the algorithm is based on &amp;#039;&amp;#039;cyclic&amp;#039;&amp;#039; codes. CRCs are popular because they are simple to implement in binary hardware, easy to analyze mathematically, and particularly good at detecting common errors caused by noise in transmission channels. Because the check value has a fixed length, the function that generates it is occasionally used as a hash function.&lt;br /&gt;
&lt;br /&gt;
For more information, see [[wikipedia:Cyclic redundancy check|Wikipedia]].&lt;br /&gt;
[[Category:Pages linking to Wikipedia]]&lt;/div&gt;</summary>
		<author><name>Vigen</name></author>
	</entry>
</feed>