Conditions Satisfied by Linear Code

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $p$ be a prime number.

Let $\Z_p$ be the set of residue classes modulo $p$.


Let $C := \tuple {n, k}$ be a linear code of a master code $\map V {n, p}$.


Then $C$ satisfies the following conditions:

$(C \, 1): \quad \forall \mathbf x, \mathbf y \in C: \mathbf x + \paren {-\mathbf y} \in C$
$(C \, 2): \quad \forall \mathbf x \in C, m \in \Z_p: m \times \mathbf x \in C$

where $+$ and $\times$ are the operations of codeword addition and codeword multiplication respectively.


Proof

From Master Code forms Vector Space, $\map V {n, p}$ is a vector space.

By definition, $\tuple {n, k}$ is a subspace of $\map V {n, p}$.

The result follows by the fact that a subspace is itself a vector space.




Sources