1
$\begingroup$

So we're working in Z2k, the group of bit-vectors of length k and componentwise addition modulo 2. Now I'm trying to make a function yj=1..?(vi) assigning elements of Z2k to n vertices, such that every set of k vertices {vi}i=1..k gets assigned a set of k independent vectors {yj(vi)}i=1..k for at least one j. I think it should be possible in n assignments (j=1..n), but I can only construct it for small k or n..

Does anyone know how this problem is called (so I can search for literature concerning it), or even better, how to solve it?

Thank you so much! Karl

  • 0
    This is very hard to read, by "a function" you actually mean a number of functions indexed by j and you chose "?" as name of this key number?2011-11-15

0 Answers 0