Thomas Honold

798 total citations
33 papers, 341 citations indexed

About

Thomas Honold is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Thomas Honold has authored 33 papers receiving a total of 341 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Artificial Intelligence, 24 papers in Electrical and Electronic Engineering and 14 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Thomas Honold's work include Coding theory and cryptography (27 papers), graph theory and CDMA systems (16 papers) and Finite Group Theory Research (13 papers). Thomas Honold is often cited by papers focused on Coding theory and cryptography (27 papers), graph theory and CDMA systems (16 papers) and Finite Group Theory Research (13 papers). Thomas Honold collaborates with scholars based in China, Germany and Bulgaria. Thomas Honold's co-authors include Ivan Landjev, A. A. Nechaev, Werner Heise, Eimear Byrne, Marcus Greferath, Shengtian Yang, Sascha Kurz, F. I. Solov’eva, Patrick Solé and Minjia Shi and has published in prestigious journals such as IEEE Transactions on Information Theory, Discrete Mathematics and Designs Codes and Cryptography.

In The Last Decade

Thomas Honold

32 papers receiving 295 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Thomas Honold China	11	302	267	190	107	30	33	341
Ivan Landjev Bulgaria	12	318 1.1×	253 0.9×	199 1.0×	103 1.0×	28 0.9×	47	359
Marko Moisio Finland	10	242 0.8×	141 0.5×	65 0.3×	83 0.8×	30 1.0×	16	254
Klaus Metsch Germany	12	342 1.1×	293 1.1×	419 2.2×	41 0.4×	30 1.0×	87	509
Olof Heden Sweden	10	299 1.0×	277 1.0×	160 0.8×	72 0.7×	6 0.2×	50	338
Jong Yoon Hyun South Korea	9	287 1.0×	231 0.9×	78 0.4×	89 0.8×	14 0.5×	29	313
Binzhou Xia Australia	8	116 0.4×	130 0.5×	151 0.8×	58 0.5×	31 1.0×	40	242
Graham H. Norton United Kingdom	8	332 1.1×	208 0.8×	112 0.6×	66 0.6×	40 1.3×	17	363
Denis S. Krotov Russia	8	184 0.6×	194 0.7×	89 0.5×	62 0.6×	6 0.2×	51	231
Aimo Tietäväinen Finland	9	221 0.7×	172 0.6×	80 0.4×	59 0.6×	21 0.7×	22	257
Kangquan Li China	12	319 1.1×	235 0.9×	76 0.4×	28 0.3×	8 0.3×	36	334

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-authorship network of co-authors of Thomas Honold

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Honold. A scholar is included among the top collaborators of Thomas Honold 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 Thomas Honold. Thomas Honold is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Shi, Minjia, et al.. (2021). The Geometry of Two-Weight Codes Over ℤ_p^m. IEEE Transactions on Information Theory. 67(12). 7769–7781. 17 indexed citations

Honold, Thomas & Ivan Landjev. (2021). On homogeneous arcs and linear codes over finite chain rings. Applicable Algebra in Engineering Communication and Computing. 34(3). 359–375. 1 indexed citations

Honold, Thomas, et al.. (2017). Upper bounds for partial spreads from divisible codes. 1 indexed citations

Yang, Shengtian, Thomas Honold, Yan Chen, Zhaoyang Zhang, & Peiliang Qiu. (2014). Constructing Linear Encoders With Good Spectra. IEEE Transactions on Information Theory. 60(10). 5950–5965. 1 indexed citations

Lv, Xiaomin, et al.. (2012). A sieving method for the optimization of embedded CRC codes. 16. 560–566. 1 indexed citations

Honold, Thomas & Ivan Landjev. (2012). Non-free extensions of the simplex codes over a chain ring with four elements. Designs Codes and Cryptography. 66(1-3). 27–38. 1 indexed citations

Honold, Thomas, et al.. (2012). The existence of maximal (q 2, 2)-arcs in projective Hjelmslev planes over chain rings of length 2 and odd prime characteristic. Designs Codes and Cryptography. 68(1-3). 105–126. 1 indexed citations

Yang, Shengtian, Thomas Honold, Yan Chen, Zhaoyang Zhang, & Peiliang Qiu. (2011). Weight Distributions of Regular Low-Density Parity-Check Codes Over Finite Fields. IEEE Transactions on Information Theory. 57(11). 7507–7521. 7 indexed citations

Yang, Zhimin, Shiju Li, Hao Feng, Thomas Honold, & Guanding Yu. (2009). Cross-Layer Iterative Decoding of Irregular LDPC Codes using Cyclic Redundancy Check Codes. 1–6. 4 indexed citations

10.

Schiller, Frank, et al.. (2008). Safety proof of Combinations of CRC for Industrial Communication. 16. 15–32. 5 indexed citations

11.

Yang, Shengtian, Yan Chen, Thomas Honold, Zhaoyang Zhang, & Peiliang Qiu. (2008). Constructing linear codes with good joint spectra. 926–931. 1 indexed citations

12.

Byrne, Eimear, Marcus Greferath, & Thomas Honold. (2008). Ring geometries, two-weight codes, and strongly regular graphs. Designs Codes and Cryptography. 48(1). 1–16. 22 indexed citations

13.

Honold, Thomas & Ivan Landjev. (2006). Caps in projective Hjelmslev spaces over finitechain rings of nilpotency index 2. Project Euclid (Cornell University). 4(1). 13–25. 2 indexed citations

14.

Honold, Thomas & Ivan Landjev. (2005). On maximal arcs in projective Hjelmslev planes over chain rings of even characteristic. Finite Fields and Their Applications. 11(2). 292–304. 11 indexed citations

15.

Honold, Thomas & Ivan Landjev. (2001). On arcs in projective Hjelmslev planes. Discrete Mathematics. 231(1-3). 265–278. 20 indexed citations

16.

Landjev, Ivan & Thomas Honold. (2001). Arcs in projective Hjelmslev planes. Discrete Mathematics and Applications. 11(1). 9 indexed citations

17.

Honold, Thomas & A. A. Nechaev. (1999). Weighted modules and representations of codes. Problems of Information Transmission. 35(3). 205–223. 30 indexed citations

18.

Honold, Thomas & Ivan Landjev. (1999). Linearly representable codes over chain rings. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 69(1). 187–203. 17 indexed citations

19.

Heise, Werner, Thomas Honold, & A. A. Nechaev. (1998). Weighted modules and representations of codes. 123–129. 36 indexed citations

20.

Honold, Thomas. (1996). A proof of MacWilliams' identity. Journal of Geometry. 57(1-2). 120–122. 2 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