Parity Check Matrix
Given a linear code C of length n and dimension k over the field F, a parity check matrix H of C is a n×(n-k) matrix whose rows generate the orthogonal complement of C, i.e., an element w of F^n is a codeword of C iff wH=0. The rows of H generate the null space of the generator matrix G.
See also
Coding Theory, Error-Correcting Code, Generator Matrix, Linear CodeThis entry contributed by David Terr
Explore with Wolfram|Alpha
WolframAlpha
More things to try:
References
Roman, S. Coding and Information Theory. New York: Springer-Verlag, 1992.van Lint, J. H. An Introduction to Coding Theory, 2nd ed. New York: Springer-Verlag, 1992.Referenced on Wolfram|Alpha
Parity Check MatrixCite this as:
Terr, David. "Parity Check Matrix." From MathWorld--A Wolfram Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/ParityCheckMatrix.html