Dual code: Difference between revisions

Content deleted Content added
Link broken, use archived copy instead
m clean up spacing around commas and other punctuation fixes, replaced: ,N → , N, ,c → , c
 
(5 intermediate revisions by 4 users not shown)
Line 13:
:<math>\langle x, c \rangle = \sum_{i=1}^n x_i c_i </math>
 
is a scalar product. In [[linear algebra]] terms, the dual code is the [[Annihilator (ring theory)|annihilator]] of ''C'' with respect to the [[bilinear form]] <,math>\langle\cdot\rangle</math>. The [[Dimension (vector space)|dimension]] of ''C'' and its dual always add up to the length ''n'':
 
:<math>\dim C + \dim C^\perp = n.</math>
 
A [[generator matrix]] for the dual code is athe [[parity-check matrix]] for the original code and vice versa. The dual of the dual code is always the original code.
 
==Self-dual codes==
A '''self-dual code''' is one which is its own dual. This implies that ''n'' is even and dim ''C'' = ''n''/2. If a self-dual code is such that each codeword's weight is a multiple of some constant <math>c > 1</math>, then it is of one of the following four types:<ref>{{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 }}</ref>
*'''Type I''' 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]]).
*'''Type II''' codes are binary self-dual codes which are doubly even.
Line 33:
{{reflist}}
{{refbegin}}
* {{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] }}
* {{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 & Sons]]|series = Wiley-Interscience Series in Discrete Mathematics | date = 1982| isbn = 0-471-08684-3 | page=8 }}
* {{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 }}
{{refend}}