Iiro Honkala

1.5k total citations
78 papers, 922 citations indexed

About

Iiro Honkala is a scholar working on Electrical and Electronic Engineering, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Iiro Honkala has authored 78 papers receiving a total of 922 indexed citations (citations by other indexed papers that have themselves been cited), including 55 papers in Electrical and Electronic Engineering, 51 papers in Artificial Intelligence and 41 papers in Computer Networks and Communications. Recurrent topics in Iiro Honkala's work include graph theory and CDMA systems (54 papers), Coding theory and cryptography (50 papers) and Cooperative Communication and Network Coding (19 papers). Iiro Honkala is often cited by papers focused on graph theory and CDMA systems (54 papers), Coding theory and cryptography (50 papers) and Cooperative Communication and Network Coding (19 papers). Iiro Honkala collaborates with scholars based in Finland, France and Israel. Iiro Honkala's co-authors include Tero Laihonen, Antoine Lobstein, Simon Litsyn, Olivier Hudry, Irène Charon, Gérard Cohen, Gilles Zémor, Mark G. Karpovsky, Wende Chen and Patric R. J. Östergård and has published in prestigious journals such as IEEE Transactions on Information Theory, SIAM Journal on Computing and American Mathematical Monthly.

In The Last Decade

Iiro Honkala

76 papers receiving 848 citations

Peers

Iiro Honkala
Tero Laihonen Finland
H. van Tilborg Netherlands
Swastik Kopparty United States
Sihem Mesnager France
Philippe Gaborit France
Kevin T. Phelps United States
Stephen Suen United States
Nicolas Sendrier France
Ivan M. Havel Czechia
Shachar Lovett United States
Tero Laihonen Finland
Iiro Honkala
Citations per year, relative to Iiro Honkala Iiro Honkala (= 1×) peers Tero Laihonen

Countries citing papers authored by Iiro Honkala

Since Specialization
Citations

This map shows the geographic impact of Iiro Honkala's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Iiro Honkala with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Iiro Honkala more than expected).

Fields of papers citing papers by Iiro Honkala

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Iiro Honkala. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Iiro Honkala. The network helps show where Iiro Honkala may publish in the future.

Co-authorship network of co-authors of Iiro Honkala

This figure shows the co-authorship network connecting the top 25 collaborators of Iiro Honkala. A scholar is included among the top collaborators of Iiro Honkala based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Iiro Honkala. Iiro Honkala is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Honkala, Iiro, Olivier Hudry, & Antoine Lobstein. (2014). On the number of optimal identifying codes in a twin-free graph. Discrete Applied Mathematics. 180. 111–119. 3 indexed citations
2.
Honkala, Iiro. (2010). An Optimal Strongly Identifying Code in the Infinite Triangular Grid. The Electronic Journal of Combinatorics. 17(1). 4 indexed citations
3.
Honkala, Iiro & Tero Laihonen. (2010). On Vertex-Robust Identifying Codes of Level Three.. Ars Combinatoria. 94. 1 indexed citations
4.
Honkala, Iiro. (2006). On 2-edge robust r-identifying codes in the king grid.. Australas. J Comb.. 36. 151–166. 4 indexed citations
5.
Honkala, Iiro. (2006). A family of optimal identifying codes in Z2. Journal of Combinatorial Theory Series A. 113(8). 1760–1763. 3 indexed citations
6.
Honkala, Iiro. (2006). An optimal locating-dominating set in the infinite triangular grid. Discrete Mathematics. 306(21). 2670–2681. 18 indexed citations
7.
Honkala, Iiro & Antoine Lobstein. (2003). On Identification in ZZ 2 Using Translates of Given Patterns. JUCS - Journal of Universal Computer Science. 9. 1204–1219. 5 indexed citations
8.
Charon, Irène, Iiro Honkala, Olivier Hudry, & Antoine Lobstein. (2003). The minimum density of an identifying code in the king lattice. Discrete Mathematics. 276(1-3). 95–109. 36 indexed citations
9.
Honkala, Iiro, Mark G. Karpovsky, & Simon Litsyn. (2003). Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. Discrete Applied Mathematics. 129(2-3). 409–419. 9 indexed citations
10.
Honkala, Iiro & Tero Laihonen. (2003). On identification in the triangular grid. Journal of Combinatorial Theory Series B. 91(1). 67–86. 7 indexed citations
11.
Honkala, Iiro, et al.. (2002). On strongly identifying codes. Discrete Mathematics. 254(1-3). 191–205. 32 indexed citations
12.
Honkala, Iiro & Antoine Lobstein. (2002). On the Density of Identifying Codes in the Square Lattice. Journal of Combinatorial Theory Series B. 85(2). 297–306. 23 indexed citations
13.
Honkala, Iiro & Antoine Lobstein. (2002). On Identifying Codes in Binary Hamming Spaces. Journal of Combinatorial Theory Series A. 99(2). 232–243. 32 indexed citations
14.
Honkala, Iiro, et al.. (2001). Bounds on identifying codes. Discrete Mathematics. 241(1-3). 119–128. 49 indexed citations
15.
Honkala, Iiro, et al.. (2001). Short Dominating Paths and Cycles in the Binary Hypercube. Annals of Combinatorics. 5(1). 51–59. 4 indexed citations
16.
Honkala, Iiro. (1998). Combinatorial lower bounds on binary codes with covering radius one.. Ars Combinatoria. 50. 2 indexed citations
17.
Honkala, Iiro. (1994). A New Lower Bound on Codes with Covering Radius One. International Symposium on Information Theory and its Applications. 39. 3 indexed citations
18.
Honkala, Iiro. (1992). On lengthening of covering codes. Discrete Mathematics. 106-107. 291–295. 3 indexed citations
19.
Honkala, Iiro, et al.. (1987). Some lower bounds for constant weight codes. Discrete Applied Mathematics. 18(1). 95–98. 6 indexed citations
20.
Honkala, Iiro, et al.. (1985). A modification of the Zinoviev lower bound for constant weight codes. Discrete Applied Mathematics. 11(3). 307–310. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Tero Laihonen Breakdown of academic impact, for papers by H. van Tilborg Breakdown of academic impact, for papers by Swastik Kopparty Breakdown of academic impact, for papers by Sihem Mesnager Breakdown of academic impact, for papers by Philippe Gaborit Breakdown of academic impact, for papers by Kevin T. Phelps Breakdown of academic impact, for papers by Stephen Suen Breakdown of academic impact, for papers by Nicolas Sendrier Breakdown of academic impact, for papers by Ivan M. Havel Breakdown of academic impact, for papers by Shachar Lovett
Rankless by CCL
2026