On the Computation of the Weight Distribution of Linear Codes over Finite Fields
We develop an algorithm for computing the weight distribution of a linear [n,k] code over a finite field F_q. We represent the codes by their characteristic vector with respect to a given generator matrix and a special type of a generator matrix of the k-dimensional simplex code. This characteristic vector is the input data of our algorithms. The complexity of the presented algorithms is O(kq^k).
READ FULL TEXT