> Can someone teach me an algo on how to construct an
> nxm bit matrix (I mean here a matrix composed only of
> 1 and 0). Whose columns have a weight n. Example
> 1 0 1
> 0 1 0
>
> If you add up columnwise then the weight is 1.
In your example matrix the first and last column are identical. Did
you have that in mind? Are n, m and the weight supposed to be
fixed? e.g. n == 2, m == 3, weight == 1.
kind regards,
Jos