<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Dual_code</id>
	<title>Dual code - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Dual_code"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Dual_code&amp;action=history"/>
	<updated>2026-05-05T02:39:00Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=Dual_code&amp;diff=1363808&amp;oldid=prev</id>
		<title>imported&gt;BD2412: clean up spacing around commas and other punctuation fixes, replaced: ,N → , N, ,c → , c</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Dual_code&amp;diff=1363808&amp;oldid=prev"/>
		<updated>2024-03-10T03:56:36Z</updated>

		<summary type="html">&lt;p&gt;clean up spacing around commas and other punctuation fixes, replaced: ,N → , N, ,c → , c&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{for|players of both rugby codes|List of dual-code rugby internationals}}&lt;br /&gt;
&lt;br /&gt;
In [[coding theory]], the &amp;#039;&amp;#039;&amp;#039;dual code&amp;#039;&amp;#039;&amp;#039; of a [[linear code]]&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;C\subset\mathbb{F}_q^n&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
is the linear code defined by&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;C^\perp = \{x \in \mathbb{F}_q^n \mid \langle x,c\rangle = 0\;\forall c \in C \} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\langle x, c \rangle = \sum_{i=1}^n x_i c_i &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
is a scalar product.  In [[linear algebra]] terms, the dual code is the [[Annihilator (ring theory)|annihilator]] of &amp;#039;&amp;#039;C&amp;#039;&amp;#039; with respect to the [[bilinear form]] &amp;lt;math&amp;gt;\langle\cdot\rangle&amp;lt;/math&amp;gt;. The [[Dimension (vector space)|dimension]] of &amp;#039;&amp;#039;C&amp;#039;&amp;#039; and its dual always add up to the length &amp;#039;&amp;#039;n&amp;#039;&amp;#039;:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\dim C + \dim C^\perp = n.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A [[generator matrix]] for the dual code is the [[parity-check matrix]] for the original code and vice versa.  The dual of the dual code is always the original code.&lt;br /&gt;
&lt;br /&gt;
==Self-dual codes==&lt;br /&gt;
A &amp;#039;&amp;#039;&amp;#039;self-dual code&amp;#039;&amp;#039;&amp;#039; is one which is its own dual. This implies that &amp;#039;&amp;#039;n&amp;#039;&amp;#039; is even and dim &amp;#039;&amp;#039;C&amp;#039;&amp;#039; = &amp;#039;&amp;#039;n&amp;#039;&amp;#039;/2. If a self-dual code is such that each codeword&amp;#039;s weight is a multiple of some constant &amp;lt;math&amp;gt;c &amp;gt; 1&amp;lt;/math&amp;gt;, then it is of one of the following four types:&amp;lt;ref&amp;gt;{{cite book | last=Conway | first=J.H. | authorlink=John Horton Conway | author2=Sloane, N.J.A. | authorlink2=Neil Sloane | title=Sphere packings, lattices and groups | series=Grundlehren der mathematischen Wissenschaften | volume=290 | publisher=[[Springer-Verlag]] | date=1988 | isbn=0-387-96617-X | page=[https://archive.org/details/spherepackingsla0000conw/page/77 77] | url=https://archive.org/details/spherepackingsla0000conw/page/77 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
*&amp;#039;&amp;#039;&amp;#039;Type I&amp;#039;&amp;#039;&amp;#039; codes are binary self-dual codes which are not [[doubly even code|doubly even]]. Type I codes are always [[even code|even]] (every codeword has even [[Hamming weight]]).&lt;br /&gt;
*&amp;#039;&amp;#039;&amp;#039;Type II&amp;#039;&amp;#039;&amp;#039; codes are binary self-dual codes which are doubly even.&lt;br /&gt;
*&amp;#039;&amp;#039;&amp;#039;Type III&amp;#039;&amp;#039;&amp;#039; codes are ternary self-dual codes. Every codeword in a Type III code has Hamming weight divisible by 3.&lt;br /&gt;
*&amp;#039;&amp;#039;&amp;#039;Type IV&amp;#039;&amp;#039;&amp;#039; codes are self-dual codes over &amp;#039;&amp;#039;&amp;#039;F&amp;#039;&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;4&amp;lt;/sub&amp;gt;. These are again even.&lt;br /&gt;
&lt;br /&gt;
Codes of types I, II, III, or IV exist only if the length &amp;#039;&amp;#039;n&amp;#039;&amp;#039; is a multiple of 2, 8, 4, or 2 respectively.&lt;br /&gt;
&lt;br /&gt;
If a self-dual code has a generator matrix of the form &amp;lt;math&amp;gt;G=[I_k|A]&amp;lt;/math&amp;gt;, then the dual code &amp;lt;math&amp;gt;C^\perp&amp;lt;/math&amp;gt; has [[generator matrix]] &amp;lt;math&amp;gt;[-\bar{A}^T|I_k]&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;I_k&amp;lt;/math&amp;gt; is the &amp;lt;math&amp;gt;(n/2)\times (n/2)&amp;lt;/math&amp;gt; identity matrix and &amp;lt;math&amp;gt;\bar{a}=a^q\in\mathbb{F}_q&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
{{refbegin}}&lt;br /&gt;
* {{cite book | last=Hill | first=Raymond | title=A first course in coding theory | url=https://archive.org/details/firstcourseincod0000hill | url-access=registration | publisher=[[Oxford University Press]] | series=Oxford Applied Mathematics and Computing Science Series | date=1986 | isbn=0-19-853803-0 | page=[https://archive.org/details/firstcourseincod0000hill/page/67 67] }}&lt;br /&gt;
* {{cite book | last = Pless | first = Vera | authorlink=Vera Pless | title = Introduction to the theory of error-correcting codes|title-link= Introduction to the Theory of Error-Correcting Codes | publisher = [[John Wiley &amp;amp; Sons]]|series = Wiley-Interscience Series in Discrete Mathematics | date = 1982| isbn = 0-471-08684-3 | page=8 }}&lt;br /&gt;
* {{cite book | author=J.H. van Lint | title=Introduction to Coding Theory | edition=2nd | publisher=Springer-Verlag | series=[[Graduate Texts in Mathematics|GTM]] | volume=86 | date=1992 | isbn=3-540-54894-7 | page=[https://archive.org/details/introductiontoco0000lint/page/34 34] | url=https://archive.org/details/introductiontoco0000lint/page/34 }}&lt;br /&gt;
{{refend}}&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [https://web.archive.org/web/20170516194659/https://www.maths.manchester.ac.uk/~pas/code/notes/part9.pdf MATH32031: Coding Theory - Dual Code] - pdf with some examples and explanations&lt;br /&gt;
&lt;br /&gt;
[[Category:Coding theory]]&lt;/div&gt;</summary>
		<author><name>imported&gt;BD2412</name></author>
	</entry>
</feed>