How to generate a binary matrix with unique rows (or) columns?

Question

Nitin SHrinivas 2021-8-1

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/890047-how-to-generate-a-binary-matrix-with-unique-rows-or-columns

编辑： Matt J 2021-8-1

n = 15; k = 10;
flag = 0;
for l=1:2^k
    while(1)
        temp = randi([0,1] , 1,n);
        for m=1:l-1
            if(codeword(m,:) == temp)
                flag = 1;
            end
        end
        if(flag ==0)
            break;
        end
    end
    codeword(l,:) = temp;
end

This is a very time complex code!!

Can anyone suggest any other way with which I can solve this problem?

Thanks.

1 个评论
显示 -1更早的评论隐藏 -1更早的评论

Jonas 2021-8-1

编辑：Jonas 2021-8-1

i suggest you just write ascending numbers in binary format, then all rows or columns are unique. think about how many rows and digits you need. this way you could produce e.g.

the minimum width of your matrix is then given by nextpow2 of your number of rows, but if you need a broader matrix you are free to just use more bits

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Matt J 2021-8-1

1
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/890047-how-to-generate-a-binary-matrix-with-unique-rows-or-columns#answer_758177

编辑：Matt J 2021-8-1

在 MATLAB Online 中打开

Something like this, perhaps?

n = 15; k = 10;
dec2bin( randperm(2^n,k) ) -'0'
ans = 10×15
   0     1     0     1     0     0     1     1     1     1     0     0     0     0
   0     0     1     1     0     0     0     1     0     0     1     0     1     0
   1     0     1     1     1     0     0     1     1     1     0     1     0     0
   1     1     1     1     0     0     0     0     1     0     1     1     0     0
   1     0     0     1     1     0     0     0     1     0     0     0     1     1
   0     0     0     0     0     1     1     0     0     0     1     1     0     1
   1     0     1     1     1     1     0     1     1     1     0     0     1     1
   1     1     1     1     1     0     0     1     1     1     1     1     0     1
   1     0     1     1     0     1     1     0     0     1     1     1     1     1
   0     1     1     0     1     1     0     1     1     1     1     0     0     1