• Publications
  • Influence
Bounds on identifying codes
Abstract A code is called t-identifying if the sets B t ( x )∩C are all nonempty and different. Constructions of 1-identifying codes and lower bounds on the minimum cardinality of a 1-identifyingExpand
  • 67
  • 5
The Sprague-Grundy Function for Wythoff's Game
Abstract An algorithm for producing the Sprague-Grundy function values g of Wythoff's game is given. Based on it, two interesting properties of g are proved, the structure of the 1-values of g isExpand
  • 40
  • 4
  • PDF
On the size of optimal binary codes of length 9 and covering radius 1
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 haveExpand
  • 20
  • 3
On binary codes for identification
A code C ⊆ 2n is called t-identifying if the sets Bt(x) ∩ C are all nonempty and different. Constructions of t-identifying codes are given. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 151–156,Expand
  • 64
  • 2
How Far Can Nim in Disguise Be Stretched?
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 unboundedExpand
  • 25
  • 2
  • PDF
Several New Lower Bounds on the Size of Codes with Covering Radius One
  • U. Blass, S. Litsyn
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1 September 1998
We derive several new lower bounds on the size of binary codes with covering radius one. In particular, we prove K
  • 12
  • 1
Short Dominating Paths and Cycles in the Binary Hypercube
Abstract. A sequence of binary words of length n is called a cube dominating path, if the Ham-ming distance between two consecutive words is always one, and every binary word of length n is withinExpand
  • 8
  • PDF
On tHe Size of Identifying Codes
A code is called t-identifying if the sets Bt(x) ∩ C are all nonempty and different. Constructions of 1-identifying codes and lower bounds on the minimum cardinality of a 1-identifying code of lengthExpand
  • 3
The smallest covering code of length 8 and radius 2 has 12 words
We prove that the smallest covering code of length 8 and covering radius 2 has exactly 12 words. The proof is based on partial classi cation of even weight codewords, followed by a search for smallExpand
  • 2
Several new lower bounds for football pool systems
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