# Computing minimum_distance of a code on non-prime fields fails ... sometimes.

Consider the following piece of code:

```
C=codes.RandomLinearCode(4,2,GF(16,'b'))
C.minimum_distance()
```

About half of the time, it fails with error

```
TypeError: unable to coerce from a finite field other than the prime subfield
```

I'd understand if SAGE could only compute the minimum distance for codes over primes fields, what has me confused is the fact that sometimes it can, sometimes it can't. Any clues as to what is going on here?

Hello,

Which version are you using? On both sage-6.5 and sage-6.6.rc0 I got

Yes, it may work for a few times; but if you keep evaluating, after a couple of successful evaluations you'll come up with a TypeError. You can try it this way, which certainly fails:

Thanks though for the interest, @vdelecroix

@Koji, all right. Got the error as well!