Upper bounds for binary identifying codes (2009)
Exoo, Geoffrey, Junnila, Ville, Laihonen, Tero, Ranto, Sanna
Graphs where every k-subset of vertices is an identifying set (2009)
Gravier, Sylvain, Janson, Svante, Laihonen, Tero, Ranto, Sanna
Let $G=(V,E)$ be an undirected graph without loops and multiple edges. A subset $C\subseteq V$ is called \emph{identifying} if for every vertex $x\in V$ the intersection of $C$ and the closed...
Improved bounds on binary identifying codes (2008)
Exoo, Geoffrey, Junnila, Ville, Laihonen, Tero, Ranto, Sanna
Constructions for identifying codes (2008)
Exoo, Geoffrey, Junnila, Ville, Laihonen, Tero, Ranto, Sanna
On the size of identifying codes in binary hypercubes (2008)
Janson, Svante, Laihonen, Tero
We consider identifying codes in binary Hamming spaces F^n, i.e., in binary hypercubes. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. Currently, the...
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...
Abstract We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by...
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 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
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...
Families of Optimal Codes for Strong Identification (2001)
http://www.tucs.fi/Publications/techreports/TR418.php
On Strongly Identifying Codes (2001)
Honkala, Iiro, Laihonen, Tero, Ranto, Sanna
http://www.tucs.fi/Publications/techreports/TR417.php
Families of Optimal Codes for (2001)
Turku Centre, Computer Science, Strong Identi Cation, Strong Identi Cation, Tero Laihonen, Tero Laihonen, ...
Codes for strong identication are considered. The motivation for these codes comes from locating faulty processors in a multiprocessor system. Constructions and lower bounds on these codes are given....
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
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
On relations between covering radius and dual distance (1999)
Ashikhmin, Alexei, Honkala, Iiro, Laihonen, Tero, Litsyn, Simon
On estimating the covering radius with the aid of the dual distance (1999)
http://www.tucs.fi/Publications/techreports/TR232.php
On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes (1998)
. We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by...
Estimates on the covering radius when the dual distance is known / (1998)
Diss. -- Turun yliopisto.
New bounds on covering radius as a function of dual distance (1997)
http://www.tucs.fi/Publications/techreports/TR145.php
Linear multisecret-sharing schemes and error-correcting codes (1997)
Ding, Cunsheng, Laihonen, Tero, Renvall, Ari
http://www.tucs.fi/Publications/journals/jDiLaRe97.php
On covering radius and discrete Chebyshev polynomials (1997)
Honkala, Iiro, Laihonen, Tero, Litsyn, Simon
http://www.tucs.fi/Publications/journals/jHoLaLi97.php
A.: "Linear Multisecret-Sharing Schemes and Error-Correcting Codes (1997)
Cunsheng Ding, Tero Laihonen, Ari Renvall
Abstract: In this paper a characterization of the general relation between linear multisecret-sharing schemes and error-correcting codes is presented. A bridge between linear multisecret-sharing...
On upper bounds for minimum distance and covering radius of non-binary codes (1996)
http://www.tucs.fi/Publications/techreports/TR80.php
On covering radius and discrete Chebyshev polynomials (1996)
Honkala, Iiro, Laihonen, Tero, Litsyn, Simon
http://www.tucs.fi/Publications/techreports/TR81.php