Prof. Tor Helleseth

List of Publications



Home

List of publications

List of coauthors

PhD students

Projects

Conferences

Invited Talks

Awards & Honors

Contact details

Complete list of publications together with the list of coathors as a pdf is here.

All the publications are divided into the following categories:

(Last update: September 2019)

    Edited Books, Proceedings and Journal Special Issues


  1. Lilya Budaghyan, Claude Carlet and Tor Helleseth, Editorial: Special Issue on Boolean functions and their applications. Cryptography and Communications, volume 11(1): 1-2 (2019).

  2. Tor Helleseth and Bart Preneel. Editorial: Special issue on recent trends in cryptography. Cryptography and Communications, volume 10(1): 1-3 (2018).

  3. Lilya Budaghyan, Tor Helleseth and Alexander Kholosha, Editorial: Special issue on Boolean functions and their applications. Cryptography and Communications, volume 8(2): 173-174 (2016).

  4. Lilya Budaghyan, Tor Helleseth and Matthew G. Parker, Editorial: special issue on coding and cryptography. Des. Codes Cryptogr. volume 73(2): 269 (2014).

  5. Tor Helleseth and Jonathan Jedwab, Special issue editorial: Sequences and their applications, Cryptography and Communications, volume 6(1): 1-2 (2014).

  6. Tor Helleseth and Jonathan Jedwab, eds., Sequences and Their Applications - SETA 2012, Lecture Notes in Computer Science, volume 7280, Springer-Verlag, Berlin, 2012.

  7. M. Anwar Hasan and Tor Helleseth, eds., Arithmetic of Finite Fields, Lecture Notes in Computer Science, volume 6087, Springer-Verlag, Berlin, 2010.

  8. Otokar Grosek, Tor Helleseth, Alexander Kholosha, and Karol Nemoga, eds., NILCRYPT '10, Tatra Mountains Mathematical Publications, volume 45, Mathematical Institute, Slovak Academy of Sciences, Bratislava, 2010.

  9. Solomon Golomb, Guang Gong, Tor Helleseth, and Hong-Yeop Song, eds., Sequences, Subsequences, and Consequences, Lecture Notes in Computer Science, volume 4893, Springer-Verlag, Berlin, 2007.

  10. Tor Helleseth, P. Vijay Kumar, and Øyvind Ytrehus, eds., Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, IEEE, July 2007.

  11. Guang Gong, Tor Helleseth, Hong-Yeop Song, and Kyeongcheol Yang, eds., Sequences and Their Applications - SETA 2006, Lecture Notes in Computer Science, volume 4086, Springer-Verlag, Berlin, 2006.

  12. Tor Helleseth, Dilip Sarwate, Hong-Yeop Song, and Kyeongcheol Yang, eds., Sequences and Their Applications - SETA 2004, Lecture Notes in Computer Science, volume 3486, Springer-Verlag, Berlin, 2005.

  13. Jong-Seon No, Hong-Yeop Song, Tor Helleseth, and P. Vijay Kumar, eds., Mathematical Properties of Sequences and other Combinatorial Structures, The Kluwer International Series in Engineering and Computer Science, Kluwer Academic Publishers, Dordrecht, 2003.

  14. Tor Helleseth, P. Vijay Kumar, and Kyeongcheol Yang, eds.,Sequences and Their Applications - SETA '01, Discrete Mathematics and Theoretical Computer Science, Springer-Verlag, Berlin, 2002.

  15. Cunsheng Ding, Tor Helleseth, and Harald Niederreiter, eds., Sequences and Their Applications, Discrete Mathematics and Theoretical Computer Science, Springer-Verlag, Berlin, 1999.

  16. Alexander Pott, P. Vijay Kumar, Tor Helleseth, and Dieter Jungnickel, eds., Difference Sets, Sequences and their Correlation Properties, NATO Science Series, Series C: Mathematical and Physical Sciences, volume 542, Kluwer Academic Publishers, Dordrecht, 1999.

  17. Tor Helleseth, ed., Advances in Cryptology - EUROCRYPT '93, Lecture Notes in Computer Science, volume 765, Springer-Verlag, Berlin, 1994.

    18. Back to top


    Chapters in Books

  18. T. Helleseth, Open Problems on the Cross-correlation of m-Sequences, in: Open Problems in Mathematics and Computational Science, Koç Ç. Eds. Springer, Cham, pp. 163-179, 2014.

  19. T. Helleseth, Correlation and autocorrelation of sequences, in: Handbook of Finite Fields, G. L. Mullen and D. Panario Eds., ser: Discrete Mathematics and its Applications, CRC Press, ch. 10.3, pp. 317-324, 2013.

  20. T. Helleseth and A. Kholosha, Bent functions and their connections to combinatorics, in: Surveys in Combinatorics 2013, Simon R. Blackburn and Stefanie Gerke and Mark Wildon Eds., ser: London Mathematical Society Lecture Note Series, vol. 409, pp. 91-126, Cambridge University Press, 2013.

  21. T. Helleseth, Autocorrelation, in: Encyclopedia of Cryptography and Security, 2nd ed., H.C. van Tilborg and S.Jajodia, Eds., pp. 68-68, Berlin: Springer-Verlag, 2011.

  22. Tor Helleseth and Torleiv Kløve, Algebraic coding theory, in: Benjamin W. Wah, ed., Wiley Encyclopedia of Computer Science and Engineering, volume 1, pp. 80-94, John Wiley & Sons, Inc., Chichester, 2009.

  23. Gagan Garg, Tor Helleseth, and P. Vijay Kumar, Recent advances in low-correlation sequences, in: Vahid Tarokh, ed., New Directions in Wireless Communications Research, chapter 3, pp. 63-92, Springer-Verlag, Berlin, 2009.

  24. Tor Helleseth, Sequence correlation, in: Charles J. Colbourn and Jeffrey H. Dinitz, eds., Handbook of Combinatorial Designs, Discrete Mathematics and its Applications, chapter 7, pp. 313-317, Chapman & Hall/CRC, London, second edition, 2007.

  25. Tor Helleseth, Optical orthogonal codes, in: Charles J. Colbourn and Jeffrey H. Dinitz, eds., Handbook of Combinatorial Designs, Discrete Mathematics and its Applications, chapter 9, pp. 321-322, Chapman & Hall/CRC, London, second edition, 2007.

  26. Tor Helleseth, Auto correlation, in: Henk C.A. van Tilborg, ed., Encyclopedia of Cryptography and Security, pp. 27-27, Springer-Verlag, Berlin, 2005.

  27. Tor Helleseth, Cross correlation, in: Henk C.A. van Tilborg, ed., Encyclopedia of Cryptography and Security, pp. 113-113, Springer-Verlag, Berlin, 2005.

  28. Tor Helleseth, De Bruijn sequence, in: Henk C.A. van Tilborg, ed., Encyclopedia of Cryptography and Security, pp. 138-140, Springer-Verlag, Berlin, 2005.

  29. Tor Helleseth, Gap, in: Henk C.A. van Tilborg, ed., Encyclopedia of Cryptography and Security, pp. 239-239, Springer-Verlag, Berlin, 2005.

  30. Tor Helleseth, Golomb's randomness postulates, in: Henk C.A. van Tilborg, ed., Encyclopedia of Cryptography and Security, pp. 242-242, Springer-Verlag, Berlin, 2005.

  31. Tor Helleseth, Maximal-length linear sequence, in: Henk C.A. van Tilborg, ed., Encyclopedia of Cryptography and Security, pp. 372-375, Springer-Verlag, Berlin, 2005.

  32. Tor Helleseth, Pseudo-noise sequence (PN-sequence), in: Henk C.A. van Tilborg, ed., Encyclopedia of Cryptography and Security, pp. 483-483, Springer-Verlag, Berlin, 2005.

  33. Tor Helleseth, Run, in: Henk C.A. van Tilborg, ed., Encyclopedia of Cryptography and Security, pp. 539-539, Springer-Verlag, Berlin, 2005.

  34. Tor Helleseth, Sequences, in: Henk C.A. van Tilborg, ed., Encyclopedia of Cryptography and Security, pp. 560-563, Springer-Verlag, Berlin, 2005.

  35. Tor Helleseth and P. Vijay Kumar, Pseudonoise sequences, in: Jerry D. Gibson, ed., The Communications Handbook, chapter 8, pp. 8-1-8-12, CRC Press, London, second edition, 2002.

  36. Tor Helleseth and P. Vijay Kumar, Pseudonoise sequences, in: Jerry D. Gibson, ed., The Mobile Communications Handbook, The electrical engineering handbook series, chapter 8, CRC Press, London, second edition, 1999.

  37. Tor Helleseth and Torleiv Kløve, Algebraic coding theory, in: John G. Webster, ed., Wiley Encyclopedia of Electrical and Electronics Engineering, volume 1, pp. 402-415, John Wiley & Sons, Inc., Chichester, 1999.

  38. Tor Helleseth and P. Vijay Kumar, Sequences with low correlation, in: Vera S. Pless and W. Cary Huffman, eds., Handbook in Coding Theory, volume II, chapter 21, pp. 1765-1853, Elsevier Science B.V., Amsterdam, 1998.

    39. Back to top


    Papers in journals and proceedings

    2019

    Papers in Journals

  39. V. Edemskiy and C. Li and X. Zeng and T. Helleseth,  The linear complexity of generalized cyclotomic binary sequences of period pn, Des. Codes and Cryptography, volumn(87),  pp. 1183-1197, 2019.

  40. N. Li and T. Helleseth,  New permutation trinomials from Niho exponents over finite fields with even characteristic, Cryptography and Communications, volumn(11),  pp. 129-136, 2019.

    41. Back to top

    2018

    Papers in Journals

  41. Z. Zhou and D. Zhang and T. Helleseth and J. Wen,  A Construction of Multiple Optimal ZCZ Sequence Sets With Good Cross Correlation, IEEE Trans. Information Theory, volumn(64),  pp. 1340-1346, 2018.

  42. G. Gong and T. Helleseth and P. V. Kumar,  Solomon W. Golomb - Mathematician, Engineer, and Pioneer, IEEE Trans. Information Theory, volumn(64),  pp. 2844-2857, 2018.

  43. Z. Zhou and T. Helleseth and U. Parampalli,  A Family of Polyphase Sequences With Asymptotically Optimal Correlation, IEEE Trans. Information Theory, volumn(64),  pp. 2896-2900, 2018.

  44. L. Budaghyan and C. Carlet and T. Helleseth and N. Li and B. Sun,  On Upper Bounds for Algebraic Degrees of APN Functions, IEEE Trans. Information Theory, volumn(64),  pp. 4399-4411, 2018.

  45. P. Tan and Z. Zhou and D. Tang and T. Helleseth,  The weight distribution of a class of two-weight linear codes derived from Kloosterman sums, Cryptography and Communications, volumn(10),  pp. 291-299, 2018.

  46. Z. Xiao and X. Zeng and C. Li and T. Helleseth,  New generalized cyclotomic binary sequences of period p2, Des. Codes and Cryptography, volumn(86),  pp. 1483-1497, 2018.

  47. X. Xu and C. Li and X. Zeng and T. Helleseth,  Constructions of complete permutation polynomials, Des. Codes and Cryptography, volumn(86),  pp. 2869-2892, 2018.

  48. Z. Tu and X. Zeng and T. Helleseth,  A class of permutation quadrinomials, Discrete Mathematics, volumn(341),  pp. 3010-3020, 2018.

  49. Z. Tu and X. Zeng and T. Helleseth,  New permutation quadrinomials over GF(22m), Finite Fields and Their Applications, volumn(50),  pp. 304-318, 2018.

  50. Z. Tu and X. Zeng and C. Li and T. Helleseth,  A class of new permutation trinomials, Finite Fields and Their Applications, volumn(50),  pp. 178-195, 2018.

    51. Back to top

    2017

    Papers in journals

  51. C. Tang and Z. Zhou and Y. Qi and X. Zhang and C. Fan and T. Helleseth,  Generic Construction of Bent Functions and Bent Idempotents With Any Possible Algebraic Degrees, IEEE Trans. Information Theory, volumn(63),  pp. 6149-6157, 2017.

  52. Z. Sun and X. Zeng and C. Li and T. Helleseth,  Investigations on Periodic Sequences With Maximum Nonlinear Complexity, IEEE Trans. Information Theory, volumn(63),  pp. 6188-6198, 2017.

  53. Y. Xia and N. Li and X. Zeng and T. Helleseth,  On the Correlation Distribution for a Niho Decimation, IEEE Trans. Information Theory, volumn(63),  pp. 7206-7218, 2017.

  54. N. Li and T. Helleseth,  Several classes of permutation trinomials from Niho exponents, Cryptography and Communications, volumn(9),  pp. 693-705, 2017.

  55. A. Alahmadi and H. Alhazmi and S. Ali and T. Helleseth and R. Hijazi and C. Li and P. Sole,  An analogue of the Z4-Goethals code in non-primitive length, J. Systems Science and Complexity, volumn(30),  pp. 950-966, 2017.

    56. 2016

    Papers in journals


  56. C. Li and X. Zeng and C. Li and T. Helleseth and M. Li,  Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials, IEEE Trans. Information Theory, volumn(62),  pp. 610-624, 2016.

  57. C. Tang and N. Li and Y. Qi and Z. Zhou and T. Helleseth,  Linear Codes With Two or Three Weights From Weakly Regular Bent Functions, IEEE Trans. Information Theory, volumn(62),  pp. 1166-1176, 2016.

  58. L. Budaghyan and A. Kholosha and C. Carlet and T. Helleseth,  Univariate Niho Bent Functions From o-Polynomials, IEEE Trans. Information Theory, volumn(62),  pp. 2254-2265, 2016.

  59. Y. Xia and N. Li and X. Zeng and T. Helleseth,  An Open Problem on the Distribution of a Niho-Type Cross-Correlation Function, IEEE Trans. Information Theory, volumn(62),  pp. 7546-7554, 2016.

  60. A. Alahmadi and H. Alhazmi and T. Helleseth and R. Hijazi and N. M. Muthana and P. Sole,  On the lifted Melas code, Cryptography and Communications, volumn(8),  pp. 7-18, 2016.

  61. C. Li and T. Helleseth,  Quasi-perfect linear codes from planar and APN functions, Cryptography and Communications, volumn(8),  pp. 215-227, 2016.

  62. A. Alahmadi and H. Alhazmi and T. Helleseth and R. Hijazi and N. M. Muthana and P. Sole,  On the lifted Zetterberg code, Des. Codes and Cryptography, volumn(80),  pp. 561-576, 2016.

  63. Z. Zhou and N. Li and C. Fan and T. Helleseth,  Linear codes with two or three weights from quadratic Bent functions, Des. Codes and Cryptography, volumn(81),  pp. 283-295, 2016.

    64. Papers in Conferences

  64. T. Helleseth and A. Kholosha,  New ternary binomial bent functions,  in: Proceeding of the IEEE International Symposium on Information Theory, pp. 101-104, IEEE, 2016.

  65. L. Budaghyan and C. Carlet and T. Helleseth and N. Li,  On the (non-)existence of APN (n, n)-functions of algebraic degree n,  in: Proceeding of the IEEE International Symposium on Information Theory, pp. 480-484, IEEE, 2016.

    66. Back to top

    2015

    Papers in Conferences


  66. N. Li and Z. Zhou and T. Helleseth,  On a conjecture about a class of optimal ternary cyclic codes,  in: Proceeding of Seventh International Workshop on Signal Design and its Applications in Communications,  pp. 62-65,  2015.

  67. A. Alahmadi and T. Helleseth and N. M. Muthana and A. Almuzaini and P. Sole,  Irreducible cyclic Z4 - codes and allied sequences,  in: Proceeding of Seventh International Workshop on Signal Design and its Applications in Communications, pp. 160-164,  2015.

    68. Back to top

    2014

    Papers in journals

  68. C. Li and X. Zeng and C. Li and T. Helleseth,  A Class of de Bruijn Sequences, IEEE Trans. Information Theory, volumn(60),  pp. 7955-7969, 2014.

  69. Y. Xia and C. Li and X. Zeng and T. Helleseth,  Some Results on Cross-Correlation Distribution Between a p-ary m-Sequence and Its Decimated Sequences, IEEE Trans. Information Theory, volumn(60),  pp. 7368-7381, 2014.

  70. N. Li and C. Li and T. Helleseth and C. Ding and X. Tang,  Optimal ternary cyclic codes with minimum distance four and five, Finite Fields and Their Applications, volumn(30),  pp. 100-120, 2014.

  71. N. Li and X. Tang and T. Helleseth,  New M- ary sequences with low autocorrelation from interleaved technique, Des. Codes and Cryptography, volumn(73),  pp. 237-249, 2014.

  72. N. Li and X. Tang and T. Helleseth,  New Constructions of Quadratic Bent Functions in Polynomial Form, IEEE Trans. Information Theory, volumn(60),  pp. 5760-5767, 2014.

  73. C. Li and N. Li and T. Helleseth and C. Ding,  The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials, IEEE Trans. Information Theory, volumn(60),  pp. 4710-4721, 2014.

  74. H. Hu and S. Shao and G. Gong and T. Helleseth,  The Proof of Lin's Conjecture via the Decimation-Hadamard Transform, IEEE Trans. Information Theory, volumn(60),  pp. 5054-5064, 2014.

  75. G. Wu and N. Li and T. Helleseth and Y. Zhang,  Some classes of monomial complete permutation polynomials over finite fields of characteristic two, Finite Fields and Their Applications, volumn(28),  pp. 148-165, 2014.

  76. S. Hong and H. Park and J.-S. No and T. Helleseth and Y.-S. Kim,  Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping, IEEE Trans. Information Theory, volumn(60),  pp. 3698-3705, 2014.

  77. C. Li and X. Zeng and T. Helleseth and C. Li and L. Hu,  The Properties of a Class of Linear FSRs and Their Applications to the Construction of Nonlinear FSRs, IEEE Trans. Information Theory, volumn(60),  pp. 3052-3061, 2014.

  78. T. Helleseth and J. Jedwab,  Special issue editorial: Sequences and their applications, Cryptography and Communications, volumn(6),  pp. 1-2, 2014.

  79. Y. Xia and S. Chen and T. Helleseth and C. Li,  Cross-Correlation between a p-ary Sequence and Its All Decimated Sequences for d=(pm+1)(pm+p-1)/(p+1), IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, volumn(97-A),  pp. 964-969, 2014.

    80. Papers in conference proceedings

  80. Y. Xia and T. Helleseth and G. Wu,  A Note on Cross-Correlation Distribution Between a Ternary $m$- Sequence and Its Decimated Sequence,  in: Proceeding of Sequences and Their Applications - SETA 2014, pp. 249-259,  2014.

  81. H. Hu and S. Shao and G. Gong and T. Helleseth,  On the Proof of Lin's Conjecture,  in: Proceeding of Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 1822-1826,  2014.

  82. L. Budaghyan and A. Kholosha and C. Carlet and T. Helleseth,  Niho Bent Functions from Quadratic o-Monomials,  in: Proceeding of Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 1827-1831,  2014.

    83. Back to top

    2013

    Papers in journals


  83. C. Ding and T. Helleseth, Optimal Ternary Cyclic Codes From Monomials, IEEE Trans. Information Theory, volumn 59, pp. 5898-5904, 2013.

  84. H. Cai and X. Zeng and T. Helleseth and X. Tang and Y. Yang, A New Construction of Zero-Difference Balanced Functions and Its Applications, IEEE Trans. Information Theory, volumn 59, pp. 5008-5015 , 2013.

  85. N. Li and T. Helleseth and X. Tang, Further results on a class of permutation polynomials over finite fields, Finite Fields and Their Applications, volumn 22, pp. 16-23 , 2013.

  86. N. Li and T. Helleseth and A. Kholosha and X. Tang, On the Walsh Transform of a Class of Functions From Niho Exponents, IEEE Trans. Information Theory, volumn 59, pp. 4662-4667 , 2013.

  87. W. Jia and X. Zeng and C. Li and T. Helleseth and L. Hu, Permutation polynomials with low differential uniformity over finite fields of odd characteristic, Science China Mathematics, volumn 56, pp. 1429-1440 , 2013.

  88. N. Li and T. Helleseth and X. Tang and A. Kholosha, Several New Classes of Bent Functions From Dillon Exponents, IEEE Trans. Information Theory, volumn 59, pp. 1818-1831 , 2013.

    89. Papers in conference proceedings


  89. T. Helleseth and C. J. A. Jansen and O. Kazymyrov and A. Kholosha, State Space Cryptanalysis of tHe MICKEY Cipher, in: Proceedings of the 2013 IEEE Information Theory and Applications Workshop (ITA)

    90. Back to top


    2012

    Papers in journals


  90. G. Gong, T. Helleseth, and H. Hu, A three-valued Walsh transform from decimations of Helleseth Gong sequences, IEEE Trans. Inf. Theory, volume 58(2), pp. 1158-1162, February 2012.

  91. G. Gong, T. Helleseth, H. Hu, and A. Kholosha, On the dual of certain ternary weakly regular bent functions, IEEE Trans. Inf. Theory, volume 58(4), pp. 2237-2243, April 2012.

  92. W. Jia, X. Zeng, T. Helleseth, and C. Li, A class of binomial bent functions over the finite fields of odd characteristic, IEEE Trans. Inf. Theory, volume 58(9), pp. 6054-6063, September 2012.

  93. L. Budaghyan, C. Carlet, T. Helleseth, A. Kholosha, and S. Mesnager, Further results on Niho bent functions, IEEE Trans. Inf. Theory, volume 58(11), pp. 6979-6985, November 2012.

    94. Papers in conference proceedings


  94. N. Li, X. Tang, and T. Helleseth, New classes of generalized boolean bent functions over Z4, in: Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 841-845, IEEE, July 2012.

  95. L. Budaghyan, C. Carlet, T. Helleseth, and A. Kholosha, Generalized bent functions and their relation to Maiorana-McFarland class, in: Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 1217-1220, IEEE, July 2012.

  96. J. Luo and T. Helleseth, Binary Niho sequences with four-valued cross correlations, in: Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 1221-1225, IEEE, July 2012.

  97. C. Li and T. Helleseth, New nonbinary sequence families with low correlation and large linear span, in: Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 1416-1420, IEEE, July 2012.

  98. G. Gong, T. Helleseth, H. Hu, and C. Li, New three-valued Walsh transforms from decimations of Helleseth-Gong sequences, in: Sequences and Their Applications - SETA 2012, pp. 327-337, Lecture Notes in Computer Science, T. Helleseth and J. Jedwab, Eds., volume 7280, Springer-Verlag, Berlin, 2012.

  99. T. Helleseth, A. Kholosha, and S. Mesnager, Niho bent functions and Subiaco hyperovals, in: Theory and Applications of Finite Fields, ser. Contemporary Mathematics, M. Lavrauw, G. L. Mullen, S. Nikova, D. Panario, and L. Storme, Eds., volume 579, pp. 91-101, Providence, Rhode Island: American Mathematical Society, 2012.

    100. Back to top


    2011

    Papers in journals


  100. X. Tang and Toe Helleseth, Generic construction of quaternary sequences of period 2n with low correlation from quaternary sequences of odd period n, IEEE Trans. Inf. Theory, volume 57(4), pp. 2295-2300, April 2011.

  101. Guang Gong, Sondre Rønjom, Tor Helleseth and H. Hu, Fast discrete fourier spectra attacks on stream ciphers, IEEE Trans. Inf. Theory, volume 57(8), pp. 5555-5565, August 2011.

  102. J. Luo and T. Helleseth, Constant composition codes as subcodes of cyclic codes, IEEE Trans. Inf. Theory, volume 57(11), pp. 7482-7488, November 2011.

  103. N. Li, X. Tang, and T. Helleseth, Several classes of codes and sequences derived from a Z4-valued quadratic form, IEEE Trans. Inf. Theory, volume 57(11), pp. 7618-7628, November 2011.

    104. Papers in conference proceedings


  104. C. Carlet, T. Helleseth, A. Kholosha, and S. Mesnager, On the dual of bent functions with 2r Niho exponents, in: Proceedings of the 2011 IEEE International Symposium on Information Theory. pp. 657-661, IEEE, July 2011.

  105. L. Budaghyan, C. Carlet, and T. Helleseth, On bent functions associated to AB functions, in: Proceedings of the 2011 IEEE Information Theory Workshop, pp. 150-154, IEEE, Oct. 2011.

  106. T. Helleseth and S. Rønjom, Simplifying algebraic attacks with univariate analysis, in: Proceedings of the 2011 IEEE Information Theory and Applications Workshop (ITA), pp. 1-7, IEEE, February 2011.

  107. J. Luo, T. Helleseth, and A. Kholosha, Two nonbinary sequences with six-valued cross correlation, in: Fifth International Workshop on Signal Design and its Applications in Communications, IWSDA '11, pp. 44-47, IEEE, October 2011.

  108. L. Budaghyan and T. Helleseth, New commutative semifields defined by new PN multinomials, Cryptography and Communications, pp. 1-16, volume 3(1), Marc 2011.

  109. T. Helleseth and A. Kholosha, Crosscorrelation of m-sequences, exponential sums, bent functions and Jacobsthal sums, Cryptography and Communications, pp. 281-291, volume 3(4), December 2011.

  110. L. Budaghyan and T. Helleseth, On isotopisms of commutative presemifields and CCZ-equivalence of functions, Internat. J. Found. Comput. Sci., volume 22(6), pp. 12431-1258, September 2011.

    111. Back to top


    2010

    Papers in journals

  111. Tor Helleseth and Alexander Kholosha, New binomial bent functions over the finite fields of odd characteristic, IEEE Trans. Inf. Theory, volume 56(9): pp. 4646-4652, September 2010.
  112. Tor Helleseth, Crosscorrelation of m-sequences, exponential sums and Dickson polynomials, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences , volume E93-A, noumber 11, pp. 2212-2219, November 2010.
  113. Tor Helleseth and Alexander Kholosha, x2l+1+x+a and related affine polynomials over GF(2k), Cryptography and Communications, volume 2(1): pp. 85-109, April 2010.

    114. Papers in conference proceedings

  114. Mehdi M. Hassanzadeh and Tor Helleseth, Algebraic attack on the alternating step(r,s) generator, in: Proceedings of the 2010 IEEE International Symposium on Information Theory, pp. 2493-2497, IEEE, June 2010.

  115. Mehdi M. Hassanzadeh and Tor Helleseth, Algebraic attack on the more generalized clock-controlled alternating step generator, in: Proceedings of the 2010 IEEE International Conference on Signal Processing and Communications (SPCOM), pp. 1-5, IEEE, July 2010.

  116. Mehdi M. Hassanzadeh and Tor Helleseth, Algebraic attack on the second class of modified alternating k-generators, in: Norwegian Information Security Conference NISK 2010, pp. 12-20, Tapir Akademisk Forlag, 2010

  117. Tor Helleseth and Alexander Kholosha, New binomial bent functions over the finite fields of odd characteristic, in: Proceedings of the 2010 IEEE International Symposium on Information Theory, pp. 1277-1281, IEEE, June 2010.

  118. Tor Helleseth and Alexander Kholosha, On generalized bent functions, in: Proceedings of the 2010 IEEE Information Theory and Applications Workshop (ITA), pp. 1-6, IEEE, January/February 2010.

  119. Tor Helleseth and Alexander Kholosha, Sequences, bent functions and jacobsthal sums, in: Claude Carlet and Alexander Pott, eds., Sequences and Their Applications - SETA 2010, Lecture Notes in Computer Science, volume 6338, pp. 416-429, Springer-Verlag, Berlin, 2010.

  120. Lilya Budaghyan and Tor Helleseth, Planar functions and commutative semifields, in: Otokar Grosek, Tor Helleseth, Alexander Kholosha, and Karol Nemoga, eds., NILCRYPT '10, Tatra Mountains Mathematical Publications, volume 45, pp. 15-25, Mathematical Institute, Slovak Academy of Sciences, Bratislava, 2010.

    121. Back to top


    2009

    Papers in journals

  121. Pascale Charpin, Tor Helleseth, and Victor A. Zinoviev, Divisibility properties of classical binary Kloosterman sums, Discrete Math., volume 309(12): pp. 3975-3984, June 2009.

  122. Tor Helleseth, Linear and nonlinear sequences and applications to stream ciphers, in: Ignacio Luengo, ed., Recent Trends in Cryptography, Contemporary Mathematics, volume 477, pp. 21-46, American Mathematical Society, Providence, Rhode Island, 2009.

  123. Tor Helleseth, Henk D. L. Hollmann, Alexander Kholosha, Zeying Wang, and Qing Xiang, Proofs of two conjectures on ternary weakly regular bent functions, IEEE Trans. Inf. Theory, volume 55(11): pp. 5272-5283, November 2009.

  124. Tor Helleseth, Lei Hu, Alexander Kholosha, Xiangyong Zeng, Nian Li, and Wenfeng Jiang, Period-different m-sequences with at most four-valued cross correlation, IEEE Trans. Inf. Theory, volume 55(7): pp. 3305-3311, July 2009.
  125. Aina Johansen and Tor Helleseth, A family of m-sequences with five-valued cross correlation, IEEE Trans. Inf. Theory, volume 55(2): pp. 880-887, February 2009.

  126. Aina Johansen, Tor Helleseth, and Alexander Kholosha, Further results on m-sequences with five-valued cross correlation, IEEE Trans. Inf. Theory, volume 55(12): pp. 5792-5802, December 2009.

  127. Xiaohu Tang, Tor Helleseth, and Pingzhi Fan, A new optimal quaternary sequence family of length 2(2n-1) obtained from the orthogonal transformation of families B and C, Des. Codes Cryptogr., volume 53(3): pp. 137-148, December 2009.

  128. Xiaohu Tang, Tor Helleseth, Lei Hu, and Wenfeng Jiang, Two new families of optimal binary sequences obtained from quaternary sequences, IEEE Trans. Inf. Theory, volume 55(4): pp. 1833-1840, April 2009.

    129. Papers in conference proceedings


  129. Carl Bracken and Tor Helleseth, Triple-error-correcting BCH-like codes, in: Proceedings of the 2009 IEEE International Symposium on Information Theory, pp. 1723-1725, IEEE, June/July 2009.

  130. Tor Helleseth, Cross-correlation of m-sequences, exponential sums and Dickson polynomials, in: Fourth International Workshop on Signal Design and its Applications in Communications, IWSDA '09, p. 2, IEEE, October 2009.

  131. Tor Helleseth, Michal Hojsík, and Sondre Rønjom, Algebraic attacks on filter and combiner generators, in: Bart Preneel, Stefan Dodunekov, Vincent Rijmen, and Svetla Nikova, eds., Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, NATO Science for Peace and Security Series, Sub-Series D: Information and Communication Security, volume 23, pp. 39-48, IOS Press, Amsterdam, 2009.

    132. Back to top


    2008

    Papers in journals


  132. Aina Johansen, Tor Helleseth, and Xiaohu Tang, The correlation distribution of quaternary sequences of period 2(2n-1), IEEE Trans. Inf. Theory, volume 54(7): pp. 3130-3139, July 2008.

  133. Pascale Charpin, Tor Helleseth, and Victor A. Zinoviev, On cosets of weight 4 of BCH(2m,8), m even, and exponential sums, SIAM Journal on Discrete Mathematics, volume 23(1): pp. 59-78, 2008.

  134. Tor Helleseth and Alexander Kholosha, On the equation x2l+1+x+a=0 over GF(2k), Finite Fields Appl., volume 14(1): pp. 159-176, January 2008.

    135. Papers in conference proceedings


  135. Lilya Budaghyan and Tor Helleseth, New perfect nonlinear multinomials over Fp2k for any odd prime p, in: Solomon W. Golomb, Matthew G. Parker, Alexander Pott, and Arne Winterhof, eds., Sequences and Their Applications - SETA 2008, Lecture Notes in Computer Science, volume 5203, pp. 403-414, Springer-Verlag, Berlin, 2008.

  136. Pascale Charpin, Tor Helleseth, and Victor A. Zinoviev, Divisibility properties of Kloosterman sums over finite fields of characteristic two, in: Proceedings of the 2008 IEEE International Symposium on Information Theory, pp. 2608-2612, IEEE, July 2008.

  137. Mehdi M. Hassanzadeh, Matthew G. Parker, Tor Helleseth, Yaser Esmaeili Salehani, and Mohammad R. Sohizadeh Abyaneh, Differential distinguishing attack on the Shannon stream cipher based on fault analysis, in: Proceedings of the 2008 IEEE International Symposium on Telecommunications, pp. 671-676, IEEE, August 2008.

  138. Tor Helleseth and Alexander Kholosha, m-sequences of lengths 22k-1 and 2k-1 with at most four-valued cross correlation, in: Solomon W. Golomb, Matthew G. Parker, Alexander Pott, and Arne Winterhof, eds., Sequences and Their Applications - SETA 2008, Lecture Notes in Computer Science, volume 5203, pp. 106-120, Springer-Verlag, Berlin, 2008.

  139. Tor Helleseth, Alexander Kholosha, and Aina Johansen, m-sequences of different lengths with four-valued cross correlation, in: Proceedings of the 2008 IEEE International Symposium on Information Theory, pp. 2598-2602, IEEE, July 2008.

  140. Tor Helleseth, Gohar Kyureghyan, Geir Jarle Ness, and Alexander Pott, On a family of perfect nonlinear binomials, in: Bart Preenel and Oleg A. Logachev, eds., Boolean Functions in Cryptology and Information Security, NATO Science for Peace and Security Series, Sub-Series D: Information and Communication Security, volume 18, pp. 126-138, IOS Press, Amsterdam, 2008.

  141. Cees J. A. Jansen, Tor Helleseth, and Alexander Kholosha, Cascade jump controlled sequence generator and Pomaranch stream cipher, in: Matthew Robshaw and Olivier Billet, eds., New Stream Cipher Designs - The eSTREAM Finalists, Lecture Notes in Computer Science, volume 4986, pp. 224-243, Springer-Verlag, Berlin, 2008.

  142. Aina Johansen and Tor Helleseth, Crosscorrelation of m-sequences with decimation d=(pl+1)/(pk+1), in: Proceedings of the 2008 International Symposium on Information Theory and Its Applications, pp. 1570-1575, IEEE, December 2008.

  143. Xiaohu Tang, Tor Helleseth, and Aina Johansen, On the correlation distribution of Kerdock sequences, in: Solomon W. Golomb, Matthew G. Parker, Alexander Pott, and Arne Winterhof, eds., Sequences and Their Applications - SETA 2008, Lecture Notes in Computer Science, volume 5203, pp. 121-129, Springer-Verlag, Berlin, 2008.

    144. Back to top


    2007

    Papers in journals


  144. Pascale Charpin, Tor Helleseth, and Victor A. Zinoviev, The divisibility modulo 24 of Kloosterman sums on GF(2m), m odd, J. Combin. Theory Ser. A, volume 114(2): pp. 322-338, February 2007.

  145. Pascale Charpin, Tor Helleseth, and Victor A. Zinoviev, Propagation characteristics of x® x-1 and Kloosterman sums, Finite Fields Appl., volume 13(2): pp. 366-381, April 2007.

  146. Cunsheng Ding, Tor Helleseth, Torleiv Kløve, and Xuesong Wang, A generic construction of Cartesian authentication codes, IEEE Trans. Inf. Theory, volume 53(6): pp. 2229-2235, June 2007.

  147. Tor Helleseth, Alexander Kholosha, and Geir Jarle Ness, Characterization of m-sequences of lengths 22k-1 and 2k-1 with three-valued crosscorrelation, IEEE Trans. Inf. Theory, volume 53(6): pp. 2236-2245, June 2007.

  148. Tor Helleseth, Jyrki Lahtonen, and Petri Rosendahl, On Niho type cross-correlation functions of m-sequences, Finite Fields Appl., volume 13(2): pp. 305-317, April 2007.

  149. Geir Jarle Ness and Tor Helleseth, A new family of four-valued cross correlation between m-sequences of different lengths, IEEE Trans. Inf. Theory, volume 53(11): pp. 4308-4313, November 2007.

  150. Geir Jarle Ness and Tor Helleseth, A new family of ternary almost perfect nonlinear mappings, IEEE Trans. Inf. Theory, volume 53(7): pp. 2581-2586, July 2007.

  151. Sondre Rønjom and Tor Helleseth, A new attack on the filter generator, IEEE Trans. Inf. Theory, volume 53(5): pp. 1752-1758, May 2007.

    152. Papers in conference proceedings


  152. Pascale Charpin, Tor Helleseth, and Victor A. Zinoviev, On binary primitive BCH codes with minimum distance 8 and exponential sums, in: Proceedings of the 2007 IEEE International Symposium on Information Theory, pp. 1976-1980, IEEE, June 2007.

  153. Tor Helleseth and Alexander Kholosha, On the dual of monomial quadratic p-ary bent functions, in: Solomon Golomb, Guang Gong, Tor Helleseth, and Hong-Yeop Song, eds., Sequences, Subsequences, and Consequences, Lecture Notes in Computer Science, volume 4893, pp. 50-61, Springer-Verlag, Berlin, 2007.

  154. Aina Johansen, Tor Helleseth, and Xiaohu Tang, The correlation distribution of sequences of period 2(2n-1), in: Optimal Codes and Related Topics, Fifth International Workshop, pp. 93-99, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, 2007.

  155. Sondre Rønjom, Guang Gong, and Tor Helleseth, On attacks on filtering generators using linear subspace structures, in: Solomon Golomb, Guang Gong, Tor Helleseth, and Hong-Yeop Song, eds., Sequences, Subsequences, and Consequences, Lecture Notes in Computer Science, volume 4893, pp. 204-217, Springer-Verlag, Berlin, 2007.

  156. Sondre Rønjom, Guang Gong, and Tor Helleseth, A survey of recent attacks on the filter generator, in: Serdar Boztas and Hsiao-Feng Lu, eds., Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Computer Science, volume 4851, pp. 7-17, Springer-Verlag, Berlin, 2007.

  157. Sondre Rønjom and Tor Helleseth, Attacking the filter generator over GF(2m), in: Claude Carlet and Berk Sunar, eds., Arithmetic of Finite Fields, Lecture Notes in Computer Science, volume 4547, pp. 264-275, Springer-Verlag, Berlin, 2007.

  158. Sondre Rønjom and Tor Helleseth, The linear vector space spanned by the nonlinear filter generator, in: Solomon Golomb, Guang Gong, Tor Helleseth, and Hong-Yeop Song, eds., Sequences, Subsequences, and Consequences, Lecture Notes in Computer Science, volume 4893, pp. 169-183, Springer-Verlag, Berlin, 2007.

  159. Xiaohu Tang, Tor Helleseth, Lei Hu, and Wenfeng Jiang, A new family of Gold-like sequences, in: Solomon Golomb, Guang Gong, Tor Helleseth, and Hong-Yeop Song, eds., Sequences, Subsequences, and Consequences, Lecture Notes in Computer Science, volume 4893, pp. 62-69, Springer-Verlag, Berlin, 2007.

    160. Back to top


    2006

    Papers in journals


  160. Leonid A. Bassalygo, Stefan M. Dodunekov, Victor A. Zinoviev, and Tor Helleseth, The Grey-Rankin bound for nonbinary codes, Probl. Inf. Transm. , volume 42(3): pp. 197-203, September 2006.

  161. Pascale Charpin, Tor Helleseth, and Victor A. Zinoviev, The coset distribution of triple-error-correcting binary primitive BCH codes, IEEE Trans. Inf. Theory, volume 52(4): pp. 1727-1732, April 2006.

  162. Hans Dobbertin, Patrick Felke, Tor Helleseth, and Petri Rosendahl, Niho type cross-correlation functions via Dickson polynomials and Kloosterman sums, IEEE Trans. Inf. Theory, volume 52(2): pp. 613-627, February 2006.

  163. Tor Helleseth and Alexander Kholosha, Monomial and quadratic bent functions over the finite fields of odd characteristic, IEEE Trans. Inf. Theory, volume 52(5): pp. 2018-2032, May 2006.

  164. Håvard Molland and Tor Helleseth, Linear properties in T-functions, IEEE Trans. Inf. Theory, volume 52(11): pp. 5151-5157, November 2006.

  165. Geir Jarle Ness and Tor Helleseth, Cross correlation of m-sequences of different lengths, IEEE Trans. Inf. Theory, volume 52(4): pp. 1637-1648, April 2006.

  166. Geir Jarle Ness and Tor Helleseth, A new three-valued cross correlation between m-sequences of different lengths, IEEE Trans. Inf. Theory, volume 52(10): pp. 4695-4701, October 2006.

  167. Geir Jarle Ness, Tor Helleseth, and Alexander Kholosha, On the correlation distribution of the Coulter-Matthews decimation, IEEE Trans. Inf. Theory, volume 52(5): pp. 2241-2247, May 2006.

    168. Papers in conference proceedings


  168. Leonid A. Bassalygo, Stefan M. Dodunekov, Tor Helleseth, and Victor A. Zinoviev, On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound, in: Proceedings of the 2006 IEEE Information Theory Workshop, pp. 278-282, IEEE, March 2006.

  169. Tor Helleseth, Cees J. A. Jansen, Shahram Khazaei, and Alexander Kholosha, Security of jump controlled sequence generators for stream ciphers, in: Guang Gong, Tor Helleseth, Hong-Yeop Song, and Kyeongcheol Yang, eds., Sequences and Their Applications - SETA 2006, Lecture Notes in Computer Science, volume 4086, pp. 141-152, Springer-Verlag, Berlin, 2006.

  170. Tor Helleseth and Alexander Kholosha, Monomial bent functions over the finite fields of odd characteristic, in: Svetla Nikova, Bart Preneel, Leo Storme, and Joseph A. Thas, eds., Coding Theory and Cryptography, pp. 43-48, Koninklijke Vlaamse Academie van Belgie voor Wetenschappen en Kunsten, Brussels, 2006.

  171. Tor Helleseth, Torleiv Kløve, and Vladimir I. Levenshtein, A bound for codes with given minimum and maximum distances, in: Proceedings of the 2006 IEEE International Symposium on Information Theory, pp. 292-296, IEEE, July 2006.

  172. Geir Jarle Ness and Tor Helleseth, Three-valued crosscorrelation between m-sequences of different lengths, in: Proceedings of the 2006 IEEE International Symposium on Information Theory, pp. 1653-1657, IEEE, July 2006.

    173. Back to top


    2005

    Papers in journals


  173. Tor Helleseth, Torleiv Kløve, and Vladimir I. Levenshtein, Error-correction capability of binary linear codes, IEEE Trans. Inf. Theory, volume 51(4): pp. 1408-1423, April 2005.

  174. Tor Helleseth and Petri Rosendahl, New pairs of m-sequences with 4-level cross-correlation, Finite Fields Appl., volume 11(4): pp. 674-683, November 2005.

  175. Sang-Hyo Kim, Jong-Seon No, Habong Chung, and Tor Helleseth, New cyclic relative difference sets constructed from d-homogeneous functions with difference-balanced property, IEEE Trans. Inf. Theory, volume 51(3): pp. 1155-1163, March 2005.

  176. Hans Georg Schaathun and Tor Helleseth, The second support weight distribution of the Kasami codes, IEEE Trans. Inf. Theory, volume 51(8): pp. 2892-2894, August 2005.

  177. Victor A. Zinoviev, Tor Helleseth, and Pascale Charpin, On cosets of weight 4 of binary BCH codes with minimum distance 8 and exponential sums, Probl. Inf. Transm. volume 41(4): pp. 331-348, October 2005.

    178. Papers in conference proceedings


  178. Pascale Charpin, Tor Helleseth, and Victor A. Zinoviev, Coset distribution of triple-error-correcting binary primitive BCH codes, in: Proceedings of the 2005 IEEE International Symposium on Information Theory, pp. 1972-1976, IEEE, September 2005.

  179. Tor Helleseth and Alexander Kholosha, New monomial bent functions over the finite fields of odd characteristic, in: Proceedings of the 2005 IEEE Information Theory Workshop, pp. 72-76, IEEE, August/September 2005.

  180. Tor Helleseth, Alexander Kholosha, and Geir Jarle Ness, On the correlation distribution of the Coulter-Matthews decimation, in: Optimal Codes and Related Topics, Fourth International Workshop, pp. 190-195, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, 2005.

  181. Håvard Molland and Tor Helleseth, A linear weakness in the Klimov-Shamir T-function, in: Proceedings of the 2005 IEEE International Symposium on Information Theory, pp. 1106-1110, IEEE, September 2005.

    182. Back to top


    2004

    Papers in journals


  182. Tor Helleseth, Torleiv Kløve, and Vladimir I. Levenshtein, The simplex codes and other even-weight binary linear codes for error correction, IEEE Trans. Inf. Theory, volume 50(11): pp. 2818-2823, November 2004.

  183. Tor Helleseth, Jyrki Lahtonen, and Kalle Ranto, A simple proof to the minimum distance of Z4-linear Goethals-like codes, Journal of Complexity, volume 20(2-3): pp. 297-304, April/June 2004.

  184. Tor Helleseth, Martijn Maas, John Erik Mathiassen, and Toon Segers, Linear complexity over Fp of Sidel'nikov sequences, IEEE Trans. Inf. Theory, volume 50(10): pp. 2468-2472, October 2004.

  185. Tor Helleseth and Johannes J. Mykkeltveit, A proof of Simmons' conjecture, Des. Codes Cryptogr., volume 33(1): pp. 39-43, August 2004.

  186. Tor Helleseth and Hans Georg Schaathun, On the (2,1)-separating weight of the Kerdock code, IEEE Trans. Inf. Theory, volume 50(12): pp. 3312-3315, December 2004.

  187. Tor Helleseth and José Felipe Voloch, Double circulant quadratic residue codes, IEEE Trans. Inf. Theory, volume 50(9): pp. 2154-2155, September 2004.

  188. Tor Helleseth and Victor A. Zinoviev, On a new identity for Kloosterman sums and nonlinear system of equations over finite fields of characteristic 2, Discrete Math., volume 274(1-3): pp. 109-124, January 2004.

  189. Ji-Woong Jang, Young-Sik Kim, Jong-Seon No, and Tor Helleseth, New family of p-ary sequences with optimal correlation property and large linear span, IEEE Trans. Inf. Theory, volume 50(8): pp. 1839-1843, August 2004.

  190. Young-Sik Kim, Ji-Woong Jang, Jong-Seon No, and Tor Helleseth, New constructions of p-ary bent sequences, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, volume E87-A(2): pp. 489-494, February 2004.

  191. Jong-Seon No, Dong-Joon Shin, and Tor Helleseth, On the p-ranks and characteristic polynomials of cyclic difference sets, Des. Codes Cryptogr., volume 33(1): pp. 23-37, August 2004.

  192. Dong-Joon Shin, P. Vijay Kumar, and Tor Helleseth, An Assmus-Mattson-type approach for identifying 3-designs from linear codes over Z4, Des. Codes Cryptogr., volume 31(1): pp. 75-92, January 2004.

  193. Victor A. Zinoviev and Tor Helleseth, On weight distributions of shifts of Goethals-like codes, Probl. Inf. Transm. , volume 40(2): pp. 118-134, April 2004.

    194. Papers in conference proceedings


  194. Pascale Charpin, Tor Helleseth, and Victor A. Zinoviev, On binary BCH codes with minimal distance 8 and Kloosterman sums, in: Ninth International Workshop on Algebraic and Combinatorial Coding Theory, pp. 90-94, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, 2004.

  195. Stefan M. Dodunekov, Tor Helleseth, and Victor A. Zinoviev, On q-ary Grey-Rankin bound and codes meeting this bound, in: Proceedings of the 2004 IEEE International Symposium on Information Theory, p. 528, IEEE, June/July 2004.

  196. Tor Helleseth, Jyrki Lahtonen, and Petri Rosendahl, On certain equations over finite fields and cross-correlations of m-sequences, in: Keqin Feng, Harald Niederreiter, and Chaoping Xing, eds., Coding, Cryptography and Combinatorics, Progress in Computer Science and Applied Logic, volume 23, pp. 169-176, Springer-Verlag, Berlin, 2004.

  197. Tor Helleseth, John Erik Mathiassen, Martijn Maas, and Toon Segers, Linear complexity over Fp of Sidel'nikov sequences, in: Proceedings of the 2004 IEEE International Symposium on Information Theory, p. 122, IEEE, June/July 2004.

  198. Young-Sik Kim, Ji-Woong Jang, Jong-Seon No, and Tor Helleseth, New p-ary bent sequences, in: Proceedings of the 2004 IEEE International Symposium on Information Theory, p. 498, IEEE, June/July 2004.

  199. Håvard Molland and Tor Helleseth, An improved correlation attack against irregular clocked and filtered keystream generators, in: Matt Franklin, ed., Advances in Cryptology - CRYPTO 2004, Lecture Notes in Computer Science, volume 3152, pp. 373-389, Springer-Verlag, Berlin, 2004.

    200. Back to top


    2003

    Papers in journals


  200. Tor Helleseth, Sang-Hyo Kim, and Jong-Seon No, Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences, IEEE Trans. Inf. Theory, volume 49(6): pp. 1548-1552, June 2003.

  201. Tor Helleseth, Torleiv Kløve, and Vladimir I. Levenshtein, Hypercubic 4 and 5-designs from double-error-correcting BCH codes, Des. Codes Cryptogr., volume 28(3): pp. 265-282, April 2003.

  202. Tor Helleseth and Victor A. Zinoviev, New Kloosterman sums identities over F2m for all m, Finite Fields Appl., volume 9(2): pp. 187-193, April 2003.

  203. Dong-Joon Shin, P. Vijay Kumar, and Tor Helleseth, 3-designs from the Z4-Goethals codes via a new Kloosterman sum identity, Des. Codes Cryptogr., volume 28(3): pp. 247-263, April 2003.

  204. T. W. Sze, Samuel T. Chanson, Cunsheng Ding, Tor Helleseth, and Matthew G. Parker, Logarithm Cartesian authentication codes, Inform. and Comput., volume 184(1): pp. 93-108, July 2003.

  205. Kyeongcheol Yang and Tor Helleseth, On the minimum distance of array codes as LDPC codes, IEEE Trans. Inf. Theory, volume 49(12): pp. 3268-3271, December 2003.

    206. Papers in conference proceedings


  206. Tor Helleseth, Pairs of m-sequences with a six-valued crosscorrelation, in: Jong-Seon No, Hong-Yeop Song, Tor Helleseth, and P. Vijay Kumar, eds., Mathematical Properties of Sequences and other Combinatorial Structures, The Kluwer International Series in Engineering and Computer Science, pp. 1-6, Kluwer Academic Publishers, Dordrecht, 2003.

  207. Tor Helleseth, Torleiv Kløve, and Vladimir I. Levenshtein, Binary even-weight codes for error correction, in: International Conference on Software, Telecommunications and Computer Networks - SoftCom 2003, pp. 822-826, University of Split, Croatia, October 2003.

  208. Tor Helleseth, Torleiv Kløve, and Vladimir I. Levenshtein, A coset weight count that proves that the simplex codes are not optimal for error correction, in: Proceedings of the 2003 IEEE Information Theory Workshop, pp. 234-237, IEEE, March/April 2003.

  209. Tor Helleseth, Torleiv Kløve, and Vladimir I. Levenshtein, Error-correction capability of binary linear codes, in: Proceedings of the 2003 IEEE International Symposium on Information Theory, p. 463, IEEE, June/July 2003.

  210. Tor Helleseth, Torleiv Kløve, and Vladimir I. Levenshtein, The simplex codes are not optimal for binary symmetric channels, in: Proceedings of the 2003 IEEE International Symposium on Information Theory, p. 161, IEEE, June/July 2003.

  211. Ji-Woong Jang, Young-Sik Kim, Jong-Seon No, and Tor Helleseth, New family of p-ary sequences with optimal correlation property and large linear span, in: Proceedings of the 2003 IEEE International Symposium on Information Theory, p. 405, IEEE, June/July 2003.

  212. Young-Sik Kim, Ji-Woong Jang, Jong-Seon No, and Tor Helleseth, On p-ary bent functions defined on finite fields, in: Jong-Seon No, Hong-Yeop Song, Tor Helleseth, and P. Vijay Kumar, eds., Mathematical Properties of Sequences and other Combinatorial Structures, The Kluwer International Series in Engineering and Computer Science, pp. 65-76, Kluwer Academic Publishers, Dordrecht, 2003.

  213. Håvard Molland, John Erik Mathiassen, and Tor Helleseth, Improved fast correlation attack using low rate codes, in: Kenneth G. Paterson, ed., Cryptography and Coding, Lecture Notes in Computer Science, volume 2898, pp. 67-81, Springer-Verlag, Berlin, 2003.

  214. Hans Georg Schaathun and Tor Helleseth, Separating and intersecting properties of BCH and Kasami codes, in: Kenneth G. Paterson, ed., Cryptography and Coding, Lecture Notes in Computer Science, volume 2898, pp. 52-65, Springer-Verlag, Berlin, 2003.

    215. Back to top


    2002

    Papers in journals


  215. Cunsheng Ding, Tor Helleseth, Harald Niederreiter, and Chaoping Xing, The minimum distance of the duals of binary irreducible cyclic codes, IEEE Trans. Inf. Theory, volume 48(10): pp. 2679-2689, October 2002.

  216. Noboru Hamada and Tor Helleseth, The nonexistence of ternary [97,6,63] codes, Journal of Statistical Planning and Inference, volume 106(1-2): pp. 485-507, August 2002.

  217. Tor Helleseth, Sekvenser og anvendelser i mobilkommunikasjon, Nordisk Matematisk Tidsskrift, volume 50(3-4): pp. 155-169, 2002.

  218. Tor Helleseth and Guang Gong, New nonbinary sequences with ideal two-level autocorrelation, IEEE Trans. Inf. Theory, volume 48(11): pp. 2868-2872, November 2002.

    219. Papers in conference proceedings


  219. Tor Helleseth, On the crosscorrelation of m-sequences and related sequences with ideal autocorrelation, in: Tor Helleseth, P. Vijay Kumar, and Kyeongcheol Yang, eds., Sequences and Their Applications - SETA '01, Discrete Mathematics and Theoretical Computer Science, pp. 34-45, Springer-Verlag, Berlin, 2002.

  220. Tor Helleseth and Guang Gong, New nonbinary sequences with ideal two-level autocorrelation function, in: Proceedings of the 2002 IEEE International Symposium on Information Theory, p. 182, IEEE, June/July 2002.

  221. Tor Helleseth, Sang-Hyo Kim, and Jong-Seon No, Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences, in: Proceedings of the 2002 IEEE International Symposium on Information Theory, p. 180, IEEE, June/July 2002.

  222. Tor Helleseth and Kyeongcheol Yang, On binary sequences of period n=pm-1 with optimal autocorrelation, in: Tor Helleseth, P. Vijay Kumar, and Kyeongcheol Yang, eds., Sequences and Their Applications - SETA '01, Discrete Mathematics and Theoretical Computer Science, pp. 209-217, Springer-Verlag, Berlin, 2002.

  223. Jong-Seon No, Dong-Joon Shin, and Tor Helleseth, On the p-ranks and characteristic polynomials of cyclic difference sets, in: Proceedings of the 2002 IEEE International Symposium on Information Theory, p. 96, IEEE, June/July 2002.

    224. Back to top


    2001

    Papers in journals


  224. Krishnasamy Thiru Arasu, Cunsheng Ding, Tor Helleseth, P. Vijay Kumar, and Halvard M. Martinsen, Almost difference sets and their sequences with optimal autocorrelation, IEEE Trans. Inf. Theory, volume 47(7): pp. 2934-2943, November 2001.

  225. Cunsheng Ding, Tor Helleseth, and Halvard M. Martinsen, New families of binary sequences with optimal three-level autocorrelation, IEEE Trans. Inf. Theory, volume 47(1): pp. 428-433, January 2001.

  226. Hans Dobbertin, Tor Helleseth, P. Vijay Kumar, and Halvard M. Martinsen, Ternary m-sequences with three-valued cross-correlation function: new decimations of Welch and Niho type, IEEE Trans. Inf. Theory, volume 47(4): pp. 1473-1481, May 2001.

  227. Tor Helleseth, Sequences with good correlations and some open problems, Electronic Notes in Discrete Mathematics, volume 6: pp. 507-517, April 2001.

  228. Tor Helleseth, P. Vijay Kumar, and Halvard M. Martinsen, A new family of ternary sequences with ideal two-level autocorrelation function, Des. Codes Cryptogr., volume 23(2): pp. 157-166, July 2001.

  229. Tor Helleseth, Chunming Rong, and Kyeongcheol Yang, New 3-designs from Goethals codes over Z4, Discrete Math., volume 226(1-3): pp. 403-409, January 2001.

  230. Tor Helleseth, Chunming Rong, and Kyeongcheol Yang, On t-designs from codes over Z4, Discrete Math., volume 238(1-3): pp. 67-80, July 2001.

  231. Tor Helleseth and Victor A. Zinoviev, Codes with the same coset weight distributions as the Z4-linear Goethals codes, IEEE Trans. Inf. Theory, volume 47(4): pp. 1589-1595, May 2001.

  232. Tor Helleseth and Victor A. Zinoviev, On coset weight distributions of the Z4-linear Goethals codes, IEEE Trans. Inf. Theory, volume 47(5): pp. 1758-1772, July 2001.

  233. Jong-Seon No, Habong Chung, Hong-Yeop Song, Kyeongcheol Yang, Jung-Do Lee, and Tor Helleseth, New construction for binary sequences of period pm-1 with optimal autocorrelation using (z+1)d+azd+b, IEEE Trans. Inf. Theory, volume 47(4): pp. 1638-1644, May 2001.

  234. Dong-Joon Shin, P. Vijay Kumar, and Tor Helleseth, 5-designs from the lifted Golay code over Z4 via an Assmus-Mattson type approach, Discrete Math., volume 241(1-3): pp. 479-487, October 2001.

    235. Papers in conference proceedings


  235. Noboru Hamada and Tor Helleseth, Codes and minihypers, in: Third EuroWorkshop on Optimal Codes and Related Topics, pp. 79-84, Institute of Mathematics and Informatics, Sofia, 2001.

  236. Tor Helleseth, Codes over Z4, in: Helmut Alt, ed., Computational Discrete Mathematics: Advanced Lectures, Lecture Notes in Computer Science, volume 2122, pp. 47-55, Springer-Verlag, Berlin, 2001.

  237. Tor Helleseth, Sequences with ideal autocorrelation, in: Third EuroWorkshop on Optimal Codes and Related Topics, pp. 91-95, Institute of Mathematics and Informatics, Sofia, 2001.

  238. Tor Helleseth, Torleiv Kløve, and Vladimir I. Levenshtein, Ordered orthogonal arrays of strength 4 and 5 from double-error-correcting BCH codes, in: Proceedings of the 2001 IEEE International Symposium on Information Theory, p. 201, IEEE, June 2001.

  239. Kenneth Shum, P. Vijay Kumar, and Tor Helleseth, The L-function of Gold exponential sum, in: Dieter Jungnickel and Harald Niederreiter, eds., Finite Fields and Applications, pp. 418-427, Springer-Verlag, Berlin, 2001.

    240. Back to top


    2000

    Papers in journals


  240. Anchung Chang, Peter Gaal, Solomon W. Golomb, Guang Gong, Tor Helleseth, and P. Vijay Kumar, On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code, IEEE Trans. Inf. Theory, volume 46(2): pp. 680-687, March 2000.

  241. Cunsheng Ding, Tor Helleseth, and Kwok Yan Lam, Duadic sequences of prime lengths, Discrete Math., volume 218(1-3): pp. 33-49, May 2000.

  242. Noboru Hamada and Tor Helleseth, Arcs, blocking sets, and minihypers, Computers and Mathematics with Applications, volume 39(11): pp. 159-168, June 2000.

  243. Noboru Hamada and Tor Helleseth, The nonexistence of some ternary linear codes and update of the bounds for n3(6,d), 1 £ d £ 243, Math. Japon., volume 52(1): pp. 31-43, July 2000.

  244. Noboru Hamada, Tor Helleseth, Halvard M. Martinsen, and Øyvind Ytrehus, There is no ternary [28,6,16] code, IEEE Trans. Inf. Theory, volume 46(4): pp. 1550-1554, July 2000.

    245. Papers in conference proceedings


  245. Hans Dobbertin, Tor Helleseth, P. Vijay Kumar, and Halvard M. Martinsen, Ternary m-sequences with three-valued crosscorrelation function: two new decimations, in: Proceedings of the 2000 IEEE International Symposium on Information Theory, p. 329, IEEE, June 2000.

  246. Tor Helleseth, On some ternary m-sequences with good autocorrelation and crosscorrelation, in: Seventh International Workshop on Algebraic and Combinatorial Coding Theory, pp. 168-171, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, 2000.

  247. Tor Helleseth, P. Vijay Kumar, and Halvard M. Martinsen, A new family of ternary sequences with ideal two-level autocorrelation function, in: Proceedings of the 2000 IEEE International Symposium on Information Theory, p. 328, IEEE, June 2000.

  248. Tor Helleseth and Victor A. Zinoviev, On Z4-linear Goethals codes, Kloosterman sums and Dickson polynomials, in: Seventh International Workshop on Algebraic and Combinatorial Coding Theory, pp. 172-176, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, 2000.

  249. P. Vijay Kumar, H. F. Francis Lu, Tor Helleseth, and Dong-Joon Shin, On the large family of low correlation quaternary sequences S(2), in: Proceedings of the 2000 IEEE International Conference on Personal Wireless Communications, pp. 33-37, IEEE, December 2000.

  250. Jong-Seon No, Habong Chung, Hong-Yeop Song, Kyeongcheol Yang, Jung-Do Lee, and Tor Helleseth, Balanced and almost balanced binary sequences of period pm -1 with optimal autocorrelation using the polynomial (z+1)d +azd+b over GF(pm), in: Proceedings of the 2000 IEEE International Symposium on Information Theory, p. 299, IEEE, June 2000.

    251. Back to top


    1999

    Papers in journals


  251. Cunsheng Ding and Tor Helleseth, Generalized cyclotomic codes of length p1e1...ptet, IEEE Trans. Inf. Theory, volume 45(2): pp. 467-474, March 1999.

  252. Cunsheng Ding, Tor Helleseth, and Kwok Yan Lam, Several classes of binary sequences with three-level autocorrelation, IEEE Trans. Inf. Theory, volume 45(7): pp. 2606-2612, November 1999.

  253. Iwan Duursma, Tor Helleseth, Chunming Rong, and Kyeongcheol Yang, Split weight enumerators for the Preparata codes with applications to designs, Des. Codes Cryptogr., volume 18(1-3): pp. 103-124, December 1999.

  254. Tor Helleseth, Bo Hove, and Kyeongcheol Yang, Further results on generalized Hamming weights for Goethals and Preparata codes over Z4, IEEE Trans. Inf. Theory, volume 45(4): pp. 1255-1258, May 1999.

  255. Tor Helleseth and Halvard M. Martinsen, Binary sequences of period 2m-1 with large linear complexity, Inform. and Comput., volume 151(1-2): pp. 73-91, May 1999.

  256. Tor Helleseth, Chunming Rong, and Daniel Sandberg, New families of almost perfect nonlinear power mappings, IEEE Trans. Inf. Theory, volume 45(2): pp. 475-485, March 1999.

  257. Tor Helleseth, Chunming Rong, and Kyeongcheol Yang, New infinite families of 3-designs from Preparata codes over Z4, Discrete Math., volume 195(1-3): pp. 139-156, January 1999.

  258. Tor Helleseth and Victor A. Zinoviev, On Z4-linear Goethals codes and Kloosterman sums, Des. Codes Cryptogr., volume 17(1-3): pp. 269-288, September 1999.

  259. Chunming Rong, Tor Helleseth, and Jyrki Lahtonen, On algebraic decoding of the Z4-linear Calderbank-McGuire code, IEEE Trans. Inf. Theory, volume 45(5): pp. 1423-1434, July 1999.

    260. Papers in conference proceedings


  260. Tor Helleseth, Correlation of m-sequences and related topics, in: Cunsheng Ding, Tor Helleseth, and Harald Niederreiter, eds., Sequences and Their Applications, Discrete Mathematics and Theoretical Computer Science, pp. 49-66, Springer-Verlag, Berlin, 1999.

  261. Tor Helleseth and P. Vijay Kumar, Codes and sequences over Z4 - a tutorial overview, in: Alexander Pott, P. Vijay Kumar, Tor Helleseth, and Dieter Jungnickel, eds., Difference Sets, Sequences and their Correlation Properties, NATO Science Series, Series C: Mathematical and Physical Sciences, volume 542, pp. 195-225, Kluwer Academic Publishers, Dordrecht, 1999.

  262. Tor Helleseth, P. Vijay Kumar, Halvard M. Martinsen, and Odd Narve Vassbakk, Correlation distribution of the quaternary Kasami sequences, in: Cunsheng Ding, Tor Helleseth, and Harald Niederreiter, eds., Sequences and Their Applications, Discrete Mathematics and Theoretical Computer Science, pp. 240-253, Springer-Verlag, Berlin, 1999.

    263. Back to top


    1998

    Papers in journals


  263. Ross Anderson, Cunsheng Ding, Tor Helleseth, and Torleiv Kløve, How to build robust shared control systems, Des. Codes Cryptogr., volume 15(2): pp. 111-124, November 1998.

  264. Cunsheng Ding and Tor Helleseth, New generalized cyclotomy and its applications, Finite Fields Appl., volume 4(2): pp. 140-166, April 1998.

  265. Cunsheng Ding and Tor Helleseth, On cyclotomic generator of order r, Information Processing Letters, volume 66(1): pp. 21-25, April 1998.

  266. Cunsheng Ding, Tor Helleseth, and Weijuan Shan, On the linear complexity of Legendre sequences, IEEE Trans. Inf. Theory, volume 44(3): pp. 1276-1278, May 1998.

  267. Tor Helleseth, P. Vijay Kumar, and Kyeongcheol Yang, An infinite family of 3-designs from Preparata codes over Z4, Des. Codes Cryptogr., volume 15(2): pp. 175-181, November 1998.

  268. Abhijit G. Shanbhag, P. Vijay Kumar, and Tor Helleseth, An upper bound for the extended Kloosterman sums over Galois rings, Finite Fields Appl., volume 4(3): pp. 218-238, July 1998.
    269. >
  269. Kyeongcheol Yang and Tor Helleseth, On the weight hierarchy of Goethals codes over Z4, IEEE Trans. Inf. Theory, volume 44(1): pp. 304-307, January 1998.

  270. Kyeongcheol Yang and Tor Helleseth, Two new infinite families of 3-designs from Kerdock codes over Z4, Des. Codes Cryptogr., volume 15(2): pp. 201-214, November 1998.

    271. Papers in conference proceedings


  271. Anchung Chang, Tor Helleseth, and P. Vijay Kumar, Further results on a conjectured 2-level autocorrelation sequence, in: Proceedings of the Thirty-Sixth Annual Allerton Conference on Communication, Control, and Computing, pp. 598-599, Monticello, Illinois, September 1998.

  272. Tor Helleseth, Chunming Rong, and Kyeongcheol Yang, Some 3-designs from Goethals codes over Z4, in: Optimal Codes and Related Topics, Second International Workshop, pp. 84-89, Institute of Mathematics and Informatics, Sofia, 1998.

  273. Tor Helleseth and Victor A. Zinoviev, On coset weight distribution of the Z4-linear Goethals codes, in: Sixth International Workshop on Algebraic and Combinatorial Coding Theory, pp. 130-134, Mezhdunarodnyj Tsentr Nauchnoj i Tekhnicheskoj Informatsii, Moskva, 1998.

  274. Tor Helleseth and Victor A. Zinoviev, On the coset weight distributions of Z4-linear Goethals codes and some relations to Kloosterman sums, in: Proceedings of the Thirty-Sixth Annual Allerton Conference on Communication, Control, and Computing, pp. 593-597, Monticello, Illinois, September 1998.

  275. Tor Helleseth and Victor A. Zinoviev, On the coset weight distributions of the Z4-linear Goethals codes, in: Proceedings of the 1998 IEEE International Symposium on Information Theory, p. 400, IEEE, August 1998.

  276. Kyeongcheol Yang and Tor Helleseth, Kerdock codes over Z4 and their application to designs, in: Proceedings of the 1998 IEEE International Symposium on Information Theory, p. 399, IEEE, August 1998.

    277. Back to top


    1997

    Papers in journals


  277. Iliya Boukliev, Stefan M. Dodunekov, Tor Helleseth, and Øyvind Ytrehus, On the [162,8,80] codes, IEEE Trans. Inf. Theory, volume 43(6): pp. 2055-2057, November 1997.

  278. Tor Helleseth and Torleiv Kløve, The Newton radius of codes, IEEE Trans. Inf. Theory, volume 43(6): pp. 1820-1831, November 1997.

  279. Tor Helleseth, Torleiv Kløve, and Vladimir I. Levenshtein, On the information function of an error-correcting code, IEEE Trans. Inf. Theory, volume 43(2): pp. 549-557, March 1997.

  280. Tor Helleseth and Daniel Sandberg, Some power mappings with low differential uniformity, Appl. Algebra Engrg. Comm. Comput., volume 8(5): pp. 363-370, July 1997.

  281. P. Vijay Kumar and Tor Helleseth, An expansion for the coordinates of the trace function over Galois rings, Appl. Algebra Engrg. Comm. Comput., volume 8(5): pp. 353-361, July 1997.

  282. Kyeongcheol Yang and Tor Helleseth, On the weight hierarchy of Preparata codes over Z4, IEEE Trans. Inf. Theory, volume 43(6): pp. 1832-1842, November 1997.

    283. Papers in conference proceedings


  283. Tor Helleseth, Torleiv Kløve, and Vladimir I. Levenshtein, On the information function of an error correcting code, in: Proceedings of the 1997 IEEE International Symposium on Information Theory, p. 362, IEEE, June/July 1997.

  284. Tor Helleseth, P. Vijay Kumar, Chunming Rong, and Kyeongcheol Yang, On infinite families of 3-designs from Preparata codes and related codes over Z4, in: Proceedings of the Thirty-Fifth Annual Allerton Conference on Communication, Control, and Computing, pp. 395-403, Monticello, Illinois, September/October 1997.

  285. Tor Helleseth, P. Vijay Kumar, Abhijit G. Shanbhag, and Kyeongcheol Yang, On the weight hierarchy of some codes over Z4, in: Proceedings of the 1997 IEEE Information Theory Workshop, pp. 7-8, IEEE, July 1997.

  286. P. Vijay Kumar and Tor Helleseth, An expansion for the coordinates of the trace function over Galois rings, in: Proceedings of the 1997 IEEE Information Theory Workshop, pp. 5-6, IEEE, July 1997.

  287. Chunming Rong and Tor Helleseth, The algebraic decoding of the Z4-linear Calderbank-McGuire code, in: Proceedings of the 1997 IEEE International Symposium on Information Theory, p. 328, IEEE, June/July 1997.

  288. Kyeongcheol Yang and Tor Helleseth, On the generalized Hamming weights for Preparata codes over Z4, in: Proceedings of the 1997 IEEE International Symposium on Information Theory, p. 205, IEEE, June/July 1997.

  289. Kyeongcheol Yang and Tor Helleseth, On the minimum support weights of Goethals codes over Z4, in: Proceedings of the 1997 IEEE International Symposium on Information Theory, p. 204, IEEE, June/July 1997.

    290. Back to top


    1996

    Papers in journals


  290. A. Robert Calderbank, Gary McGuire, P. Vijay Kumar, and Tor Helleseth, Cyclic codes over Z4, locator polynomials, and Newton's identities, IEEE Trans. Inf. Theory, volume 42(1): pp. 217-226, January 1996.

  291. Noboru Hamada and Tor Helleseth, A characterization of 3n1+n4,3n0+n3; 4,3-minihypers and projective ternary [78,5,51; 3]-codes, Math. Japon., volume 43(2): pp. 253-266, March 1996.

  292. Noboru Hamada and Tor Helleseth, A characterization of some 3v2+v3,3v1 + v2; 3,3-minihypers and some [15,4,9; 3]-codes with B2=0, Journal of Statistical Planning and Inference, volume 56(1): pp. 129-146, December 1996.

  293. Noboru Hamada and Tor Helleseth, The uniqueness of [87,5,57;  3]-codes and the nonexistence of [258,6,171; 3]-codes, Journal of Statistical Planning and Inference, volume 56(1): pp. 105-127, December 1996.

  294. Erik R. Hauge and Tor Helleseth, DeBruijn sequences, irreducible codes and cyclotomy, Discrete Math., volume 159(1-3): pp. 143-154, November 1996.

  295. Tor Helleseth and Torleiv Kløve, The weight hierarchies of some product codes, IEEE Trans. Inf. Theory, volume 42(3): pp. 1029-1034, May 1996.

  296. Tor Helleseth and Torleiv Kløve, The weight hierarchies of some product codes, in: Arithmétique, Géométrie, et Algorithmique dans la Théorie des Codes correcteurs d'erreurs, Pointe-á-Pitre, Guadeloupe, April 1996.

  297. Tor Helleseth and P. Vijay Kumar, On the weight hierarchy of the semiprimitive codes, Discrete Math., volume 152(1-3): pp. 185-190, May 1996.

  298. Tor Helleseth, P. Vijay Kumar, Oscar Moreno, and Abhijit G. Shanbhag, Improved estimates via exponential sums for the minimum distance of Z4-linear trace codes, IEEE Trans. Inf. Theory, volume 42(4): pp. 1212-1216, July 1996.

  299. Tor Helleseth, P. Vijay Kumar, and Abhijit G. Shanbhag, Codes with the same weight distributions as the Goethals codes and the Delsarte-Goethals codes, Des. Codes Cryptogr., volume 9(3): pp. 257-266, November 1996.

  300. Tor Helleseth, P. Vijay Kumar, and Abhijit G. Shanbhag, Exponential sums over Galois rings and their applications, in: Stephen D. Cohen and Harald Niederreiter, eds., Finite Fields and Applications, London Mathematical Society Lecture Note Series, volume 233, pp. 109-128, Cambridge University Press, New York, 1996.

  301. P. Vijay Kumar, Tor Helleseth, A. Robert Calderbank, and Jr. A. Roger Hammons, Large families of quaternary sequences with low correlation, IEEE Trans. Inf. Theory, volume 42(2): pp. 579-592, March 1996.

  302. Chunming Rong and Tor Helleseth, Use characteristic sets to decode cyclic codes up to actual minimum distance, in: Stephen D. Cohen and Harald Niederreiter, eds., Finite Fields and Applications, London Mathematical Society Lecture Note Series, volume 233, pp. 297-312, Cambridge University Press, New York, 1996.

  303. Abhijit G. Shanbhag, P. Vijay Kumar, and Tor Helleseth, Improved binary codes and sequence families from Z4-linear codes, IEEE Trans. Inf. Theory, volume 42(5): pp. 1582-1587, September 1996.

  304. Abhijit G. Shanbhag, P. Vijay Kumar, and Tor Helleseth, Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences, IEEE Trans. Inf. Theory, volume 42(1): pp. 250-254, January 1996.

  305. Kyeongcheol Yang, Tor Helleseth, P. Vijay Kumar, and Abhijit G. Shanbhag, On the weight hierarchy of Kerdock codes over Z4, IEEE Trans. Inf. Theory, volume 42(5): pp. 1587-1593, September 1996.

    306. Papers in conference proceedings


  306. Iliya Boukliev, Stefan M. Dodunekov, Tor Helleseth, and Øyvind Ytrehus, Two new binary optimal 8-dimensional codes, in: Fifth International Workshop on Algebraic and Combinatorial Coding Theory, pp. 66-67, Unicorn, Shumen, 1996.

  307. Tor Helleseth and Thomas Johansson, Universal hash functions from exponential sums over finite fields and Galois rings, in: Neal Koblitz, ed., Advances in Cryptology - CRYPTO '96, Lecture Notes in Computer Science, volume 1109, pp. 31-44, Springer-Verlag, Berlin, 1996.

  308. Tor Helleseth, Torleiv Kløve, and Vladimir I. Levenshtein, The Newton radius of equidistant codes, in: Proceedings of the 1996 IEEE International Symposium on Information Theory and Its Applications, volume II, pp. 721-722, IEEE, September 1996.

  309. Kyeongcheol Yang, Tor Helleseth, P. Vijay Kumar, and Abhijit G. Shanbhag, On the generalized Hamming weights for Kerdock codes over Z4, in: Proceedings of the 1996 IEEE International Symposium on Information Theory and Its Applications, volume I, pp. 39-42, IEEE, September 1996.

    310. Back to top


    1995

    Papers in journals


  310. Noboru Hamada and Tor Helleseth, A characterization of some n1+n2+2n3,n0+n1+2n2; 4,3-minihypers and some [90,5,59; 3]-codes meeting the Griesmer bound, Math. Japon., volume 41(3): pp. 657-672, May 1995.

  311. Noboru Hamada and Tor Helleseth, A characterization of some 3vm+1,3vm; k-1,q-minihypers and some [n,k,qk-1-3qm;  q]-codes (k ≥ 3,q ≥ 5,1 ≤ m < k-1) meeting the Griesmer bound, Discrete Math., volume 146(1-3): pp. 59-67, November 1995.

  312. Noboru Hamada and Tor Helleseth, Construction of some optimal ternary linear codes and the uniqueness of [294,6,195; 3]-codes meeting the Griesmer bound, Finite Fields Appl., volume 1(4): pp. 458-468, October 1995.

  313. Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, and Øyvind Ytrehus, Bounds on the minimum support weights, IEEE Trans. Inf. Theory, volume 41(2): pp. 432-440, March 1995.

  314. Tor Helleseth and P. Vijay Kumar, The algebraic decoding of the Z4-linear Goethals code, IEEE Trans. Inf. Theory, volume 41(6, Part II): pp. 2040-2048, November 1995.

  315. Tor Helleseth and P. Vijay Kumar, The weight hierarchy of the Kasami codes, Discrete Math., volume 145(1-3): pp. 133-143, October 1995.

  316. P. Vijay Kumar, Tor Helleseth, and A. Robert Calderbank, An upper bound for Weil exponential sums over Galois rings and applications, IEEE Trans. Inf. Theory, volume 41(2): pp. 456-468, March 1995.

    317. Papers in conference proceedings


  317. Xuemin Chen, Irving S. Reed, and Tor Helleseth, On Gröbner bases of the error-locator ideal of Hermitian codes, in: Proceedings of the 1995 IEEE International Symposium on Information Theory, p. 94, IEEE, September 1995.

  318. Noboru Hamada and Tor Helleseth, A characterization of 3v1+v4,3v0+v3; 4,3-minihypers and projective ternary [78,5,51] codes, in: International Workshop on Optimal Codes and Related Topics, pp. 61-64, Panorama, Shumen, 1995.

  319. Noboru Hamada and Tor Helleseth, The nonexistence of ternary [270,6,179] codes and [309,6,205] codes, in: International Workshop on Optimal Codes and Related Topics, pp. 65-68, Panorama, Shumen, 1995.

  320. Tor Helleseth and P. Vijay Kumar, The algebraic decoding of the Z4-linear Goethals code, in: Proceedings of the 1995 IEEE International Symposium on Information Theory, p. 408, IEEE, September 1995.

  321. Tor Helleseth and P. Vijay Kumar, A new proof of the minimum distance of the quaternary Preparata code and Goethals code, in: International Workshop on Optimal Codes and Related Topics, pp. 69-73, Panorama, Shumen, 1995.

  322. Tor Helleseth, P. Vijay Kumar, Oscar Moreno, and Abhijit G. Shanbhag, Improved estimates for the minimum distance of weighted degree Z4 trace codes, in: Proceedings of the 1995 IEEE International Symposium on Information Theory, p. 283, IEEE, September 1995.

  323. Tor Helleseth, P. Vijay Kumar, and Abhijit G. Shanbhag, New codes with the same weight distributions as the Goethals codes and the Delsarte-Goethals codes, in: Proceedings of the 1995 IEEE International Symposium on Information Theory, p. 274, IEEE, September 1995.

  324. Tor Helleseth, P. Vijay Kumar, Abhijit G. Shanbhag, and Kyeongcheol Yang, On Galois rings: a Hasse-Davenport-type relation for Z4 Kerdock code and applications, in: Proceedings of the Thirty-Third Annual Allerton Conference on Communication, Control, and Computing, pp. 480-482, Monticello, Illinois, October 1995.

  325. Tor Helleseth and Eli Winjum, The generalized Hamming weight of some BCH codes and related codes, in: Proceedings of the 1995 IEEE International Symposium on Information Theory, p. 281, IEEE, September 1995.

  326. Abhijit G. Shanbhag, P. Vijay Kumar, and Tor Helleseth, An upper bound for extended Kloosterman sums over Galois rings, in: Proceedings of the 1995 IEEE International Symposium on Information Theory, p. 88, IEEE, September 1995.

  327. Abhijit G. Shanbhag, P. Vijay Kumar, and Tor Helleseth, An upper bound for the aperiodic correlation of weighted-degree CDMA sequences, in: Proceedings of the 1995 IEEE International Symposium on Information Theory, p. 92, IEEE, September 1995.

    328. Back to top


    1994

    Papers in journals


  328. Xuemin Chen, Irving S. Reed, Tor Helleseth, and Trieu-Kien Truong, General principles for the algebraic decoding of cyclic codes, IEEE Trans. Inf. Theory, volume 40(5): pp. 1661-1663, September 1994.

  329. Xuemin Chen, Irving S. Reed, Tor Helleseth, and Trieu-Kien Truong, Use of Gröbner bases to decode binary cyclic codes up to the true minimum distance, IEEE Trans. Inf. Theory, volume 40(5): pp. 1654-1661, September 1994.

    330. Papers in conference proceedings


  330. Xuemin Chen, Irving S. Reed, Tor Helleseth, and Trieu-Kien Truong, Algebraic decoding of cyclic codes: A polynomial ideal point of view, in: Gary L. Mullen and Peter Jau-Shyong Shiue, eds., Finite Fields: Theory, Applications, and Algorithms, Contemporary Mathematics, volume 168, pp. 15-22, American Mathematical Society, Providence, Rhode Island, 1994.

  331. Noboru Hamada and Tor Helleseth, A characterization of some ternary codes meeting the Griesmer bound, in: Gary L. Mullen and Peter Jau-Shyong Shiue, eds., Finite Fields: Theory, Applications, and Algorithms, Contemporary Mathematics, volume 168, pp. 139-150, American Mathematical Society, Providence, Rhode Island, 1994.

  332. Tor Helleseth, Torleiv Kløve, and Øyvind Ytrehus, Generalizations of the Griesmer bound, in: Andrew Chmora and Stephen B. Wicker, eds., Error Control, Cryptology, and Speech Compression, Lecture Notes in Computer Science, volume 829, pp. 41-52, Springer-Verlag, Berlin, 1994.

  333. Tor Helleseth and P. Vijay Kumar, The weight hierarchy of semiprimitive codes, in: Fourth International Workshop on Algebraic and Combinatorial Coding Theory, pp. 94-97, 1994.

  334. Tor Helleseth and P. Vijay Kumar, The weight hierarchy of the Kasami codes, in: Proceedings of the 1994 IEEE International Symposium on Information Theory, p. 308, IEEE, June/July 1994.

  335. P. Vijay Kumar, Tor Helleseth, and A. Robert Calderbank, An upper bound for some exponential sums over Galois rings and applications, in: Proceedings of the 1994 IEEE International Symposium on Information Theory, p. 70, IEEE, June/July 1994.

  336. P. Vijay Kumar, Tor Helleseth, A. Robert Calderbank, and Jr. A. Roger Hammons, Large families of quaternary sequences with low correlation, in: Proceedings of the 1994 IEEE International Symposium on Information Theory, p. 71, IEEE, June/July 1994.

  337. Abhijit G. Shanbhag, P. Vijay Kumar, and Tor Helleseth, Improved binary codes and sequence families from Z4-linear codes, in: Proceedings of the Thirty-Second Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, September 1994.

    338. Back to top


    1993

    Papers in journals


  338. Noboru Hamada and Tor Helleseth, A characterization of some n2+2n3,n1+2n2; k-1,3-minihypers and some (nk-30,k,3k-1-21; 3)-codes meeting the Griesmer bound, Journal of Statistical Planning and Inference, volume 34(3): pp. 387-402, March 1993.

  339. Noboru Hamada and Tor Helleseth, A characterization of some q-ary codes (q > (h-1)2, h ≥ 3) meeting the Griesmer bound, Math. Japon., volume 38(5): pp. 925-940, 1993.

  340. Noboru Hamada, Tor Helleseth, and Øyvind Ytrehus, Characterization of 2(q+1)+2,2; t,q-minihypers in PG(t,q) (t ≥ 3,q ∈ 3,4), Discrete Math., volume 115(1-3): pp. 175-185, May 1993.

  341. Noboru Hamada, Tor Helleseth, and Øyvind Ytrehus, A new class of nonbinary codes meeting the Griesmer bound, Discrete Appl. Math., volume 47(3): pp. 219-226, December 1993.

  342. Noboru Hamada, Tor Helleseth, and Øyvind Ytrehus, The nonexistence of [51,5,33; 3]-codes, Ars Combinatoria, volume 35: pp. 25-32, June 1993.

  343. Noboru Hamada, Tor Helleseth, and Øyvind Ytrehus, There are exactly two nonequivalent [20,5,12; 3]-codes, Ars Combinatoria, volume 35: pp. 3-14, June 1993.

    344. Papers in conference proceedings


  344. Noboru Hamada and Tor Helleseth, A characterization of some minihypers and codes meeting the Griesmer bound over GF(q), q > 9, in: Gary L. Mullen and Peter Jau-Shyong Shiue, eds., Finite fields, coding theory, and advances in communications and computing, Lecture Notes in Pure and Applied Mathematics, volume 141, pp. 105-122, Marcel Dekker, Inc., New York, 1993.

  345. Erik R. Hauge and Tor Helleseth, DeBruijn sequences, irreducible codes and cyclotomy, in: Proceedings of the 1993 IEEE International Symposium on Information Theory, p. 361, IEEE, January 1993.

    346. Back to top


    1992

    Papers in journals


  346. Noboru Hamada and Tor Helleseth, A characterization of some 2va+1+vg+1,2va+vg; k-1,3-minihypers and some (n,k,3k-1-2·3a-3g; 3)-codes (k ≥ 3, 0 ≤ a < g < k-1) meeting the Griesmer bound, Discrete Math., volume 104(1): pp. 67-81, June 1992.

  347. Noboru Hamada and Tor Helleseth, A characterization of some linear codes over GF(4) meeting the Griesmer bound, Math. Japon., volume 37: pp. 231-242, 1992.

  348. Noboru Hamada, Tor Helleseth, and Øyvind Ytrehus, On the construction of [q4+q2-q,5,q4-q3+q2-2q; q]-codes meeting the Griesmer bound, Des. Codes Cryptogr., volume 2(3): pp. 225-229, September 1992.

  349. Tor Helleseth, Legendre sums and codes related to QR codes, Discrete Appl. Math., volume 35(2): pp. 107-113, January 1992.

  350. Tor Helleseth, Torleiv Kløve, and Øyvind Ytrehus, Generalized Hamming weights of linear codes, IEEE Trans. Inf. Theory, volume 38(3): pp. 1133-1140, May 1992.

    351. Papers in conference proceedings


  351. Noboru Hamada and Tor Helleseth, On a characterization of some minihypers in PG(t,q) (q=3 or 4) and its applications to error-correcting codes, in: Henning Stichtenoth and Michael A. Tsfasman, eds., Coding Theory and Algebraic Geometry, Lecture Notes in Mathematics, volume 1518, pp. 43-62, Springer-Verlag, Berlin, 1992.

  352. Noboru Hamada and Tor Helleseth, On the construction of [q3-q2+1,4,q3-2q2+q; q]-codes meeting the Griesmer bound, in: International Workshop on Algebraic and Combinatorial Coding Theory, pp. 80-83, Hermes & Hermes, Shumen, 1992.

  353. Tor Helleseth, Torleiv Kløve, and Øyvind Ytrehus, Codes and the chain condition, in: International Workshop on Algebraic and Combinatorial Coding Theory, pp. 88-91, Hermes & Hermes, Shumen, 1992.

  354. Tor Helleseth, Torleiv Kløve, and Øyvind Ytrehus, Codes, weight hierarchies, and chains, in: Proceedings of the ICCS/ISITA '92 Communications on the Move, volume 2, pp. 608-612, IEEE, November 1992.

    355. Back to top


    1991

    Papers in journals


  355. Tor Helleseth and Torleiv Kløve, The number of cross-join pairs in maximum length linear sequences, IEEE Trans. Inf. Theory, volume 37(6): pp. 1731-1733, November 1991.

    356. Papers in conference proceedings


  356. Noboru Hamada, Tor Helleseth, and Øyvind Ytrehus, A new class of nonbinary codes meeting the Griesmer bound, in: Proceedings of the 1991 IEEE International Symposium on Information Theory, p. 9, IEEE, June 1991.

    357. Back to top


    1990

    Papers in journals


  357. Noboru Hamada and Tor Helleseth, A characterization of some minihypers in a finite projective geometry PG(t,4), European Journal of Combinatorics, volume 11(6): pp. 541-548, November 1990.

  358. Noboru Hamada and Tor Helleseth, A characterization of some 3v2,3v1; t,q-minihypers and some 2v2+vg+1,2v1+vg; t,q-minihypers (q=3 or 4, 2 ≤ g < t) and its applications to error-correcting codes, Bulletin of Osaka Women's University, volume 27: pp. 49-107, 1990.

  359. Øyvind Ytrehus and Tor Helleseth, There is no binary [25,8,10] code, IEEE Trans. Inf. Theory, volume 36(3): pp. 695-696, May 1990.

    360. Papers in conference proceedings


  360. Tor Helleseth, Legendre sums and weights of QR codes, in: Abstracts of Papers of the 1990 IEEE International Symposium on Information Theory, p. 148, IEEE, January 1990.

  361. Tor Helleseth and Øyvind Ytrehus, Hunting for optimal codes of small dimensions, in: Proceedings of the 1990 International Symposium on Information Theory and Its Applications, volume 1, pp. 29-30, IEEE, November 1990.

    362. Back to top


    1989


  362. Tor Helleseth, Legendre sums and codes related to QR codes, in: Fourth Joint Swedish-Soviet International Workshop on Information Theory, pp. 218-222, Studentlitteratur, Lund, 1989.

    363. Back to top


    1988


  363. Tor Helleseth, On the covering radius of cyclic linear codes and arithmetic codes, in: O.B. Lupanov and O.M. Kasim-Zade, eds., Kiberneticheskiy sbornik, novaya seriya, volume 25, pp. 64-84, Mir, Moscow, 1988

    364. Back to top


    1987


  364. Stefan M. Dodunekov, Tor Helleseth, Nickolai Manev, and Øyvind Ytrehus, New bounds on binary linear codes of dimension eight, IEEE Trans. Inf. Theory, volume IT-33(6): pp. 917-919, November 1987.

    365. Back to top


    1985


  365. Tor Helleseth, On the covering radius of cyclic linear codes and arithmetic codes, in: Abstracts of Papers of the 1985 IEEE International Symposium on Information Theory, p. 69, IEEE, June 1985.

  366. Tor Helleseth, On the covering radius of cyclic linear codes and arithmetic codes, Discrete Appl. Math., volume 11(2): pp. 157-173, June 1985

  367. Tor Helleseth and Harold F. Mattson Jr., On the cosets of the simplex code, Discrete Math., volume 56(2-3): pp. 169-189, October 1985.

    368. Back to top


    1984


  368. Tor Helleseth, Further classifications of codes meeting the Griesmer bound, IEEE Trans. Inf. Theory, volume IT-30(2): pp. 395-403, March 1984.

    369. Back to top


    1983


  369. Tor Helleseth, New constructions of codes meeting the Griesmer bound, IEEE Trans. Inf. Theory, volume IT-29(3): pp. 434-439, May 1983.

    370. Back to top


    1982


  370. Tor Helleseth, Codes meeting the Griesmer bound, in: Abstracts of Papers of the 1982 IEEE International Symposium on Information Theory, p. 52, IEEE, June 1982.

    371. Back to top


    1981


  371. Tor Helleseth, A characterization of codes meeting the Griesmer bound, Inform. and Control, volume 50(2): pp. 128-159, August 1981.

  372. Tor Helleseth and Torleiv Kløve, On group-theoretic codes for asymmetric channels, Inform. and Control, volume 49(1): pp. 1-9, April 1981.

  373. Tor Helleseth and Henk van Tilborg, A new class of codes meeting the Griesmer bound, IEEE Trans. Inf. Theory, volume IT-27(5): pp. 548-555, September 1981.

    374. Back to top


    1979


  374. Tor Helleseth, No primitive binary t-error-correcting BCH code with t > 2 is quasi-perfect, IEEE Trans. Inf. Theory, volume IT-25(3): pp. 361-362, May 1979.

  375. Tor Helleseth, The weight distribution of the coset leaders for some classes of codes with related parity-check matrices, Discrete Math., volume 28(2): pp. 161-171, November 1979.

  376. Tor Helleseth, Weight Distribution Problems in Codes, Ph.D. thesis, Department of Pure Mathematics, University of Bergen, Bergen, Norway, 1979

    377. Back to top


    1978


  377. Tor Helleseth, All binary 3-error-correcting BCH codes of length 2m-i have covering radius 5, IEEE Trans. Inf. Theory, volume IT-24(2): pp. 257-258, March 1978.

  378. Tor Helleseth, A note on the cross-correlation function between two binary maximal length linear sequences, Discrete Math., volume 23(3): pp. 301-307, 1978.

  379. Tor Helleseth, Torleiv Kløve, and Johannes J. Mykkeltveit, On the covering radius of binary codes, IEEE Trans. Inf. Theory, volume IT-24(5): pp. 627-628, September 1978.

    380. Back to top


    1977


  380. Tor Helleseth, The weight enumerator polynomials of some classes of codes with composite parity-check polynomials, Discrete Math., volume 20: pp. 21-31, 1977.

  381. Tor Helleseth, Torleiv Kløve, and Johannes J. Mykkeltveit, The weight distribution of irreducible cyclic codes with block lengths n1((ql-1)/N), Discrete Math., volume 18(2): pp. 179-211, 1977.

    382. Back to top


    1976


  382. Tor Helleseth, Some results about the cross-correlation function between two maximal linear sequences, Discrete Math., volume 16(3): pp. 209-232, November 1976.

  383. Tor Helleseth, Some two-weight codes with composite parity-check polynomials, IEEE Trans. Inf. Theory, volume IT-22(5): pp. 631-632, September 1976.

    384. Back to top


    1971


  384. Tor Helleseth, Krysskorrelasjonsfunksjonen mellom maksimale sekvenser over GF(q). Hovedoppgave i ren matematikk, Universitetet i Bergen, Matematisk Institutt, Våren 1971.

    385. Back to top


Tor Helleseth picture