DecreaseMinimumDistanceLowerBound( code, s, iterations )
DecreaseMinimumDistanceLowerBound is an implementation of
the algorithm for the minimum distance by Leon.
It is described in full detail in J.S. Leon, em A Probabilistic
Algorithm for Computing Minimum Weights of Large Error-Correcting
Codes, IEEE Trans. Inform. Theory, vol. 34, September 1988.
This algorithm tries to find codewords with small minimum weights. The parameter s is described in the article, the best results are obtained if it is close to the dimension of the code. The parameter iterations gives the number of runs that the algorithm will perform.
The result returned is a record with two fields; the first, mindist,
gives the lowest weight found, and word gives the corresponding
codeword.
GAP 3.4.4