2021-01-18 16:07:20 +0200 received badge ● Popular Question (source) 2015-03-26 12:57:47 +0200 commented answer Computing minimum_distance of a code on non-prime fields fails ... sometimes. You guys rock! I can git my way, if my life depends on it, but since it's not "mission critical", I'll wait for 6.6. 2015-03-25 09:27:41 +0200 received badge ● Scholar (source) 2015-03-25 09:27:33 +0200 commented answer Computing minimum_distance of a code on non-prime fields fails ... sometimes. Thanks a lot for both the quick answer and the ticket. Do I get bragging rights (for my students) for uncovering this, @vdelecroix ? ;) 2015-03-24 20:06:02 +0200 commented question Computing minimum_distance of a code on non-prime fields fails ... sometimes. 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: for i in range(100): C=codes.RandomLinearCode(4,2,GF(16,'b')) C.minimum_distance()  Thanks though for the interest, @vdelecroix 2015-03-24 12:44:46 +0200 received badge ● Student (source) 2015-03-23 15:58:55 +0200 received badge ● Editor (source) 2015-03-23 15:54:25 +0200 asked a question 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?