| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau |
Locally identifying colourings for graphs with given maximum degree.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ville Junnila, Tero Laihonen |
Optimal lower bound for 2-identifying code in the hexagonal grid |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Geoffrey Exoo, Ville Junnila, Tero Laihonen |
Locating-dominating codes in paths. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau |
Locally identifying colourings for graphs with given maximum degree |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Florent Foucaud, Tero Laihonen, Aline Parreau |
An improved lower bound for (1,<=2)-identifying codes in the king grid |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ville Junnila, Tero Laihonen, Aline Parreau |
Tolerant identification with Euclidean balls |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ville Junnila, Tero Laihonen |
Identification in Z2 using Euclidean balls. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto |
Improved bounds on identifying codes in binary Hamming spaces. |
Eur. J. Comb. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Tero Laihonen |
On the size of identifying codes in binary hypercubes. |
J. Comb. Theory, Ser. A |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Tero Laihonen |
An optimal result for codes identifying sets of words. |
ISIT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tero Laihonen |
On cages admitting identifying codes. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen |
On Identifying Codes in the King Grid that are Robust Against Edge Deletions. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto |
New bounds on binary identifying codes. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto |
Improved bounds on binary identifying codes. |
ISIT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen |
On a new class of identifying codes in graphs. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen |
On identifying codes that are robust against edge changes. |
Inf. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto |
Improved Upper Bounds on Binary Identifying Codes. |
IEEE Transactions on Information Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen |
On locating-dominating sets in infinite grids. |
Eur. J. Comb. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tero Laihonen |
Optimal t-Edge-Robust r-Identifying Codes in the King Lattice. |
Graphs and Combinatorics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tero Laihonen |
On robust identification in the square and king grids. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tero Laihonen |
On Optimal Edge-Robust and Vertex-Robust (1, leql)-Identifying Codes. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen |
On identification in the triangular grid. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen |
On identifying codes in the hexagonal mesh. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto |
On Locating-Dominating Codes in Binary Hamming Spaces. |
Discrete Mathematics & Theoretical Computer Science |
2004 |
DBLP BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen |
On identifying codes in the triangular and square grids. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen |
Codes for Identification in the King Lattice. |
Graphs and Combinatorics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen |
On the Identification of Sets of Points in the Square Lattice. |
Discrete & Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto |
On strongly identifying codes. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tero Laihonen |
Optimal Codes for Strong Identification. |
Eur. J. Comb. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tero Laihonen, Sanna M. Ranto |
Families of optimal codes for strong identification. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tero Laihonen |
Sequences of optimal identifying codes. |
IEEE Transactions on Information Theory |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanna M. Ranto, Iiro S. Honkala, Tero Laihonen |
Two families of optimal identifying codes in binary Hamming spaces. |
IEEE Transactions on Information Theory |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto |
Codes for Strong Identification. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto |
On Codes Identifying Sets of Vertices in Hamming Spaces. |
Des. Codes Cryptography |
2001 |
DBLP BibTeX RDF |
|
| 1 | Tero Laihonen, Sanna M. Ranto |
Codes Identifying Sets of Vertices. |
AAECC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Tero Laihonen, Simon Litsyn |
New Bounds On Covering Radius as a Function of Dual Distance. |
SIAM J. Discrete Math. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn |
On relations between covering radius and dual distance. |
IEEE Transactions on Information Theory |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen |
The probability of undetected error can have several local maxima. |
IEEE Transactions on Information Theory |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Tero Laihonen, Simon Litsyn |
On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes. |
Des. Codes Cryptography |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Cunsheng Ding, Tero Laihonen, Ari Renvall |
Linear Multisecret-Sharing Schemes and Error-Correcting Codes. |
J. UCS |
1997 |
DBLP BibTeX RDF |
|
| 1 | Iiro S. Honkala, Tero Laihonen, Simon Litsyn |
On Covering Radius and Discrete Chebyshev Polynomials. |
Appl. Algebra Eng. Commun. Comput. |
1997 |
DBLP DOI BibTeX RDF |
Dual distance, Discrete Chebyshev polynomials, Code, Covering radius |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")