Category:Definitions/Dual Codes

From ProofWiki
Jump to navigation Jump to search

This category contains definitions related to Dual Codes.
Related results can be found in Category:Dual Codes.


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$.

Pages in category "Definitions/Dual Codes"

This category contains only the following page.