Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Bounds on identifying codes

- U. Blass, I. Honkala, S. Litsyn
- Computer Science, Mathematics
- Discret. Math.
- 28 October 2001

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-identifying… Expand

The Sprague-Grundy Function for Wythoff's Game

- U. Blass, A. Fraenkel
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 1 October 1990

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 is… Expand

On the size of optimal binary codes of length 9 and covering radius 1

- Patric R. J. Östergård, U. Blass
- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1 September 2001

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… Expand

On binary codes for identification

- U. Blass, I. Honkala, S. Litsyn
- Mathematics
- 26 January 2000

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

How Far Can Nim in Disguise Be Stretched?

- U. Blass, A. Fraenkel, R. Guelman
- Mathematics, Computer Science
- J. Comb. Theory, Ser. A
- 1 November 1997

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… Expand

Several New Lower Bounds on the Size of Codes with Covering Radius One

We derive several new lower bounds on the size of binary codes with covering radius one. In particular, we prove K

Short Dominating Paths and Cycles in the Binary Hypercube

- U. Blass, I. Honkala, M. Karpovsky, S. Litsyn
- Mathematics
- 1 June 2001

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 within… Expand

On tHe Size of Identifying Codes

- U. Blass, I. Honkala, S. Litsyn
- Computer Science, Mathematics
- AAECC
- 15 November 1999

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 length… Expand

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 small… Expand

- 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