Hello,
as David correctly pointed out, MAGMA does have quite efficient
algorithms for
computing the minimum distance of block codes over finite fields, not
only
for linear, but also for additive codes.
But David isn't right in his assumption that I would have implemented
the algorithms
in MAGMA.
1. This is very interesting to me. The Python part of the algorithm in
SAGE is in
coding/linear_codes.py. It is essentially a wrapper for a function
written in GAP and C
written by Steve Linton:
http://modular.math.washington.edu/gap/Manuals/doc/htm/ref/CHAP023.htm#SSEC005.5
The function* AClos
