Thomas Honold

32 papers receiving 295 citations

Peers

Thomas Honold
Comparison fields: 5 of 21
  • Discrete Mathematics and Combinatorics 190
  • Artificial Intelligence 302
  • Algebra and Number Theory 30
  • Computer Networks and Communications 107
  • Electrical and Electronic Engineering 267
Replace Ivan Landjev with:
Ivan Landjev Bulgaria
Jong Yoon Hyun South Korea
Graham H. Norton United Kingdom
Marko Moisio Finland
Olof Heden Sweden
Carlos Munuera Spain
Giorgio Faina Italy
Michel Lavrauw Italy
Rocco Trombetti Italy
Siu Lun Singapore
Thomas Honold relative to Ivan Landjev Bulgaria Ivan Landjev's profile →
Citations per field
00.5×2.6×
Ivan Landjev · 1×
Citations per year

Countries citing papers authored by Thomas Honold

Since Specialization
Citations

This map shows the geographic impact of Thomas Honold'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 Thomas Honold with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Honold more than expected).

Fields of papers citing papers by Thomas Honold

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Thomas Honold. 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 Thomas Honold. The network helps show where Thomas Honold may publish in the future.

Co-authors

The 21 scholars most cited alongside Thomas Honold, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Thomas Honold Line = papers co-authored together Thomas Honold links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 33 papers — load more, or switch the sort, to bring in the rest.

#Work
1 199959
2 200143
3
Weighted modules and representations of codes
199836
4
Weighted modules and representations of codes
199930
5 200822
6 200120
7 202117
8 199917
9 200914
10 200511
11 199811
12 20019
13 20117
14
Safety proof of Combinations of CRC for Industrial Communication
20085
15 19995
16 20165
17 20094
18 20143
19 20113
20 20193

About Thomas Honold

Thomas Honold is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics, Computer Networks and Communications and Computational Theory and Mathematics, having authored 33 papers that have together received 341 indexed citations. Recurring topics across this work include Coding theory and cryptography (27 papers), graph theory and CDMA systems (16 papers), Finite Group Theory Research (13 papers), Cooperative Communication and Network Coding (9 papers), Error Correcting Code Techniques (5 papers), Advanced Wireless Communication Techniques (5 papers), Advanced Wireless Communication Technologies (3 papers) and Quantum-Dot Cellular Automata (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (190 citations), Artificial Intelligence (302 citations), Algebra and Number Theory (30 citations), Computer Networks and Communications (107 citations) and Electrical and Electronic Engineering (267 citations). Thomas Honold has collaborated with scholars based in China, Germany and Bulgaria. Frequent co-authors include Ivan Landjev, A. A. Nechaev, Werner Heise, Eimear Byrne, Marcus Greferath, Sascha Kurz, Shengtian Yang, Minjia Shi, F. I. Solov’eva and Patrick Solé. Their work appears in journals such as IEEE Transactions on Information Theory, Designs Codes and Cryptography, Advances in Mathematics of Communications, The Electronic Journal of Combinatorics and Finite Fields and Their Applications.

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