Note: on k-wise set-intersections and k-wise Hamming-distances
Journal of Combinatorial Theory Series A
Pairs of codes with prescribed Hamming distances and coincidences
Designs, Codes and Cryptography
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases
Mathematical Methods in Computer Science
Quantum weakly nondeterministic communication complexity
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Quantum weakly nondeterministic communication complexity
Theoretical Computer Science
New results on two hypercube coloring problems
Discrete Applied Mathematics
| Hi-index | 0.00 |