Iiro Honkala

From MaRDI portal
(Redirected from Person:1261013)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
On the ensemble of optimal identifying codes in a twin-free graph
Cryptography and Communications
2016-04-11Paper
On the ensemble of optimal dominating and locating-dominating codes in a graph
Information Processing Letters
2015-06-02Paper
On the number of optimal identifying codes in a twin-free graph
Discrete Applied Mathematics
2014-11-28Paper
Minimum sizes of identifying codes in graphs differing by one edge
Cryptography and Communications
2014-06-20Paper
Weighted perfect codes in Lee metric
Electronic Notes in Discrete Mathematics
2013-10-10Paper
Minimum sizes of identifying codes in graphs differing by one vertex
Cryptography and Communications
2013-08-02Paper
Watching systems in the King grid
Graphs and Combinatorics
2013-06-26Paper
Locally identifying colourings for graphs with given maximum degree
Discrete Mathematics
2012-05-30Paper
On vertex-robust identifying codes of level three.2011-10-25Paper
An optimal strongly identifying code in the infinite triangular grid
The Electronic Journal of Combinatorics
2010-08-12Paper
An optimal strongly identifying code in the infinite triangular grid
The Electronic Journal of Combinatorics
2010-08-12Paper
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs
Advances in Mathematics of Communications
2010-03-10Paper
Erratum to ``Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.
Advances in Mathematics of Communications
2010-03-08Paper
On a new class of identifying codes in graphs
Information Processing Letters
2010-01-29Paper
Weighted codes in Lee metrics
Designs, Codes and Cryptography
2009-10-14Paper
On identifying codes in the hexagonal mesh
Information Processing Letters
2009-07-09Paper
On \(r\)-locating-dominating sets in paths
European Journal of Combinatorics
2009-06-17Paper
On identifying codes in the King grid that are robust against edge deletions
The Electronic Journal of Combinatorics
2009-04-07Paper
On identifying codes in the King grid that are robust against edge deletions
The Electronic Journal of Combinatorics
2009-04-07Paper
On robust and dynamic identifying codes
IEEE Transactions on Information Theory
2008-12-21Paper
scientific article; zbMATH DE number 5370111 (Why is no real title available?)2008-11-21Paper
On identification in \(\mathbb Z^2\) using translates of given patterns2007-11-30Paper
On identifying codes that are robust against edge changes
Information and Computation
2007-07-16Paper
Structural properties of twin-free graphs
The Electronic Journal of Combinatorics
2007-03-12Paper
Structural properties of twin-free graphs
The Electronic Journal of Combinatorics
2007-03-12Paper
On codes identifying vertices in the two-dimensional square lattice with diagonals
IEEE Transactions on Computers
2007-01-09Paper
A family of optimal identifying codes in \(\mathbb Z^2\)
Journal of Combinatorial Theory. Series A
2006-12-07Paper
On 2-edge robust \(r\)-identifying codes in the king grid2006-12-05Paper
An optimal locating-dominating set in the infinite triangular grid
Discrete Mathematics
2006-10-30Paper
On locating--dominating sets in infinite grids
European Journal of Combinatorics
2006-03-22Paper
Two families of optimal identifying codes in binary Hamming spaces
IEEE Transactions on Information Theory
2005-05-11Paper
scientific article; zbMATH DE number 2159641 (Why is no real title available?)2005-04-20Paper
On Identifying Codes in the Triangular and Square Grids
SIAM Journal on Computing
2005-02-21Paper
An optimal edge-robust identifying code in the triangular lattice
Annals of Combinatorics
2005-01-03Paper
On identification in the triangular grid
Journal of Combinatorial Theory. Series B
2004-08-06Paper
scientific article; zbMATH DE number 2081148 (Why is no real title available?)2004-08-04Paper
Codes for identification in the king lattice
Graphs and Combinatorics
2004-03-04Paper
The minimum density of an identifying code in the king lattice.
Discrete Mathematics
2004-02-14Paper
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
Discrete Applied Mathematics
2003-09-09Paper
On the complexity of the identification problem in Hamming spaces
Acta Informatica
2003-09-01Paper
scientific article; zbMATH DE number 1436153 (Why is no real title available?)2003-08-06Paper
On the identification of sets of points in the square lattice
Discrete & Computational Geometry
2003-03-17Paper
On the density of identifying codes in the square lattice
Journal of Combinatorial Theory. Series B
2002-12-10Paper
On identifying codes in binary Hamming spaces
Journal of Combinatorial Theory. Series A
2002-09-12Paper
On strongly identifying codes
Discrete Mathematics
2002-08-29Paper
scientific article; zbMATH DE number 1522566 (Why is no real title available?)2002-07-22Paper
Short dominating paths and cycles in the binary hypercube
Annals of Combinatorics
2002-07-14Paper
scientific article; zbMATH DE number 1744107 (Why is no real title available?)2002-05-22Paper
scientific article; zbMATH DE number 1740045 (Why is no real title available?)2002-05-14Paper
Multicovering bounds from relative covering radii
SIAM Journal on Discrete Mathematics
2002-04-23Paper
On the probability of undetected error for binary codes used for combined correction and detection
Journal of Discrete Mathematical Sciences & Cryptography
2002-04-03Paper
Bounds for the multicovering radii of Reed-Muller codes with applications to stream ciphers
Designs, Codes and Cryptography
2002-03-19Paper
scientific article; zbMATH DE number 1504659 (Why is no real title available?)2002-03-18Paper
General bounds for identifying codes in some infinite regular graphs
The Electronic Journal of Combinatorics
2002-02-07Paper
General bounds for identifying codes in some infinite regular graphs
The Electronic Journal of Combinatorics
2002-02-07Paper
Bounds on identifying codes
Discrete Mathematics
2002-01-08Paper
On codes identifying sets of vertices in Hamming spaces
Designs, Codes and Cryptography
2001-10-16Paper
Codes for strong identification2001-10-14Paper
On identifying codes2001-09-18Paper
Combinatorial lower bounds on binary codes with covering radius one
Ars Combinatoria
2001-06-10Paper
Bounds for codes identifying vertices in the hexagonal grid
SIAM Journal on Discrete Mathematics
2001-03-19Paper
On relations between covering radius and dual distance
IEEE Transactions on Information Theory
2000-09-07Paper
The probability of undetected error can have several local maxima
IEEE Transactions on Information Theory
2000-09-07Paper
scientific article; zbMATH DE number 1456810 (Why is no real title available?)2000-06-07Paper
scientific article; zbMATH DE number 1284426 (Why is no real title available?)2000-02-01Paper
New bounds for codes identifying vertices in graphs
The Electronic Journal of Combinatorics
1999-03-31Paper
New bounds for codes identifying vertices in graphs
The Electronic Journal of Combinatorics
1999-03-31Paper
Long packing and covering codes
IEEE Transactions on Information Theory
1998-11-04Paper
On covering radius and discrete Chebyshev polynomials
Applicable Algebra in Engineering, Communication and Computing
1998-05-13Paper
scientific article; zbMATH DE number 1057736 (Why is no real title available?)1998-01-26Paper
scientific article; zbMATH DE number 1082111 (Why is no real title available?)1997-10-30Paper
Long binary narrow-sense BCH codes are normal
Applicable Algebra in Engineering, Communication and Computing
1997-08-03Paper
scientific article; zbMATH DE number 1024657 (Why is no real title available?)1997-06-22Paper
Weighted coverings and packings
IEEE Transactions on Information Theory
1997-03-25Paper
scientific article; zbMATH DE number 890668 (Why is no real title available?)1996-06-18Paper
Football Pools--A Game for Mathematicians
The American Mathematical Monthly
1996-05-09Paper
Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points
SIAM Journal on Discrete Mathematics
1996-01-24Paper
On the normality of multiple covering codes
Discrete Mathematics
1994-11-22Paper
On \((p,1)\)-subnormal \(q\)-ary covering codes
Discrete Applied Mathematics
1994-11-22Paper
Normal and abnormal codes
IEEE Transactions on Information Theory
1994-10-04Paper
A Graham-Sloane type construction for \(s\)-surjective matrices
Journal of Algebraic Combinatorics
1994-05-15Paper
scientific article; zbMATH DE number 493080 (Why is no real title available?)1994-01-27Paper
Bounds for binary multiple covering codes
Designs, Codes and Cryptography
1993-08-29Paper
On lengthening of covering codes
Discrete Mathematics
1993-01-16Paper
All binary codes with covering radius one are subnormal
Discrete Mathematics
1992-06-28Paper
Modified bounds for covering codes
IEEE Transactions on Information Theory
1991-01-01Paper
Bounds for abnormal binary codes with covering radius one
IEEE Transactions on Information Theory
1991-01-01Paper
On (k, t)-subnormal covering codes
IEEE Transactions on Information Theory
1991-01-01Paper
Lower bounds for q-ary covering codes
IEEE Transactions on Information Theory
1990-01-01Paper
A new construction for covering codes
IEEE Transactions on Information Theory
1989-01-01Paper
Lower bounds for binary covering codes
IEEE Transactions on Information Theory
1988-01-01Paper
Some lower bounds for constant weight codes
Discrete Applied Mathematics
1987-01-01Paper
scientific article; zbMATH DE number 4023309 (Why is no real title available?)1987-01-01Paper
A modification of the Zinoviev lower bound for constant weight codes
Discrete Applied Mathematics
1985-01-01Paper
scientific article; zbMATH DE number 3952656 (Why is no real title available?)1985-01-01Paper


Research outcomes over time


This page was built for person: Iiro Honkala