ConceptMathematics
Minimum distance of a linear code
For a linear code, the minimum distance d is equal to the minimum weight of any non-zero codeword in the code.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.