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