Skewb Ultimate: Difference between revisions
Undid revision 333965503 by 86.162.255.63 (talk) reverting intentional misspellings of links... |
en>069952497a removed Category:Rubik's Cube; added Category:Rubik's Cube permutations using HotCat |
||
| Line 1: | Line 1: | ||
{{expert-subject|Technology|date=February 2010}} | |||
In [[coding theory]], a '''parity-check matrix''' of a [[Linear block codes|linear block code]] '''C''' | |||
is a [[generator matrix]] of the [[dual code]]. As such, a codeword ''c'' is in '''C '''[[if and only if]] the matrix-vector product '''H'''''c''<sup>t</sup> = '''0'''. | |||
The rows of a parity check matrix are [[parity check]]s on the [[codewords]] of a code. That is, they show how linear combinations of certain digits of each codeword equal zero. For example, the parity check matrix | |||
<math>H = | |||
\left[ | |||
\begin{array}{cccc} | |||
0&0&1&1\\ | |||
1&1&0&0 | |||
\end{array} | |||
\right] | |||
</math> | |||
specifies that for each codeword, digits 1 and 2 should sum to zero (according to the second row) and digits 3 and 4 should sum to zero (according to the first row). | |||
==Creating a parity check matrix== | |||
The parity check matrix for a given code can be derived from its [[generator matrix]] (and vice-versa). If the generator matrix for an [''n'',''k'']-code is in standard form | |||
: <math>G = \begin{bmatrix} I_k | P \end{bmatrix}</math>, | |||
then the parity check matrix is given by | |||
: <math>H = \begin{bmatrix} -P^T | I_{n-k} \end{bmatrix}</math>, | |||
because | |||
: <math>G H^T = P-P = 0</math>. | |||
Negation is performed in the finite field '''F'''<sub>''q''</sub>. Note that if the [[Characteristic (algebra)|characteristic]] of the underlying field is 2 (i.e., 1 + 1 = 0 in that field), as in [[binary code]]s, then -''P'' = ''P'', so the negation is unnecessary. | |||
For example, if a binary code has the generator matrix | |||
: <math>G = | |||
\left[ | |||
\begin{array}{cc|ccc} | |||
1&0&1&0&1 \\ | |||
0&1&1&1&0 \\ | |||
\end{array} | |||
\right],</math> | |||
then its parity check matrix is | |||
: <math>H = | |||
\left[ | |||
\begin{array}{cc|ccc} | |||
1&1&1&0&0 \\ | |||
0&1&0&1&0 \\ | |||
1&0&0&0&1 \\ | |||
\end{array} | |||
\right].</math> | |||
For any (row) vector ''x'' of the ambient vector space, ''s'' = '''H'''''x''<sup>t</sup> is called the [[Syndrome decoding|syndrome]] of ''x''. The vector ''x'' is a codeword if and only if ''s'' = 0. | |||
==See also== | |||
*[[Hamming code]] | |||
==References== | |||
* {{cite book | last=Hill | first=Raymond | title=A first course in coding theory | publisher=[[Oxford University Press]] | series=Oxford Applied Mathematics and Computing Science Series | date=1986 | isbn=0-19-853803-0 | pages=69 }} | |||
* {{cite book | last = Pless | first = Vera | authorlink=Vera Pless | title = 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 | pages=8 }} | |||
* {{cite book | author=J.H. van Lint | title=Introduction to Coding Theory | edition=2nd ed | publisher=Springer-Verlag | series=[[Graduate Texts in Mathematics|GTM]] | volume=86 | date=1992 | isbn=3-540-54894-7 | pages=34}} | |||
[[Category:Coding theory]] | |||
{{signal-processing-stub}} | |||
{{linear-algebra-stub}} | |||
Latest revision as of 16:53, 2 June 2013
In coding theory, a parity-check matrix of a linear block code C is a generator matrix of the dual code. As such, a codeword c is in C if and only if the matrix-vector product Hct = 0.
The rows of a parity check matrix are parity checks on the codewords of a code. That is, they show how linear combinations of certain digits of each codeword equal zero. For example, the parity check matrix
specifies that for each codeword, digits 1 and 2 should sum to zero (according to the second row) and digits 3 and 4 should sum to zero (according to the first row).
Creating a parity check matrix
The parity check matrix for a given code can be derived from its generator matrix (and vice-versa). If the generator matrix for an [n,k]-code is in standard form
then the parity check matrix is given by
because
Negation is performed in the finite field Fq. Note that if the characteristic of the underlying field is 2 (i.e., 1 + 1 = 0 in that field), as in binary codes, then -P = P, so the negation is unnecessary.
For example, if a binary code has the generator matrix
then its parity check matrix is
For any (row) vector x of the ambient vector space, s = Hxt is called the syndrome of x. The vector x is a codeword if and only if s = 0.
See also
References
- 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
Template:Signal-processing-stub Template:Linear-algebra-stub