Tagged Questions
5
votes
1answer
65 views
How to find the sparsest vector in a given subspace of $\mathbb{F}_2^n$
A subspace $C$ of $\mathbb{F}_2^n$ is given for some $n \geq 1$.
The space $C$ is given by its basis.
Is there a polynomial time algorithm to find the (nonzero) vector in $C$ of lowest hamming ...
