The k-Even Set problem is a parameterized variant of the Minimum Distance Problem of linear codes over \mathbb F_2, which can be stated as follows: given a generator matrix \mathbf A and an integer k, determine whether the code generated by \mathbf A has distance at most k. Here, k ... more >>>

The k-Even Set problem is a parameterized variant of the Minimum Distance Problem of linear codes over \mathbb{F}_2, which can be stated as follows: given a generator matrix A and an integer k, determine whether the code generated by A has distance at most k, or in other words, whether ... more >>>