7 ms·
When I read the title, for a moment I thought that this was about finding a maximal subset of n-choose-k vectors for a given distance d, such that all combinati
by fjfaase 4y ago
When I read the title, for a moment I thought that this was about finding a maximal subset of n-choose-k vectors for a given distance d, such that all combination of vectors differ at atleast d positions.