Algorithm XXXX: LinCodeWeightInv - Library for Computing the Weight Distribution of Linear Codes Over Finite Fields

We present the Linear Codes Weight Invariant Library (LinCodeWeightInv) for optimized computing of the weight distribution and other weight characteristics of a random linear code (minimum distance, number of codewords with a given weight, etc.). The presented library is developed for linear codes over finite fields with up to 64 elements. We use two main methods for optimizations - efficient algorithms for generating the codewords and integration of extended vector registers with SSE4.1, AVX2 and AVX512 instruction sets for x86 architectures and NEON instructions set for ARM. The LinCodeWeightInv is compared to other software systems for linear codes over finite fields. Comparing our library to the Magma software we get between 1.3 and 4 times faster execution times for \(F₂\) and \(F₅\) and up to 49 depending on the field and the code length. Comparing the LinCodeWeightInv library to the open source software GAP we observe a reduction in computation time by factors between 5 and 7 for \(F₂\) . For other finite fields, we observe more than 100 times faster execution times.