Iiro Honkala
- Computer Networks and Communications top 2%
- Electrical and Electronic Engineering top 10%
- Artificial Intelligence top 2%
- Computational Theory and Mathematics top 2%
- Molecular Biology
- Co-authors
- Tero LaihonenAntoine LobsteinSimon LitsynOlivier HudryIrène CharonGérard CohenGilles ZémorMark G. Karpovsky
- Topics
- graph theory and CDMA systems (54 papers)Coding theory and cryptography (50 papers)Cooperative Communication and Network Coding (19 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputer Networks and CommunicationsComputational Theory and Mathematics
In The Last Decade
Iiro Honkala
76 papers receiving 848 citations
Peers
Comparison fields: 5 of 50
- Computer Networks and Communications 542
- Electrical and Electronic Engineering 522
- Artificial Intelligence 519
- Computational Theory and Mathematics 341
- Molecular Biology 171
Countries citing papers authored by Iiro Honkala
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 3 | |
| 2 | 4 | |
| 3 | On Vertex-Robust Identifying Codes of Level Three. | 1 |
| 4 | On 2-edge robust r-identifying codes in the king grid. | 4 |
| 5 | 3 | |
| 6 | 18 | |
| 7 | 5 | |
| 8 | 36 | |
| 9 | 9 | |
| 10 | 7 | |
| 11 | 32 | |
| 12 | 23 | |
| 13 | 32 | |
| 14 | 49 | |
| 15 | 4 | |
| 16 | Combinatorial lower bounds on binary codes with covering radius one. | 2 |
| 17 | A New Lower Bound on Codes with Covering Radius One | 3 |
| 18 | 3 | |
| 19 | 6 | |
| 20 | 3 |
About Iiro Honkala
Iiro Honkala is a scholar working on Discrete Mathematics and Combinatorics, Computer Networks and Communications and Artificial Intelligence, having authored 78 papers that have together received 922 indexed citations. Recurring topics across this work include graph theory and CDMA systems (54 papers), Coding theory and cryptography (50 papers) and Cooperative Communication and Network Coding (19 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (85 citations), Computer Networks and Communications (542 citations) and Computational Theory and Mathematics (341 citations). Iiro Honkala has collaborated with scholars based in Finland, France and Israel. Frequent 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. Their work appears in journals such as IEEE Transactions on Information Theory, SIAM Journal on Computing and American Mathematical Monthly.
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.