Short dominating paths and cycles in the binary (2007)
Uri Blass, Iiro Honkala, Mark G. Karpovsky, Simon Litsyn
hypercube
On the Size of Optimal Binary Codes of Length 9 and Covering Radius 1 (2007)
The minimum number of codewords in a binary code with length n and covering radius R is denoted by K(n; R). The values of K(n; 1) are known up to length 8, and the corresponding optimal codes have...
Short Dominating Paths and Cycles in the Binary Hypercube (2001)
Uri Blass, Iiro Honkala, Mark G. Karpovsky, Simon Litsyn
Introduction Denote by F the binary alphabet, and by F n the space of binary vectors of length n endowed with the Hamming metric d(\Delta; \Delta), i.e., the binary hypercube. The covering radius of...
The Smallest Covering Code of Length 8 and Radius 2 Has 12 Words (1999)
We prove that the smallest covering code of length 8 and covering radius 2 has exactly 12 words. The proof is based on partial classification of even weight codewords, followed by a search for small...
Several New Lower Bounds for Football Pool Systems (1999)
We derive several new lower bounds on the size of ternary covering codes of lengths 6, 7 and 8 and with covering radii 2 or 3. 1 Introduction Ternary covering code C of length n and radius R is a...
How far can Nim in disguise be stretched? (1998)
Blass, Uri, Fraenkel, Aviezri S., Guelman, Romina
A move in the game of nim consists of taking any positive number of tokens from a single pile. Suppose we add the class of moves of taking a nonnegative number of tokens jointly from all the piles....
How Far Can Nim in Disguise be Stretched? (1998)
Uri Blass, Aviezri S. Fraenkel, Romina Guelman
We give a complete answer to the question which moves can be adjoined to the game of nim without changing its winning strategy. The results apply to other combinatorial games with unbounded...
How Far Can Nim in Disguise be Stretched? (1998)
Uri Blass Electrical, Uri Blass, Aviezri S. Fraenkel, Romina Guelman
A move in the game of nim consists of taking any positive number of tokens from a single pile. Suppose we add the class of moves of taking a nonnegative number of tokens jointly from all the piles....
1998], How far can Nim in disguise be stretched (1998)
Uri Blass, Electrical Engineering
Abstract A move in the game of nim consists of taking any positive number of tokens from a single pile. Suppose we add the class of moves of taking a nonnegative number of tokens jointly from all the...