ConceptTheory & Algos
Linearly independent columns and minimum distance
The least number of linearly dependent columns in a matrix is equal to the minimum distance of the code for which this is the parity-check matrix.
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.