The GAP package QDistRnd implements a probabilistic algorithm for finding the distance of a $q$-ary quantum low-density parity-check code
While the article says:
The GAP package QDistRnd implements a probabilistic algorithm for finding the minimum distance of a quantum code linear over a finite field GF(q)
I think that the description from the README is much more precise and correct since the implemented algorithm is tailored towards quantum codes with small-weight stabilizers.
The README file says:
While the article says:
I think that the description from the README is much more precise and correct since the implemented algorithm is tailored towards quantum codes with small-weight stabilizers.