A new proof of several inequalities on codes and sets

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

Note: Bounds on degrees of p-adic separating polynomials

Journal of Combinatorial Theory Series A

Bounds on sets with few distances

Journal of Combinatorial Theory Series A

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