CodeDistanceEnumerator( code, word )
CodeDistanceEnumerator
returns a polynomial of the following form:where B_i is the number of codewords with distance i to word.
If word is a codeword, then CodeDistanceEnumerator
returns the
same polynomial as CodeWeightEnumerator
.
gap> CodeDistanceEnumerator( HammingCode( 3, GF(2) ),[0,0,0,0,0,0,1] ); x^6 + 3*x^5 + 4*x^4 + 4*x^3 + 3*x^2 + x gap> CodeDistanceEnumerator( HammingCode( 3, GF(2) ),[1,1,1,1,1,1,1] ); x^7 + 7*x^4 + 7*x^3 + 1 # '[1,1,1,1,1,1,1]' $\in$ 'HammingCode( 3, GF(2 ) )'
GAP 3.4.4