Tor Helleseth

9.4k citations
293 papers · 5.4k indexed · h-index 38

Tor Helleseth

276 papers receiving 5.0k citations

Peers

Tor Helleseth
Comparison fields: 5 of 81
  • Discrete Mathematics and Combinatorics 1.0k
  • Artificial Intelligence 4.9k
  • Computational Theory and Mathematics 1.2k
  • Electrical and Electronic Engineering 3.9k
  • Computer Networks and Communications 1.2k
Replace Patrick Solé with:
Patrick Solé France
Cunsheng Ding Hong Kong
P. Vijay Kumar United States
Claude Carlet France
Vera Pless United States
Rudolf Lidl Australia
Victor K. Wei Hong Kong
Ian F. Blake Canada
L. R. Welch United States
D.K. Ray-Chaudhuri United States
Tor Helleseth relative to Patrick Solé France Patrick Solé's profile →
Citations per field
00.5×1.6×
Patrick Solé · 1×
Citations per year

Countries citing papers authored by Tor Helleseth

Since Specialization
Citations

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

Fields of papers citing papers by Tor Helleseth

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network

The 25 scholars most cited alongside Tor Helleseth, 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 Tor Helleseth Line = papers co-authored together Tor Helleseth links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20251
2 20250
3 20242
4 20244
5 20243
6 20240
7 202213
8 20212
9 20212
10 202116
11 202016
12 20116
13
De Bruijn Sequence.
20110
14
Arithmetic of finite fields : third international workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010 : proceedings
20101
15
A general construction of authentication codes
200718
16
Linear complexity over F p of Sidel'nikov sequences.
20042
17
Trace Representation of Lempel-Cohn-Eastman Sequences
20011
18
THE NONEXISTENCE OF SOME TERNARY LINEAR CODES AND UPDATE OF THE BOUNDS FOR n_3 (6, d), 1【less than or equal】d【less than or equal】243
20003
19
Generalized cyclotomic codes of length pe1· · · pet
19998
20 19933

About Tor Helleseth

Tor Helleseth is a scholar working on Discrete Mathematics and Combinatorics, Artificial Intelligence and Computational Theory and Mathematics, having authored 293 papers that have together received 5.4k indexed citations. Recurring topics across this work include Coding theory and cryptography (270 papers), graph theory and CDMA systems (217 papers), Cellular Automata and Applications (62 papers), Finite Group Theory Research (59 papers), Cryptographic Implementations and Security (49 papers), Cooperative Communication and Network Coding (25 papers), Advanced Wireless Communication Techniques (21 papers) and Wireless Communication Networks Research (18 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.0k citations), Artificial Intelligence (4.9k citations) and Computational Theory and Mathematics (1.2k citations). Tor Helleseth has collaborated with scholars based in Norway, China and United States. Frequent co-authors include Cunsheng Ding, Alexander Kholosha, Torleiv Kløve, P. Vijay Kumar, Nian Li, Chunlei Li, Zhengchun Zhou, H.M. Martinsen, Xiangyong Zeng and Victor Zinoviev. Their work appears in journals such as IEEE Transactions on Information Theory, Designs Codes and Cryptography, Discrete Mathematics, Finite Fields and Their Applications and Cryptography and Communications.

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

Rankless by CCL
2026