Thomas Honold

37 papers receiving 367 citations

Peers

Thomas Honold
Comparison fields: 5 of 29
  • Discrete Mathematics and Combinatorics 222
  • Artificial Intelligence 363
  • Algebra and Number Theory 35
  • Electrical and Electronic Engineering 322
  • Computer Networks and Communications 135
Replace Ivan Landjev with:
Ivan Landjev Bulgaria
Giorgio Faina Italy
Binzhou Xia Australia
Marko Moisio Finland
Jong Yoon Hyun South Korea
Tatsuya Maruta Japan
Aimo Tietäväinen Finland
Graham H. Norton United Kingdom
Olof Heden Sweden
Heeralal Janwa Puerto Rico
Thomas Honold relative to Ivan Landjev Bulgaria Ivan Landjev's profile →
Citations per field
00.5×1.5×2.4×
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 22 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 38 papers — load more, or switch the sort, to bring in the rest.

#Work
1 199965
2 200148
3
Weighted modules and representations of codes
199841
4
Weighted modules and representations of codes
199933
5 200823
6 200121
7 199920
8 202118
9 199814
10 200914
11 201813
12 200512
13 200110
14 20019
15 20169
16 20117
17 20086
18 20166
19
Safety proof of Combinations of CRC for Industrial Communication
20085
20 20075

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 38 papers that have together received 416 indexed citations. Recurring topics across this work include Coding theory and cryptography (32 papers), graph theory and CDMA systems (19 papers), Finite Group Theory Research (15 papers), Cooperative Communication and Network Coding (11 papers), Advanced Wireless Communication Techniques (6 papers), Error Correcting Code Techniques (5 papers), Cellular Automata and Applications (3 papers) and Advanced Wireless Communication Technologies (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (222 citations), Artificial Intelligence (363 citations), Algebra and Number Theory (35 citations), Electrical and Electronic Engineering (322 citations) and Computer Networks and Communications (135 citations). Thomas Honold has collaborated with scholars based in China, Germany and Bulgaria. Frequent co-authors include Ivan Landjev, A. A. Nechaev, Werner Heise, Sascha Kurz, Marcus Greferath, Eimear Byrne, Shengtian Yang, Frank Schiller, F. I. Solov’eva and Minjia Shi. Their work appears in journals such as IEEE Transactions on Information Theory, Advances in Mathematics of Communications, Designs Codes and Cryptography, The Electronic Journal of Combinatorics and Problems of Information Transmission.

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