I have a known parity check matrix H (5x3) of some unknown code C in which I want to find the minimum distance of the code.
I understand from reading that to determine the minimum distance I can find the smallest number of linearly dependent columns in the parity check matrix, but how do I proceed in finding the smallest number of linearly dependent columns?