The goal of the project is to examine a polynomial-time probabilistic algorithm to compute the minimum distance of an arbitrary linear error-correcting code. The work shall be done in the GAP coding-theory package GUAVA. GAP is a computer algebra package whose open source kernel is written in the C programming language. However, most packages (such as GUAVA) and the algorithms described here are written in GAP's own interpreted language. The pseudo-code in the literature for this polynomial-time algorithm is flawed, as will be explained below. Jointly, with my advisor, I corrected and improved this algorithm.