General bounds for identifying codes in some infinite regular graphs (2009)
Charon, Irène, Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine
The Minimum Density of an Identifying Code in the King Lattice (2009)
Charon, Irène, Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine
Triple systems for identifying quadruples (2008)
A collection C of distinct 3-element subsets of the set S = {1, 2,...,n} is called an identifying system of the quadruples of S, if every 4-element subset of S contains at least one of the triples in...
Iiro Honkala, Tero Laihonen, Simon Litsyn
Abstract We derive a new upper bound on the covering radius of a code as a function of its dual distance. This bound improves on the Honkala-Litsyn-Tiet"av"ainen bound and in a...
Short dominating paths and cycles in the binary (2007)
Uri Blass, Iiro Honkala, Mark G. Karpovsky, Simon Litsyn
hypercube
Iiro Honkala, Olivier Hudry, Antoine Lobstein
bounds for identifying codes in some innite regular graphs
Iiro Honkala, Mark G. Karpovsky, Simon Litsyn
A set of subgraphs C1, C2,..., Ck in a graph G is said to identify
Rue Barrault, Olivier Hudry, Iiro Honkala, Antoine Lobstein
in some infinite regular graphs
On Dynamic Identifying Codes (2006)
Iiro Honkala, Lev B. Levitin, Mark G. Karpovsky
Awalkc1 , c2, ..., cM in an undirected graph G =(V,E) is called a dynamic identifying code, if all the sets I(v)={u C : d(u, v) 1} for v V are nonempty and no two of them are the same set. Here d(u,...
On Locating-Dominating Codes in Binary HammingSpaces (2004)
Iiro Honkala, Tero Laihonen, Sanna Ranto
Locating faulty processors in a multiprocessor system gives the motivation for locating-dominating codes. We consider these codes in binary hypercubes and generalize the concept for the situation in...
On identification in Z 2 using translates of given patterns (2003)
Iiro Honkala, Antoine Lobstein
Abstract: Given a finite set of patterns, i.e., subsets of Z 2. What is the best way to place translates of them in such a way that every point belongs to at least one translate and no two points...
On Locating-Dominating Codes in Binary Hamming Spaces (2002)
Honkala, Iiro, Laihonen, Tero, Ranto, Sanna
Locating faulty processors in a multiprocessor system gives the motivation for locating-dominating codes. We consider these codes in binary hypercubes and generalize the concept for the situation in...
On strongly identifying codes (2002)
Iiro Honkala, Iiro Honkala, Tero Laihonen, Tero Laihonen, Sanna Ranto, Sanna Ranto, ...
Lemminkaisenkatu 14 A, 4th oor
Multicovering Bounds from Relative Covering Radii," to appear (2002)
The multicovering radii of a code are a recently introduced natural generalizations of the covering radius measuring the smallest radius of balls around codewords that cover all m-tuples of vectors....
On identifying codes in binary Hamming spaces (2002)
Iiro Honkala, Tero Laihonen, Sanna Ranto
Abstract Locating faulty processors in a multiprocessor system gives the motivation for locating-dominating codes. We consider these codes in binary hypercubes and generalize the concept for the...
On identifying codes in binary Hamming spaces (2002)
Iiro Honkala, Tero Laihonen, Sanna Ranto
Locating faulty processors in a multiprocessor system gives the motivation for locating-dominating codes. We consider these codes in binary hypercubes and generalize the concept for the situation in...
On Strongly Identifying Codes (2001)
Honkala, Iiro, Laihonen, Tero, Ranto, Sanna
http://www.tucs.fi/Publications/techreports/TR417.php
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...
On codes that can identify vertices in graphs (2000)
Cohen, Gérard, Honkala, Iiro, Lobstein, Antoine, Zémor, Gilles
Two families of optimal identifying codes in binary Hamming spaces (2000)
Ranto, Sanna, Honkala, Iiro, Laihonen, Tero
http://www.tucs.fi/Publications/techreports/TR349.php
On codes identifying sets of vertices in Hamming spaces (2000)
Honkala, Iiro, Laihonen, Tero, Ranto, Sanna
http://www.tucs.fi/Publications/techreports/TR331.php
Bounds for Codes Identifying Vertices in the Hexagonal Grid (2000)
Gérard D. Cohen, G'erard D. Cohen, Iiro Honkala, Antoine Lobstein
In an undirected graph G = (V; E) a subset C ` V is called an identifying code, if the sets B1 (v) " C consisting of all elements of C within distance one from the vertex v are nonempty and...
Improved estimates on covering radius (1999)
Ashikhmin, Alexei, Honkala, Iiro, Laihonen, Tero, Litsyn, Simon
http://www.tucs.fi/Publications/techreports/TR277.php
The probability of undetected error can have several local maxima (1999)
http://www.tucs.fi/Publications/techreports/TR265.php
New bounds for codes identifying vertices in graphs (1999)
Cohen, Gérard, Honkala, Iiro, Lobstein, Antoine, Zémor, Gilles
Improved identifying codes for the grid (1999)
Cohen, Gérard, Gravier, Sylvain, Honkala, Iiro, Lobstein, Antoine, Mollard, Michel, Payan, Charles, ...
On relations between covering radius and dual distance (1999)
Ashikhmin, Alexei, Honkala, Iiro, Laihonen, Tero, Litsyn, Simon
New Bounds for Codes Identifying Vertices in Graphs (1999)
Gerard Cohen, Iiro Honkala, Antoine Lobstein, Gilles Zemor
Let G = (V; E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v 2 V , the neighbouring set N(v; C) is the set of vertices of C at distance at most one...
New Bounds for Codes Identifying Vertices in Graphs (1999)
Gerard Cohen, Antoine Lobstein, Iiro Honkala, Gilles Zemor
Let G =(V,E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v # V , the neighbouring set N(v,C)is the set of vertices of C at distance at most one...
On covering radius and discrete Chebyshev polynomials (1997)
Honkala, Iiro, Laihonen, Tero, Litsyn, Simon
http://www.tucs.fi/Publications/journals/jHoLaLi97.php
Codes and number theory (1996)
Honkala, Iiro, Tietäväinen, Aimo
http://www.tucs.fi/Publications/techreports/TR83.php
On covering radius and discrete Chebyshev polynomials (1996)
Honkala, Iiro, Laihonen, Tero, Litsyn, Simon
http://www.tucs.fi/Publications/techreports/TR81.php
Weighted coverings and packings (1995)
Cohen, Gérard, Honkala, Iiro, Litsyn, Simon, Mattson Jr, H. F.
Bounds for binary codes that are multiple coverings of the farthest-off points (1995)
Hämäläinen, Heikki, Honkala, Iiro, Litsyn, Simon, ÃstergÃ¥rd, Patric
Football pools - a game for mathematicians (1995)
Hämäläinen, Heikki, Honkala, Iiro, Litsyn, Simon, ÃstergÃ¥rd, Patric
Weighted coverings and packings (1994)
Cohen, Gérard, Honkala, Iiro, Litsyn, Simon, Mattson Jr, H. F.
Combinatorial bounds for binary constant weight and covering codes / (1989)
Nimiösivulla myös: Department of Mathematics, University of Turku, 20500 Turku 50, Finland. - Tiivistelmä ja 6 erip.