n weight matrix

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 10 1 0If you add up columnwise then the weight is 1. God day and God bless!
[269 byte] By [czetsuyaa] at [2007-10-2 0:04:31]
# 1
[1]Create a m*n matrix[2.1] Loop through the numColumns[2.2]Loop through the numRows[2.3]Sum = all values from matrix[numRows][numColumns][2.4]Print/save: numColumns = Sum
prometheuzza at 2007-7-15 16:03:58 > top of Java-index,Other Topics,Algorithms...
# 2

> 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

JosAHa at 2007-7-15 16:03:58 > top of Java-index,Other Topics,Algorithms...