How to Compute All Combinations of Vectors of Length 6 Made up of Numbers -1 and 1?

For example, If I have two numbers [-1 1] in a some random order in a vector of length 6, how can I compute all 64 combinations of these numbers such that a result is a matrix of 64x6 dimension?

To make my question more clear, result would look something like this:

A = [-1 1 -1 1 -1 1; 1 -1 1 1 -1 -1 1; -1 1 -1 -1 1 -1; 1 -1 -1 1 -1 -1; etc.] 

with all 64 possible combinations. Since there are 64 combinations, a resulting matrix needs to have 64 rows and 6 columns since every row (vector) has 6 numbers.

[Torsten]

Only 15, not 64 combinations.

[Dario Miric]

Yes, since I only have two different values, I will have a lot of equal combinations (64 - 15 = 49). Do you know if there is a function to do this?

Answer 1

[Torsten]

Brute force would be

unique(perms(A))

Maybe there is a better solution.

[Dario Miric]

My question wasn't actually accurate for what I want. I edited it, so know it is clear.

[Torsten]

Then

M = permn([-1 1],6)

permn is in the FileExchange.

But your question from above is still unclear. I only deduced what you mean by the number 64.

It still sounds you want to permute the numbers in a FIXED random vector made up of -1 and 1.

[Dario Miric]

Yes, all combinations of -1 and 1 in a vector of length 6. Result will be something like this: [-1 -1 1 -1 1 1; 1 -1 1 -1 -1 1; etc.] with all 64 combinations in a matrix of 64x6 dimension.

[Torsten]

If you have a fixed vector v made up of -1 and 1 and you want to get all combinations of the elements of this vector, you get 6! permutations where many of them will repeat.

If you want all possible vectors of length 6 made up of the numbers -1 and 1, you get 64 such vectors.

I think the last thing is what you want, and permn will do this for you.

[Dario Miric]

Exactly! Thank you.