Q-ary Gray codes and weight distributions

Characteristic vector and weight distribution of a linear code

“…The efficient algorithms generate all codewords in a sequence, where any codeword is obtained from the previous one by adding only one codeword. They usually use q-ary Gray codes (see for example [15]) or an additional matrix (see [9]). The complexity of these algorithms is O(nq k ) for a fixed q. Katsman and Tsfasman in [20] proposed a geometric method based on algebraic-geometric codes.…”