DistancesDistribution( C, w )
DistancesDistribution returns a distribution of the distances of all
elements of C to a codeword w in the same vector space. The i^{th}
element of the distance distribution is the number of codewords of C
that have distance i-1 to w. The smallest value d with w[d+1] neq
0 is defined as the distance to C (see MinimumDistance).
gap> H := HadamardCode(20);
a (20,40,10)6..8 Hadamard code of order 20 over GF(2)
gap> c := Codeword("10110101101010010101", H);
[ 1 0 1 1 0 1 0 1 1 0 1 0 1 0 0 1 0 1 0 1 ]
gap> DistancesDistribution(H, c);
[ 0, 0, 0, 0, 0, 1, 0, 7, 0, 12, 0, 12, 0, 7, 0, 1, 0, 0, 0, 0, 0 ]
gap> MinimumDistance(H, c);
5 # distance to H
GAP 3.4.4