For a linear code , the dual code is the orthogonal complement
under the standard bilinear bilinear form. If has dimension , the dual code has dimension and , because this bilinear form is nondegenerate.
The independent rows of a parity-check matrix for form a basis of , so that matrix is a generator matrix for the dual code. If a check matrix has redundant rows, its rows still span the dual code but are not themselves a basis. For example, the dual code of the length- binary even-weight binary code is the repetition code spanned by the all-one word.
A linear code is self-dual when it equals its dual code under the standard dot product. For a length- code with a rank- generator matrix , this is equivalent to : orthogonality gives inclusion in the dual code, and equal dimensions give equality. Over , a generator matrix therefore generates a self-dual code exactly when .
For a binary self-dual code, every word satisfies . In characteristic two this is , so the all-ones word is orthogonal to every codeword and lies in the dual code, hence the code itself. The dual code dimension identity gives even length and half-length dimension.

Ancestors (6)

  1. Linear code
  2. Coding theory
  3. Algebra
  4. Area of mathematics
  5. Mathematics
  6. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.