The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Iiro S. Honkala: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Uri Blass, Iiro S. Honkala, Simon Litsyn
    On tHe Size of Identifying Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:142-147 [Conf]
  2. G. Fang, Henk C. A. van Tilborg, Feng-Wen Sun, Iiro S. Honkala
    Some Features of Binary Block Codes for Correcting Asymmetric Errors. [Citation Graph (0, 0)][DBLP]
    AAECC, 1993, pp:105-120 [Conf]
  3. Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn
    On the Identification of Vertices and Edges Using Cycles. [Citation Graph (0, 0)][DBLP]
    AAECC, 2001, pp:308-314 [Conf]
  4. Iiro S. Honkala, Simon Litsyn, Aimo Tietäväinen
    On Algebraic Methods in Covering Radius Problems. [Citation Graph (0, 0)][DBLP]
    AAECC, 1995, pp:21-32 [Conf]
  5. Iiro S. Honkala
    A Lower Bound on Binary Codes with Covering Radius One. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1993, pp:34-37 [Conf]
  6. Iiro S. Honkala, Yrjö Kaipainen, Aimo Tietäväinen
    Long Binary Narrow-Sense BCH Codes Are Normal. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1996, v:8, n:1, pp:49-55 [Journal]
  7. Iiro S. Honkala, Tero Laihonen, Simon Litsyn
    On Covering Radius and Discrete Chebyshev Polynomials. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:5, pp:395-401 [Journal]
  8. Iiro S. Honkala, Antoine Lobstein
    On the complexity of the identification problem in Hamming spaces. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2002, v:38, n:11/12, pp:839-845 [Journal]
  9. Iiro S. Honkala
    Combinatorial lower bounds on binary codes with covering radius one. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:50, n:, pp:- [Journal]
  10. Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
    General Bounds for Identifying Codes in Some Infinite Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  11. Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
    New Bounds for Codes Identifying Vertices in Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  12. Iiro S. Honkala
    On (q, 1)-subnormal q-ary Covering Codes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:52, n:3, pp:213-221 [Journal]
  13. Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn
    Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:409-419 [Journal]
  14. Heikki O. Hämäläinen, Iiro S. Honkala, Markku K. Kaikkonen, Simon Litsyn
    Bounds for Binary Multiple Covering Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1993, v:3, n:3, pp:251-275 [Journal]
  15. Iiro S. Honkala, Andrew Klapper
    Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:23, n:2, pp:131-146 [Journal]
  16. Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
    On Codes Identifying Sets of Vertices in Hamming Spaces. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:24, n:2, pp:193-204 [Journal]
  17. Iiro S. Honkala, Tero Laihonen
    On the Identification of Sets of Points in the Square Lattice. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:29, n:1, pp:139-152 [Journal]
  18. Uri Blass, Iiro S. Honkala, Simon Litsyn
    Bounds on identifying codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:241, n:1-3, pp:119-128 [Journal]
  19. Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
    The minimum density of an identifying code in the king lattice. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:95-109 [Journal]
  20. Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
    On strongly identifying codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:191-205 [Journal]
  21. Iiro S. Honkala
    An optimal locating-dominating set in the infinite triangular grid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:21, pp:2670-2681 [Journal]
  22. Iiro S. Honkala, Tero Laihonen
    On locating-dominating sets in infinite grids. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:2, pp:218-227 [Journal]
  23. Iiro S. Honkala, Tero Laihonen
    Codes for Identification in the King Lattice. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:4, pp:505-516 [Journal]
  24. Iiro S. Honkala, Tero Laihonen
    On identifying codes in the hexagonal mesh. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:1, pp:9-14 [Journal]
  25. Iiro S. Honkala, Tero Laihonen
    On a new class of identifying codes in graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:2-3, pp:92-98 [Journal]
  26. Iiro S. Honkala, Antoine Lobstein
    On Identifying Codes in Binary Hamming Spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:99, n:2, pp:232-243 [Journal]
  27. Iiro S. Honkala, Antoine Lobstein
    On the Density of Identifying Codes in the Square Lattice. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:85, n:2, pp:297-306 [Journal]
  28. Iiro S. Honkala, Tero Laihonen
    On identification in the triangular grid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:67-86 [Journal]
  29. Iiro S. Honkala
    A family of optimal identifying codes in Z2. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:8, pp:1760-1763 [Journal]
  30. Iiro S. Honkala, Antoine Lobstein
    On Identification in ZZ2 Using Translates of Given Patterns. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2003, v:9, n:10, pp:1204-1219 [Journal]
  31. Iiro S. Honkala, Tero Laihonen
    On identifying codes in the triangular and square grids. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:304-312 [Journal]
  32. Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
    Bounds for Codes Identifying Vertices in the Hexagonal Grid. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:4, pp:492-504 [Journal]
  33. Heikki O. Hämäläinen, Iiro S. Honkala, Simon Litsyn, Patric R. J. Östergård
    Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:2, pp:196-207 [Journal]
  34. Iiro S. Honkala, Andrew Klapper
    Multicovering Bounds from Relative Covering Radii. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:228-234 [Journal]
  35. Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
    On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2001, v:50, n:2, pp:174-176 [Journal]
  36. Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn
    On relations between covering radius and dual distance. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:1808-1816 [Journal]
  37. Wende Chen, Iiro S. Honkala
    Lower bounds for q-ary covering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:664-0 [Journal]
  38. Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, H. F. Mattson Jr.
    Weighted coverings and packings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1856-1867 [Journal]
  39. Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé
    Long packing and covering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1617-1619 [Journal]
  40. Tuvi Etzion, Gadi Greenberg, Iiro S. Honkala
    Normal and abnormal codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1453-0 [Journal]
  41. Iiro S. Honkala
    Lower bounds for binary covering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:2, pp:326-0 [Journal]
  42. Iiro S. Honkala
    Modified bounds for coveting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:351-0 [Journal]
  43. Iiro S. Honkala
    On (k, t) -subnormal covering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:4, pp:1203-0 [Journal]
  44. Iiro S. Honkala, Heikki O. Hämäläinen
    A new construction for covering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1343-0 [Journal]
  45. Iiro S. Honkala, Heikki O. Hämäläinen
    Bounds for abnormal binary codes with covering radius one. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:372-0 [Journal]
  46. Iiro S. Honkala, Mark G. Karpovsky, Lev B. Levitin
    On robust and dynamic identifying codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:2, pp:599-612 [Journal]
  47. Iiro S. Honkala, Tero Laihonen
    The probability of undetected error can have several local maxima. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2537-2539 [Journal]
  48. Sanna M. Ranto, Iiro S. Honkala, Tero Laihonen
    Two families of optimal identifying codes in binary Hamming spaces. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:5, pp:1200-1203 [Journal]
  49. Iiro S. Honkala
    All binary codes with covering radius one are subnormal. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:94, n:3, pp:229-232 [Journal]
  50. Iiro S. Honkala
    On lengthening of covering codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:291-295 [Journal]
  51. Iiro S. Honkala
    On the normality of multiple covering codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:229-239 [Journal]
  52. Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
    On Locating-Dominating Codes in Binary Hamming Spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2004, v:6, n:2, pp:265-282 [Journal]
  53. Iiro S. Honkala, Tero Laihonen
    On identifying codes that are robust against edge changes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:7, pp:1078-1095 [Journal]

  54. Structural Properties of Twin-Free Graphs. [Citation Graph (, )][DBLP]


  55. Weighted codes in Lee metrics. [Citation Graph (, )][DBLP]


  56. On r-locating-dominating sets in paths. [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002