Given G, extract P parity check matrix. Assume row-operations in GF(2). G is of size KxN, when decomposed through row-operations into a I of size KxK identity matrix, and a parity check matrix P of size Kx(N-K).
Most arbitrary code with a given generator matrix G, can be converted into its systematic form using this function.
This function returns 2 values, first is default being Gx the systematic version of the G matrix, and then the parity check matrix P.
g = [1 1 1 1; 1 1 0 1; 1 0 0 1];
[gx, p] = systematize (g);
⇒ gx = [1 0 0 1; 0 1 0 0; 0 0 1 0];
⇒ p = [1 0 0];
See also: bchpoly, biterr.
Package: communications