Tor Helleseth
Orcid: 0000-0003-1290-3541
According to our database1,
Tor Helleseth
authored at least 319 papers
between 1976 and 2024.
Collaborative distances:
Collaborative distances:
Awards
IEEE Fellow
IEEE Fellow 1997, "For contributions to coding theory and cryptography.".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
The Weight Enumerator Polynomials of the Lifted Codes of the Projective Solomon-Stiffler Codes.
IEEE Trans. Inf. Theory, September, 2024
IEEE Trans. Inf. Theory, August, 2024
IEEE Trans. Inf. Theory, July, 2024
Further Investigation on Differential Properties of the Generalized Ness-Helleseth Function.
CoRR, 2024
2023
Cryptogr. Commun., December, 2023
Covering Radius of Generalized Zetterberg Type Codes Over Finite Fields of Odd Characteristic.
IEEE Trans. Inf. Theory, November, 2023
New Results on the -1 Conjecture on Cross-Correlation of m-Sequences Based on Complete Permutation Polynomials.
IEEE Trans. Inf. Theory, June, 2023
The Connections Among Hamming Metric, b-Symbol Metric, and r-th Generalized Hamming Metric.
IEEE Trans. Inf. Theory, April, 2023
J. Comb. Theory A, 2023
Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances.
CoRR, 2023
Adv. Math. Commun., 2023
2022
IEEE Trans. Inf. Theory, 2022
The Differential Spectrum of the Power Mapping x<sup>p<sup>n</sup></sup><sup>-3</sup>.
IEEE Trans. Inf. Theory, 2022
Finite Fields Their Appl., 2022
CoRR, 2022
Cryptogr. Commun., 2022
New Classes of Asymptotically Optimal Spectrally-Constrained Sequences Derived from Cyclotomy.
Adv. Math. Commun., 2022
2021
Three New Constructions of Asymptotically Optimal Periodic Quasi-Complementary Sequence Sets With Small Alphabet Sizes.
IEEE Trans. Inf. Theory, 2021
IEEE Trans. Inf. Theory, 2021
IEEE Trans. Inf. Theory, 2021
The Resolution of Niho's Last Conjecture Concerning Sequences, Codes, and Boolean Functions.
IEEE Trans. Inf. Theory, 2021
Finite Fields Their Appl., 2021
Des. Codes Cryptogr., 2021
CoRR, 2021
Cryptogr. Commun., 2021
2020
Finite Fields Their Appl., 2020
Cryptogr. Commun., 2020
Cryptogr. Commun., 2020
Cryptogr. Commun., 2020
Proceedings of the IEEE International Symposium on Information Theory, 2020
2019
Differential Spectrum of Kasami Power Permutations Over Odd Characteristic Finite Fields.
IEEE Trans. Inf. Theory, 2019
The linear complexity of generalized cyclotomic binary sequences of period p<sup>n</sup>.
Des. Codes Cryptogr., 2019
New permutation trinomials from Niho exponents over finite fields with even characteristic.
Cryptogr. Commun., 2019
Cryptogr. Commun., 2019
Cryptogr. Commun., 2019
2018
IEEE Trans. Inf. Theory, 2018
IEEE Trans. Inf. Theory, 2018
IEEE Trans. Inf. Theory, 2018
IEEE Trans. Inf. Theory, 2018
Des. Codes Cryptogr., 2018
CoRR, 2018
The weight distribution of a class of two-weight linear codes derived from Kloosterman sums.
Cryptogr. Commun., 2018
2017
Generic Construction of Bent Functions and Bent Idempotents With Any Possible Algebraic Degrees.
IEEE Trans. Inf. Theory, 2017
IEEE Trans. Inf. Theory, 2017
J. Syst. Sci. Complex., 2017
Cryptogr. Commun., 2017
2016
IEEE Trans. Inf. Theory, 2016
IEEE Trans. Inf. Theory, 2016
Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials.
IEEE Trans. Inf. Theory, 2016
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
Des. Codes Cryptogr., 2016
Cryptogr. Commun., 2016
Proceedings of the IEEE International Symposium on Information Theory, 2016
2015
Permutation polynomials of the form (x<sup>p<sup>m</sup></sup>-x+δ)<sup>s</sup>+L(x) over the finite field <sub>F</sub><sub>p</sub><sub>2</sub><sub>m</sub> of odd characteristic.
Finite Fields Their Appl., 2015
Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015
Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015
2014
Some Results on Cross-Correlation Distribution Between a \(p\) -Ary \(m\) -Sequence and Its Decimated Sequences.
IEEE Trans. Inf. Theory, 2014
The Properties of a Class of Linear FSRs and Their Applications to the Construction of Nonlinear FSRs.
IEEE Trans. Inf. Theory, 2014
IEEE Trans. Inf. Theory, 2014
IEEE Trans. Inf. Theory, 2014
IEEE Trans. Inf. Theory, 2014
Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping.
IEEE Trans. Inf. Theory, 2014
Cross-Correlation between a <i>p</i>-Ary <i>m</i>-Sequence and Its All Decimated Sequences for d=((p<sup>m</sup>+1)(p<sup>m</sup>+p-1))/(p+1).
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014
Some classes of monomial complete permutation polynomials over finite fields of characteristic two.
Finite Fields Their Appl., 2014
Finite Fields Their Appl., 2014
Des. Codes Cryptogr., 2014
Proceedings of the Arithmetic of Finite Fields - 5th International Workshop, 2014
A Note on Cross-Correlation Distribution Between a Ternary m -Sequence and Its Decimated Sequence.
Proceedings of the Sequences and Their Applications - SETA 2014, 2014
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014
Proceedings of the Open Problems in Mathematics and Computational Science, 2014
2013
IEEE Trans. Inf. Theory, 2013
IEEE Trans. Inf. Theory, 2013
IEEE Trans. Inf. Theory, 2013
Finite Fields Their Appl., 2013
Proceedings of the 2013 Information Theory and Applications Workshop, 2013
Proceedings of the Surveys in Combinatorics 2013, 2013
Correlation and autocorrelation of sequences.
Proceedings of the Handbook of Finite Fields., 2013
2012
IEEE Trans. Inf. Theory, 2012
IEEE Trans. Inf. Theory, 2012
IEEE Trans. Inf. Theory, 2012
Proceedings of the Sequences and Their Applications - SETA 2012, 2012
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
2011
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011
Generic Construction of Quaternary Sequences of Period 2N With Low Correlation From Quaternary Sequences of Odd Period N.
IEEE Trans. Inf. Theory, 2011
IEEE Trans. Inf. Theory, 2011
Several Classes of Codes and Sequences Derived From a $\BBZ_{4}$-Valued Quadratic Form.
IEEE Trans. Inf. Theory, 2011
IEEE Trans. Inf. Theory, 2011
Int. J. Found. Comput. Sci., 2011
Crosscorrelation of m-sequences, exponential sums, bent functions and Jacobsthal sums.
Cryptogr. Commun., 2011
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011
Proceedings of the 2011 IEEE Information Theory Workshop, 2011
Proceedings of the Information Theory and Applications Workshop, 2011
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
2010
IEEE Trans. Inf. Theory, 2010
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010
x<sup>2<sup>l</sup>+1</sup>+x+a and related affine polynomials over GF (2<sup><i>k</i></sup>).
Cryptogr. Commun., 2010
Proceedings of the Sequences and Their Applications - SETA 2010, 2010
Proceedings of the Information Theory and Applications Workshop, 2010
Proceedings of the IEEE International Symposium on Information Theory, 2010
2009
Proceedings of the Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, 2009
IEEE Trans. Inf. Theory, 2009
IEEE Trans. Inf. Theory, 2009
IEEE Trans. Inf. Theory, 2009
IEEE Trans. Inf. Theory, 2009
IEEE Trans. Inf. Theory, 2009
IACR Cryptol. ePrint Arch., 2009
A new optimal quaternary sequence family of length 2(2<sup><i>n</i></sup> - 1) obtained from the orthogonal transformation of Families <i>B</i> and <i>C</i>.
Des. Codes Cryptogr., 2009
Proceedings of the IEEE International Symposium on Information Theory, 2009
2008
Proceedings of the New Stream Cipher Designs - The eSTREAM Finalists, 2008
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008
IEEE Trans. Inf. Theory, 2008
SIAM J. Discret. Math., 2008
Finite Fields Their Appl., 2008
CoRR, 2008
Proceedings of the Sequences and Their Applications, 2008
m-Sequences of Lengths 2<sup>2k</sup>-1 and 2<sup>k</sup>-1 with at Most Four-Valued Cross Correlation.
Proceedings of the Sequences and Their Applications, 2008
Proceedings of the Sequences and Their Applications, 2008
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008
Divisibility properties of Kloosterman sums over finite fields of characteristic two.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008
2007
A New Family of Four-Valued Cross Correlation Between m-Sequences of Different Lengths.
IEEE Trans. Inf. Theory, 2007
IEEE Trans. Inf. Theory, 2007
Characterization of m-Sequences of Lengths 2<sup>2k</sup>-1 and 2<sup>k</sup>-1 With Three-Valued Cross Correlation.
IEEE Trans. Inf. Theory, 2007
IEEE Trans. Inf. Theory, 2007
The divisibility modulo 24 of Kloosterman sums on <i>GF</i>(2<sup><i>m</i></sup>), <i>m</i> odd.
J. Comb. Theory A, 2007
Finite Fields Their Appl., 2007
Finite Fields Their Appl., 2007
Characterization of m-Sequences of Lengths $2^{2k}-1$ and $2^k-1$ with Three-Valued Crosscorrelation
CoRR, 2007
Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007
Proceedings of the Sequences, Subsequences, and Consequences, International Workshop, 2007
Proceedings of the Sequences, Subsequences, and Consequences, International Workshop, 2007
Proceedings of the Sequences, Subsequences, and Consequences, International Workshop, 2007
Proceedings of the Sequences, Subsequences, and Consequences, International Workshop, 2007
Proceedings of the IEEE International Symposium on Information Theory, 2007
Proceedings of the Applied Algebra, 2007
2006
IEEE Trans. Inf. Theory, 2006
IEEE Trans. Inf. Theory, 2006
IEEE Trans. Inf. Theory, 2006
IEEE Trans. Inf. Theory, 2006
IEEE Trans. Inf. Theory, 2006
Proceedings of the Sequences and Their Applications, 2006
On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006
2005
Proceedings of the Encyclopedia of Cryptography and Security, 2005
Proceedings of the Encyclopedia of Cryptography and Security, 2005
Proceedings of the Encyclopedia of Cryptography and Security, 2005
Proceedings of the Encyclopedia of Cryptography and Security, 2005
Proceedings of the Encyclopedia of Cryptography and Security, 2005
IEEE Trans. Inf. Theory, 2005
New cyclic relative difference sets constructed from d-homogeneous functions with difference-balanced property.
IEEE Trans. Inf. Theory, 2005
On Cosets of Weight 4 of Binary BCH Codes with Minimum Distance 8 and Exponential Sums.
Probl. Inf. Transm., 2005
Finite Fields Their Appl., 2005
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
2004
New Family of p-ary Sequences With Optimal Correlation Property and Large Linear Span.
IEEE Trans. Inf. Theory, 2004
IEEE Trans. Inf. Theory, 2004
IEEE Trans. Inf. Theory, 2004
J. Complex., 2004
On a new identity for Kloosterman sums and nonlinear system of equations over finite fields of characteristic 2.
Discret. Math., 2004
An Assmus-Mattson-Type Approach for Identifying 3-Designs from Linear Codes over Z<sub>4</sub>.
Des. Codes Cryptogr., 2004
Des. Codes Cryptogr., 2004
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators.
Proceedings of the Advances in Cryptology, 2004
2003
Linear complexity over F<sub>p</sub> and trace representation of Lempel-Cohn-Eastman sequences.
IEEE Trans. Inf. Theory, 2003
3-Designs from the <i>Z</i><sub>4</sub>-Goethals Codes via a New Kloosterman Sum Identity.
Des. Codes Cryptogr., 2003
Des. Codes Cryptogr., 2003
A coset weight count that proves that the simplex codes are not optimal for error correction.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003
Proceedings of the Cryptography and Coding, 2003
Proceedings of the Cryptography and Coding, 2003
2002
IEEE Trans. Inf. Theory, 2002
IEEE Trans. Inf. Theory, 2002
2001
New construction for binary sequences of period p<sup>m</sup>-1 with Optimal autocorrelation using (z+1)<sup>d</sup>+az<sup>d</sup>+b.
IEEE Trans. Inf. Theory, 2001
IEEE Trans. Inf. Theory, 2001
Codes with the same coset weight distributions as the Z<sub>4</sub>-linear Goethals codes.
IEEE Trans. Inf. Theory, 2001
Ternary m-sequences with three-valued cross-correlation function: New decimations of Welch and Niho type.
IEEE Trans. Inf. Theory, 2001
IEEE Trans. Inf. Theory, 2001
IEEE Trans. Inf. Theory, 2001
Electron. Notes Discret. Math., 2001
5-Designs from the lifted Golay code over Z<sub>4</sub> via an Assmus-Mattson type approach.
Discret. Math., 2001
A New Family of Ternary Sequences with Ideal Two-level Autocorrelation Function.
Des. Codes Cryptogr., 2001
Proceedings of the Sequences and their Applications, 2001
On the Crosscorrelation of m-Sequences and Related Sequences with Ideal Autocorrelation.
Proceedings of the Sequences and their Applications, 2001
Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001
2000
On a conjectured ideal autocorrelation sequence, a related triple-error correcting cyclic code.
IEEE Trans. Inf. Theory, 2000
1999
IEEE Trans. Inf. Theory, 1999
IEEE Trans. Inf. Theory, 1999
Further Results on Generalized Hamming Weights for Goethals and Preparata Codes Over Z<sub>4</sub>.
IEEE Trans. Inf. Theory, 1999
IEEE Trans. Inf. Theory, 1999
Generalized Cyclotomic Codes of Length p<sub>1</sub><sup>e<sup>1</sup></sup> ... p<sub>t</sub><sup>e<sup>t</sup></sup>.
IEEE Trans. Inf. Theory, 1999
Discret. Math., 1999
Des. Codes Cryptogr., 1999
1998
IEEE Trans. Inf. Theory, 1998
Des. Codes Cryptogr., 1998
Des. Codes Cryptogr., 1998
Proceedings of the Sequences and their Applications, 1998
Proceedings of the Sequences and their Applications, 1998
1997
IEEE Trans. Inf. Theory, 1997
IEEE Trans. Inf. Theory, 1997
Appl. Algebra Eng. Commun. Comput., 1997
Appl. Algebra Eng. Commun. Comput., 1997
1996
IEEE Trans. Inf. Theory, 1996
IEEE Trans. Inf. Theory, 1996
Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences.
IEEE Trans. Inf. Theory, 1996
IEEE Trans. Inf. Theory, 1996
Improved estimates via exponential sums for the minimum distance of Z<sub>4</sub>-linear trace codes.
IEEE Trans. Inf. Theory, 1996
IEEE Trans. Inf. Theory, 1996
Codes with the Same Weight Distributions as the Goethals Codes and the Delsarte-Goethals Codes.
Des. Codes Cryptogr., 1996
Proceedings of the Advances in Cryptology, 1996
1995
IEEE Trans. Inf. Theory, 1995
IEEE Trans. Inf. Theory, 1995
A characterization of some {3v<sub>µ+1</sub>, 3v<sub>µ</sub>; k-1, q}-minihypers and some [n, k, q<sup>k-1</sup> - 3q<sup>µ</sup>; q]-codes (k >= 3, q >= 5, 1 <= µ < k-1) meeting the Griesmer bound.
Discret. Math., 1995
1994
IEEE Trans. Inf. Theory, 1994
IEEE Trans. Inf. Theory, 1994
1993
Characterization of {2(q+1)+2, 2;t, q}-minihypers in PG(t, q) (t>=3, qepsilon{3, 4}).
Discret. Math., 1993
Discret. Appl. Math., 1993
Proceedings of the Error Control, Cryptology, and Speech Compression, 1993
1992
A characterization of some {2u<sub>alpha+1</sub>+u<sub>gamma+1</sub>, 2u<sub>alpha</sub>+u<sub>gamma</sub>; k-1, 3}- minihypers and some (n, k, 3<sup>k-1</sup> -2·3<sup>alpha</sup>-3<sup>gamma</sup>; 3)-codes (k>=3, 0<=alpha<gamma<k-1) meeting the Griesmer bound.
Discret. Math., 1992
On the Construction of [q<sup>4</sup> + q<sup>2</sup> - q, 5, q<sup>4</sup> - q<sup>3</sup> + q<sup>2</sup> - 2q; q]-Codes Meeting the Griesmer Bound.
Des. Codes Cryptogr., 1992
1991
IEEE Trans. Inf. Theory, 1991
1990
Eur. J. Comb., 1990
1987
1985
Discret. Appl. Math., 1985
1984
IEEE Trans. Inf. Theory, 1984
1983
1981
1979
No primitive binary t -error-correcting BCH code with t > 2 is quasi-perfect (Corresp.).
IEEE Trans. Inf. Theory, 1979
The weight distribution of the coset leaders for some classes of codes with related parity-check matrices.
Discret. Math., 1979
1978
All binary 3-error-correcting BCH codes of length 2<sup>m-i</sup> have covering radius 5 (Corresp.).
IEEE Trans. Inf. Theory, 1978
A note on the cross-correlation function between two binary maximal length linear sequences.
Discret. Math., 1978
1977
The weight distribution of irreducible cyclic codes with block lengths n<sub>1</sub>((q<sup>1</sup>-1)/N).
Discret. Math., 1977
The weight enumerator polynomials of some classes of codes with composite parity-check polynomials.
Discret. Math., 1977
1976
IEEE Trans. Inf. Theory, 1976
Some results about the cross-correlation function between two maximal linear sequences.
Discret. Math., 1976