Definition:Dual Code

From ProofWiki
Jump to navigation Jump to search

Definition

Let $C$ be a binary linear code of length $n$.

The dual code to $C$ is the set of all binary strings $b_1 b_2 \cdots b_n$ such that:

$a_1 b_1 + a_2 b_2 + \cdots + a_n b_n = 0 \pmod 2$

for all codewords $a_1 a_2 \cdots a_n$ in $C$.


Also see

  • Results about dual codes can be found here.


Sources