The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Tor Helleseth: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tor Helleseth
    Codes over Z4. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:47-55 [Conf]
  2. Tor Helleseth, Thomas Johansson
    Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1996, pp:31-44 [Conf]
  3. Håvard Molland, Tor Helleseth
    An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:373-389 [Conf]
  4. Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus
    Generalizations of the Griesmer Bound. [Citation Graph (0, 0)][DBLP]
    Error Control, Cryptology, and Speech Compression, 1993, pp:41-52 [Conf]
  5. Håvard Molland, John Erik Mathiassen, Tor Helleseth
    Improved Fast Correlation Attack Using Low Rate Codes. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2003, pp:67-81 [Conf]
  6. Hans Georg Schaathun, Tor Helleseth
    Separating and Intersecting Properties of BCH and Kasami Codes. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2003, pp:52-65 [Conf]
  7. Tor Helleseth, Cees J. A. Jansen, Shahram Khazaei, Alexander Kholosha
    Security of Jump Controlled Sequence Generators for Stream Ciphers. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:141-152 [Conf]
  8. Tor Helleseth, Daniel Sandberg
    Some Power Mappings with Low Differential Uniformity. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:5, pp:363-370 [Journal]
  9. P. Vijay Kumar, Tor Helleseth
    An Expansion for the Coordinates of the Trace Function over Galois Rings. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:5, pp:353-361 [Journal]
  10. Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
    A New Class of Nonbinary Codes Meeting the Griesmer Bound. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:3, pp:219-226 [Journal]
  11. Ross J. Anderson, Cunsheng Ding, Tor Helleseth, Torleiv Kløve
    How to Build Robust Shared Control Systems. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:15, n:2, pp:111-124 [Journal]
  12. Iwan M. Duursma, Tor Helleseth, Chunming Rong, Kyeongcheol Yang
    Split Weight Enumerators for the Preparata Codes with Applications to Designs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:18, n:1/3, pp:103-124 [Journal]
  13. Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
    On the Construction of [q4 + q2 - q, 5, q4 - q3 + q2 - 2q; q]-Codes Meeting the Griesmer Bound. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1992, v:2, n:3, pp:225-229 [Journal]
  14. Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
    Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:28, n:3, pp:265-282 [Journal]
  15. Tor Helleseth, P. Vijay Kumar, Halvard Martinsen
    A New Family of Ternary Sequences with Ideal Two-level Autocorrelation Function. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:23, n:2, pp:157-166 [Journal]
  16. Tor Helleseth, P. Vijay Kumar, Abhijit G. Shanbhag
    Codes with the Same Weight Distributions as the Goethals Codes and the Delsarte-Goethals Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:9, n:3, pp:257-266 [Journal]
  17. Tor Helleseth, P. Vijay Kumar, Kyeongcheol Yang
    An Infinite Family of 3-Designs from Preparata Codes over Z. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:15, n:2, pp:175-181 [Journal]
  18. Tor Helleseth, Johannes Mykkeltveit
    A Proof of Simmons' Conjecture. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:33, n:1, pp:39-43 [Journal]
  19. Tor Helleseth, Victor Zinoviev
    On Linear Goethals Codes and Kloosterman Sums. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:17, n:1-3, pp:269-288 [Journal]
  20. Jong-Seon No, Dong-Joon Shin, Tor Helleseth
    On the p-Ranks and Characteristic Polynomials of Cyclic Difference Sets. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:33, n:1, pp:23-37 [Journal]
  21. Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth
    3-Designs from the Z4-Goethals Codes via a New Kloosterman Sum Identity. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:28, n:3, pp:247-263 [Journal]
  22. Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth
    An Assmus-Mattson-Type Approach for Identifying 3-Designs from Linear Codes over Z4. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:31, n:1, pp:75-92 [Journal]
  23. Kyeongcheol Yang, Tor Helleseth
    Two New Infinite Families of 3-Designs from Kerdock Codes over Z. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:15, n:2, pp:201-214 [Journal]
  24. Cunsheng Ding, Tor Helleseth, Kwok-Yan Lam
    Duadic sequences of prime lengths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:33-49 [Journal]
  25. Tor Helleseth, Chunming Rong, Kyeongcheol Yang
    On t-designs from codes over Z4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:238, n:1-3, pp:67-80 [Journal]
  26. Tor Helleseth, Chunming Rong, Kyeongcheol Yang
    New 3-designs from Goethals codes over Z4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:226, n:1-3, pp:403-409 [Journal]
  27. Tor Helleseth, Victor A. Zinoviev
    On a new identity for Kloosterman sums and nonlinear system of equations over finite fields of characteristic 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:274, n:1-3, pp:109-124 [Journal]
  28. Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth
    5-Designs from the lifted Golay code over Z4 via an Assmus-Mattson type approach. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:241, n:1-3, pp:479-487 [Journal]
  29. Tor Helleseth
    A Characterization of Codes Meeting the Griesmer Bound [Citation Graph (0, 0)][DBLP]
    Information and Control, 1981, v:50, n:2, pp:128-159 [Journal]
  30. Tor Helleseth, Torleiv Kløve
    On Group-Theoretic Codes for Assymmetric Channels [Citation Graph (0, 0)][DBLP]
    Information and Control, 1981, v:49, n:1, pp:1-9 [Journal]
  31. Tor Helleseth, H. M. Martinsen
    Binary Sequences of Period 2m-1 with Large Linear Complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:151, n:1-2, pp:73-91 [Journal]
  32. T. W. Sze, Samuel T. Chanson, Cunsheng Ding, Tor Helleseth, Matthew G. Parker
    Logarithm cartesian authentication codes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:184, n:1, pp:93-108 [Journal]
  33. Cunsheng Ding, Tor Helleseth
    On Cyclotomic Generator of Order r. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:1, pp:21-25 [Journal]
  34. Tor Helleseth, Jyrki T. Lahtonen, Kalle Ranto
    A simple proof to the minimum distance of Z4-linear Goethals-like codes. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2004, v:20, n:2-3, pp:297-304 [Journal]
  35. Pascale Charpin, Tor Helleseth, Victor Zinoviev
    The divisibility modulo 24 of Kloosterman sums on GF(2m), m odd. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2007, v:114, n:2, pp:322-338 [Journal]
  36. K. T. Arasu, Cunsheng Ding, Tor Helleseth, P. Vijay Kumar, Halvard Martinsen
    Almost difference sets and their sequences with optimal autocorrelation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2934-2943 [Journal]
  37. Iliya Boukliev, Stefan M. Dodunekov, Tor Helleseth, Øyvind Ytrehus
    On the [162, 8, 80] codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:2055-2057 [Journal]
  38. A. Robert Calderbank, Gary McGuire, P. Vijay Kumar, Tor Helleseth
    Cyclic codes over Z4, locator polynomials, and Newton's identities. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:217-226 [Journal]
  39. Anchung Chang, Peter Gaal, Solomon W. Golomb, Guang Gong, Tor Helleseth, P. Vijay Kumar
    On a conjectured ideal autocorrelation sequence, a related triple-error correcting cyclic code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:680-687 [Journal]
  40. Pascale Charpin, Tor Helleseth, Victor A. Zinoviev
    The coset distribution of triple-error-correcting binary primitive BCH codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:4, pp:1727-1732 [Journal]
  41. Xuemin Chen, Irving S. Reed, Tor Helleseth, Trieu-Kien Truong
    General principles for the algebraic decoding of cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:5, pp:1661-0 [Journal]
  42. Cunsheng Ding, Tor Helleseth
    Generalized Cyclotomic Codes of Length p1e1 ... ptet. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:467-474 [Journal]
  43. Cunsheng Ding, Tor Helleseth, Kwok-Yan Lam
    Several classes of binary sequences with three-level autocorrelation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2606-2612 [Journal]
  44. Cunsheng Ding, Tor Helleseth, Halvard Martinsen
    New families of binary sequences with optimal three-level autocorrelation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:428-433 [Journal]
  45. Cunsheng Ding, Tor Helleseth, Harald Niederreiter, Chaoping Xing
    The minimum distance of the duals of binary irreducible cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:10, pp:2679-2689 [Journal]
  46. Cunsheng Ding, Tor Helleseth, Weijuan Shan
    On the Linear Complexity of Legendre Sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1276-1278 [Journal]
  47. Hans Dobbertin, Patrick Felke, Tor Helleseth, Petri Rosendahl
    Niho type cross-correlation functions via dickson polynomials and Kloosterman sums. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:2, pp:613-627 [Journal]
  48. Hans Dobbertin, Tor Helleseth, P. Vijay Kumar, Halvard Martinsen
    Ternary m-sequences with three-valued cross-correlation function: New decimations of Welch and Niho type. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1473-1481 [Journal]
  49. Stefan M. Dodunekov, Tor Helleseth, Nickolai Manev, Øyvind Ytrehus
    New bounds on binary linear codes of dimension eight. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:6, pp:917-0 [Journal]
  50. Noboru Hamada, Tor Helleseth, Halvard Martinsen, Øyvind Ytrehus
    There is no ternary [28, 6, 16] code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1550-1554 [Journal]
  51. Tor Helleseth
    New constructions of codes meeting the Griesmer bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:434-438 [Journal]
  52. Tor Helleseth
    Further classifications of codes meeting the Griesmer bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:395-0 [Journal]
  53. Tor Helleseth, Guang Gong
    New nonbinary sequences with ideal two-level autocorrelation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:11, pp:2868-2872 [Journal]
  54. Tor Helleseth, Bo Hove, Kyeongcheol Yang
    Further Results on Generalized Hamming Weights for Goethals and Preparata Codes Over Z4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:4, pp:1255-1258 [Journal]
  55. Tor Helleseth, Alexander Kholosha
    Monomial and quadratic bent functions over the finite fields of odd characteristic. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:5, pp:2018-2032 [Journal]
  56. Tor Helleseth, Torleiv Kløve
    The number of cross-join pairs in maximum length linear sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1731-0 [Journal]
  57. Tor Helleseth, P. Vijay Kumar
    The algebraic decoding of the Z4-linear Goethals code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:2040-2048 [Journal]
  58. Tor Helleseth, Torleiv Kløve
    The weight hierarchies of some product codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1029-1034 [Journal]
  59. Tor Helleseth, Torleiv Kløve
    The Newton radius of codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:1820-1831 [Journal]
  60. Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
    The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:11, pp:2818-2823 [Journal]
  61. Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
    Error-correction capability of binary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:4, pp:1408-1423 [Journal]
  62. Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
    On the information function of an error-correcting code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:2, pp:549-557 [Journal]
  63. Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus
    Bounds on the minimum support weights. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:432-440 [Journal]
  64. Tor Helleseth, P. Vijay Kumar, Oscar Moreno, Abhijit G. Shanbhag
    Improved estimates via exponential sums for the minimum distance of Z4-linear trace codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:4, pp:1212-1216 [Journal]
  65. Tor Helleseth, Sang-Hyo Kim, Jong-Seon No
    Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:6, pp:1548-1552 [Journal]
  66. Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus
    Generalized Hamming weights of linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1133-0 [Journal]
  67. Tor Helleseth, M. Maas, John Erik Mathiassen, T. Segers
    Linear complexity over Fp of Sidel'nikov sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:10, pp:2468-2472 [Journal]
  68. Tor Helleseth, Chunming Rong, Daniel Sandberg
    New Families of Almost Perfect Nonlinear Power Mappings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:475-485 [Journal]
  69. Tor Helleseth, Hans Georg Schaathun
    On the (2, 1)-separating weight of the Kerdock code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:12, pp:3312-3315 [Journal]
  70. Tor Helleseth, Henk C. A. van Tilborg
    A new class of codes meeting the Griesmer bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:5, pp:548-555 [Journal]
  71. Tor Helleseth, José Felipe Voloch
    Double Circulant Quadratic Residue Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:9, pp:2154-2155 [Journal]
  72. Tor Helleseth, Victor Zinoviev
    Codes with the same coset weight distributions as the Z4-linear Goethals codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1589-1595 [Journal]
  73. Tor Helleseth, Victor Zinoviev
    On coset weight distributions of the Z4-linear Goethals codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1758-1772 [Journal]
  74. Ji-Woong Jang, Young-Sik Kim, Jong-Seon No, Tor Helleseth
    New Family of p-ary Sequences With Optimal Correlation Property and Large Linear Span. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:8, pp:1839-1844 [Journal]
  75. Sang-Hyo Kim, Jong-Seon No, Habong Chung, Tor Helleseth
    New cyclic relative difference sets constructed from d-homogeneous functions with difference-balanced property. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:1155-1163 [Journal]
  76. P. Vijay Kumar, Tor Helleseth, A. Robert Calderbank
    An upper bound for Weft exponential sums over Galois tings and applications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:456-468 [Journal]
  77. P. Vijay Kumar, Tor Helleseth, A. Robert Calderbank, A. Roger Hammons Jr.
    Large families of quaternary sequences with low correlation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:2, pp:579-592 [Journal]
  78. Kyeongcheol Yang, Tor Helleseth
    On the minimum distance of array codes as LDPC codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:12, pp:3268-3271 [Journal]
  79. Jong-Seon No, Habong Chung, Hong-Yeop Song, Kyeongcheol Yang, Jung-Do Lee, Tor Helleseth
    New construction for binary sequences of period pm-1 with Optimal autocorrelation using (z+1)d+azd+b. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1638-1644 [Journal]
  80. Geir Jarle Ness, Tor Helleseth
    Cross correlation of m-sequences of different lengths. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:4, pp:1637-1648 [Journal]
  81. Geir Jarle Ness, Tor Helleseth, Alexander Kholosha
    On the correlation distribution of the Coulter-Matthews decimation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:5, pp:2241-2247 [Journal]
  82. Chunming Rong, Tor Helleseth, Jyrki T. Lahtonen
    On algebraic decoding of the Z4-linear Calderbank-McGuire code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:5, pp:1423-1434 [Journal]
  83. Hans Georg Schaathun, Tor Helleseth
    The second support weight distribution of the Kasami codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:8, pp:2892-2894 [Journal]
  84. Abhijit G. Shanbhag, P. Vijay Kumar, Tor Helleseth
    Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:250-254 [Journal]
  85. Abhijit G. Shanbhag, P. Vijay Kumar, Tor Helleseth
    Improved binary codes and sequence families from Z4-linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1582-1587 [Journal]
  86. Kyeongcheol Yang, Tor Helleseth
    On the weight hierarchy of Preparata codes over Z4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:1832-1842 [Journal]
  87. Kyeongcheol Yang, Tor Helleseth
    On the Weight Hierarchy of Goethals Codes over Z4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:304-307 [Journal]
  88. Kyeongcheol Yang, Tor Helleseth, P. Vijay Kumar, Abhijit G. Shanbhag
    On the weight hierarchy of Kerdock codes over Z4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1587-1593 [Journal]
  89. Øyvind Ytrehus, Tor Helleseth
    There is no binary [25, 8, 10] code (corresp.). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:695-0 [Journal]
  90. Håvard Molland, Tor Helleseth
    Linear Properties in T-Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5151-5157 [Journal]
  91. Geir Jarle Ness, Tor Helleseth
    A New Three-Valued Cross Correlation Between m-Sequences of Different Lengths. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:10, pp:4695-4701 [Journal]
  92. Sondre Rønjom, Tor Helleseth
    A New Attack on the Filter Generator. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:5, pp:1752-1758 [Journal]
  93. Tor Helleseth, Alexander Kholosha, Geir Jarle Ness
    Characterization of m-Sequences of Lengths 22k-1 and 2k-1 With Three-Valued Cross Correlation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:6, pp:2236-2245 [Journal]
  94. Cunsheng Ding, Tor Helleseth, Torleiv Kløve, X. Wang
    A Generic Construction of Cartesian Authentication Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:6, pp:2229-2235 [Journal]
  95. Sondre Rønjom, Tor Helleseth
    Attacking the Filter Generator over GF (2 m ). [Citation Graph (0, 0)][DBLP]
    WAIFI, 2007, pp:264-275 [Conf]
  96. Tor Helleseth, Alexander Kholosha, Geir Jarle Ness
    Characterization of m-Sequences of Lengths $2^{2k}-1$ and $2^k-1$ with Three-Valued Crosscorrelation [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  97. Tor Helleseth, H. F. Mattson
    On the cosets of the simplex code. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:56, n:2-3, pp:169-189 [Journal]
  98. Tor Helleseth, Chunming Rong, Kyeongcheol Yang
    New infinite families of 3-designs from preparata codes over Z4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:139-156 [Journal]
  99. Noboru Hamada, Tor Helleseth
    A characterization of some {2ualpha+1+ugamma+1, 2ualpha+ugamma; k-1, 3}- minihypers and some (n, k, 3k-1 -2·3alpha-3gamma; 3)-codes (k>=3, 0<=alpha<gamma<k-1) me [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:104, n:1, pp:67-81 [Journal]
  100. Tor Helleseth
    Projective codes meeting the Griesmer bound. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:265-271 [Journal]
  101. Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
    Characterization of {2(q+1)+2, 2;t, q}-minihypers in PG(t, q) (t>=3, qepsilon{3, 4}). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:115, n:1-3, pp:175-185 [Journal]
  102. Tor Helleseth, P. Vijay Kumar
    The weight hierarchy of the Kasami codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:145, n:1-3, pp:133-143 [Journal]
  103. Noboru Hamada, Tor Helleseth
    A characterization of some {3vµ+1, 3vµ; k-1, q}-minihypers and some [n, k, qk-1 - 3qµ; q]-codes (k >= 3, q >= 5, 1 <= µ < k-1) meeting the Griesmer bound. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:146, n:1-3, pp:59-67 [Journal]
  104. Tor Helleseth, P. Vijay Kumar
    On the weight hierarchy of the semiprimitive codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:152, n:1-3, pp:185-190 [Journal]
  105. Erik R. Hauge, Tor Helleseth
    De Bruijn sequences, irreducible codes and cyclotomy. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:159, n:1-3, pp:143-154 [Journal]

  106. A Survey of Recent Attacks on the Filter Generator. [Citation Graph (, )][DBLP]


  107. On the Correlation Distribution of Kerdock Sequences. [Citation Graph (, )][DBLP]


  108. m-Sequences of Lengths 22k-1 and 2k-1 with at Most Four-Valued Cross Correlation. [Citation Graph (, )][DBLP]


  109. New Perfect Nonlinear Multinomials over Ffor Any Odd Prime p. [Citation Graph (, )][DBLP]


  110. On the Dual of Monomial Quadratic p -ary Bent Functions. [Citation Graph (, )][DBLP]


  111. On Attacks on Filtering Generators Using Linear Subspace Structures. [Citation Graph (, )][DBLP]


  112. The Linear Vector Space Spanned by the Nonlinear Filter Generator. [Citation Graph (, )][DBLP]


  113. A New Family of Gold-Like Sequences. [Citation Graph (, )][DBLP]


  114. m-Sequences of Different Lengths with Four-Valued Cross Correlation [Citation Graph (, )][DBLP]


  115. On the Equation $x^{2^l+1}+x+a=0$ over $\mathrm{GF}(2^k)$ (Extended Version) [Citation Graph (, )][DBLP]


  116. Triple-Error-Correcting BCH-Like Codes [Citation Graph (, )][DBLP]


  117. New Binomial Bent Function over the Finite Fields of Odd Characteristic [Citation Graph (, )][DBLP]


  118. Algebraic Attack on the Alternating Step(r,s)Generator [Citation Graph (, )][DBLP]


  119. Sequences, Bent Functions and Jacobsthal sums [Citation Graph (, )][DBLP]


  120. Legendre sums and codes related to QR codes. [Citation Graph (, )][DBLP]


  121. Preface. [Citation Graph (, )][DBLP]


  122. Editorial: In memory of Hans Dobbertin. [Citation Graph (, )][DBLP]


  123. A new optimal quaternary sequence family of length 2(2n - 1) obtained from the orthogonal transformation of Families B and C. [Citation Graph (, )][DBLP]


  124. Divisibility properties of classical binary Kloosterman sums. [Citation Graph (, )][DBLP]


Search in 0.013secs, Finished in 0.022secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002