Numenta has paper on math properties of SDR.

Because I’m not mathematician, I’m asking if somebody can speculate on the properties of Segmented SDR.

SSDR is my ‘invention’. Very simply it is sparse vector like SDR with the added constraint that every bit is selected from a segment, rather than ‘totally’ randomly.

Let say n=1000 and w=50, then we divide them and segment_size=1000/50 = 20

So we divide the vector to 50 segments of size 20bits.

Then we pick randomly one bit from every segment.

How would union,partial match, overlap, noise-robustness and other properties fare.

In general I understand those are preserved more or less. I just want to know more precisely.

Second what if the selection in a segment is not random ?

Why … this way you can combine localist representation (selection within segment) with sparse (% of n).