2023 - Research.com Computer Science in Norway Leader Award
2022 - Research.com Computer Science in Norway Leader Award
1997 - IEEE Fellow For contributions to coding theory and cryptography.
His main research concerns Discrete mathematics, Combinatorics, Linear code, Finite field and Binary number. Tor Helleseth studies Boolean function which is a part of Discrete mathematics. He interconnects Cyclic code, Reed–Muller code and Ternary operation in the investigation of issues within Combinatorics.
His Linear code study combines topics from a wide range of disciplines, such as Order and Hamming code. His research integrates issues of Power mapping, Permutation, Bent function and Exponential function in his study of Finite field. Tor Helleseth combines subjects such as Point and Coding theory with his study of Binary number.
Tor Helleseth mainly investigates Combinatorics, Discrete mathematics, Finite field, Linear code and Binary number. His Combinatorics research includes elements of Function, Upper and lower bounds and Hamming code. His work investigates the relationship between Discrete mathematics and topics such as Cyclic code that intersect with problems in Polynomial code.
His Finite field research includes themes of Bent function, Permutation, Distribution, Kloosterman sum and Exponential function. The Bent function study combines topics in areas such as Monomial and Quadratic equation. His research investigates the connection with Linear code and areas like Concatenated error correction code which intersect with concerns in Low-density parity-check code.
Tor Helleseth mostly deals with Combinatorics, Discrete mathematics, Finite field, Class and Permutation. His biological study spans a wide range of topics, including Function and Linear code. His research investigates the connection between Discrete mathematics and topics such as Hamming weight that intersect with issues in Distribution.
His work carried out in the field of Finite field brings together such families of science as Asymptotically optimal algorithm, Sequence, Type and Ternary operation. His work focuses on many connections between Class and other disciplines, such as Open problem, that overlap with his field of interest in Characterization, Space and Coding theory. His Permutation research is multidisciplinary, incorporating elements of Trinomial and Unit circle.
His primary areas of study are Combinatorics, Discrete mathematics, Finite field, Permutation and Prime. He has included themes like Sequence, Polynomial and Binary number in his Combinatorics study. His Discrete mathematics research incorporates elements of Expander code and Linear code.
His study in Type extends to Finite field with its themes. He focuses mostly in the field of Permutation, narrowing it down to topics relating to Trinomial and, in certain cases, Class. His Prime study which covers Permutation polynomial that intersects with Generalization.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Advances in Cryptology-Eurocrypt '93
Tor Helleseth.
(1994)
Some results about the cross-correlation function between two maximal linear sequences
Tor Helleseth.
Discrete Mathematics (1976)
Monomial and quadratic bent functions over the finite fields of odd characteristic
T. Helleseth;A. Kholosha.
IEEE Transactions on Information Theory (2006)
Almost difference sets and their sequences with optimal autocorrelation
K.T. Arasu;C. Ding;T. Helleseth;P.V. Kumar.
IEEE Transactions on Information Theory (2001)
An upper bound for some exponential sums over Galois rings and applications
P.V. Kumar;T. Helleseth;A.R. Calderbank.
international symposium on information theory (1994)
New Generalized Cyclotomy and Its Applications
Cunsheng Ding;Tor Helleseth.
Finite Fields and Their Applications (1998)
The weight distribution of irreducible cyclic codes with block lengths n1((q1−1)N)
Tor Helleseth;Torleiv KlØve;Johannes Mykkeltveit.
Discrete Mathematics (1977)
Large families of quaternary sequences with low correlation
P.V. Kumar;T. Helleseth;A.R. Calderbank;A.R. Hammons.
international symposium on information theory (1994)
Several classes of binary sequences with three-level autocorrelation
Cunsheng Ding;T. Helleseth;Kwok Yan Lam.
IEEE Transactions on Information Theory (1999)
Generalized Hamming weights of linear codes
T. Helleseth;T. Klove;O. Ytrehus.
IEEE Transactions on Information Theory (1992)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Hong Kong University of Science and Technology
Southwest Jiaotong University
University of Waterloo
Indian Institute of Science
Paris 8 University
Indian Institute of Science
Seoul National University
Télécom ParisTech
Austrian Academy of Sciences
University of Southern California
Chinese Academy of Sciences
Iowa State University
Kyoto University
Chinese Academy of Sciences
Karlsruhe Institute of Technology
Ohio University - Lancaster
University of Florida
Harvard Medical School
University of North Carolina at Chapel Hill
University of Queensland
Public Health England
University of California, Los Angeles
University of Geneva
University of Pennsylvania
National Institutes of Health
Goethe University Frankfurt