<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=Preparata_code</id>
	<title>Preparata code - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=Preparata_code"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Preparata_code&amp;action=history"/>
	<updated>2026-05-15T19:23:01Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.32.0</generator>
	<entry>
		<id>http://en.zaoniao.it/index.php?title=Preparata_code&amp;diff=6379&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;In coding theory, the '''Preparata codes''' form a class of non-linear double-error-correcting codes. They are named after Franco P. P...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Preparata_code&amp;diff=6379&amp;oldid=prev"/>
		<updated>2019-06-28T09:50:21Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;In &lt;a href=&quot;/Coding_theory&quot; title=&quot;Coding theory&quot;&gt;coding theory&lt;/a&gt;, the &amp;#039;&amp;#039;&amp;#039;Preparata codes&amp;#039;&amp;#039;&amp;#039; form a class of non-linear double-&lt;a href=&quot;/Error_detection_and_correction&quot; title=&quot;Error detection and correction&quot;&gt;error-correcting codes&lt;/a&gt;. They are named after Franco P. P...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In [[coding theory]], the '''Preparata codes''' form a class of non-linear double-[[Error detection and correction|error-correcting codes]]. They are named after [[Franco P. Preparata]] who first described them in 1968.&lt;br /&gt;
&lt;br /&gt;
Although non-linear over [[GF(2)]] the Preparata codes are linear over '''Z'''&amp;lt;sub&amp;gt;4&amp;lt;/sub&amp;gt; with the [[Lee distance]].&lt;br /&gt;
&lt;br /&gt;
==Construction==&lt;br /&gt;
Let ''m'' be an odd number, and &amp;lt;math&amp;gt;n = 2^m-1&amp;lt;/math&amp;gt;. We first describe the '''extended Preparata code''' of length &amp;lt;math&amp;gt;2n+2 = 2^{m+1}&amp;lt;/math&amp;gt;: the Preparata code is then derived by deleting one position. The words of the extended code are regarded as pairs (''X'',&amp;amp;nbsp;''Y'') of 2&amp;lt;sup&amp;gt;''m''&amp;lt;/sup&amp;gt;-tuples, each corresponding to subsets of the [[finite field]] GF(2&amp;lt;sup&amp;gt;''m''&amp;lt;/sup&amp;gt;) in some fixed way.&lt;br /&gt;
&lt;br /&gt;
The extended code contains the words (''X'',&amp;amp;nbsp;''Y'') satisfying three conditions&lt;br /&gt;
&lt;br /&gt;
# ''X'', ''Y'' each have even weight;&lt;br /&gt;
# &amp;lt;math&amp;gt;\sum_{x \in X} x = \sum_{y \in Y} y;&amp;lt;/math&amp;gt;&lt;br /&gt;
# &amp;lt;math&amp;gt;\sum_{x \in X} x^3 + \left(\sum_{x \in X} x\right)^3 = \sum_{y \in Y} y^3.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The Preparata code is obtained by deleting the position in ''X'' corresponding to 0 in GF(2&amp;lt;sup&amp;gt;''m''&amp;lt;/sup&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
==Properties==&lt;br /&gt;
The Preparata code is of length 2&amp;lt;sup&amp;gt;''m''+1&amp;lt;/sup&amp;gt;&amp;amp;nbsp;&amp;amp;minus;&amp;amp;nbsp;1, size 2&amp;lt;sup&amp;gt;''k''&amp;lt;/sup&amp;gt; where ''k'' = 2&amp;lt;sup&amp;gt;''m''&amp;amp;nbsp;+&amp;amp;nbsp;1&amp;lt;/sup&amp;gt;&amp;amp;nbsp;&amp;amp;minus;&amp;amp;nbsp;2''m''&amp;amp;nbsp;&amp;amp;minus;&amp;amp;nbsp;2, and minimum distance 5.&lt;br /&gt;
&lt;br /&gt;
When ''m'' = 3, the Preparata code of length 15 is also called the '''Nordstrom–Robinson code'''.&lt;br /&gt;
&lt;br /&gt;
==Source==&lt;br /&gt;
[http://wikipedia.org/ http://wikipedia.org/]&lt;br /&gt;
&lt;br /&gt;
[[Category:Error-correcting codes]]&lt;br /&gt;
==See Also on BitcoinWiki==&lt;br /&gt;
* [[PEP Network]]&lt;br /&gt;
* [[Faireum]]&lt;br /&gt;
* [[ARAW]]&lt;br /&gt;
* [[CZero]]&lt;br /&gt;
* [[SpringRole]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>