Home
Tor Helleseth's picture

Tor Helleseth

Emeritus
  • E-mailtor.helleseth@uib.no
  • Visitor Address
    HIB - Thormøhlens gate 55
    5006 Bergen
  • Postal Address
    Postboks 7803
    5020 Bergen
Academic article
  • Show author(s) (2022). The q-Ary Antiprimitive BCH Codes. IEEE Transactions on Information Theory. 1683-1695.
  • Show author(s) (2022). The Differential Spectrum of the Power Mapping x<sup>p</sup>n<sup>-3</sup>. IEEE Transactions on Information Theory. 5535-5547.
  • Show author(s) (2022). Sequences with Good Correlations Based on Circular Florentine Arrays. IEEE Transactions on Information Theory. 3381-3388.
  • Show author(s) (2022). On the differential properties of the power mapping x^{p^m+2}. Finite Fields and Their Applications. 22 pages.
  • Show author(s) (2022). Covering Radius of Melas Codes. IEEE Transactions on Information Theory. 4354-4364.
  • Show author(s) (2018). The linear complexity of generalized cyclotomic binary sequences of period pn. Designs, Codes and Cryptography. 1183-1197.
  • Show author(s) (2018). A Construction of Multiple Optimal ZCZ Sequence Sets With Good Cross Correlation. IEEE Transactions on Information Theory. 1340-1346.
  • Show author(s) (2017). Several classes of permutation trinomials from Niho exponents. Cryptography and Communications. 693-705.
  • Show author(s) (2017). New generalized cyclotomic binary sequences of period p2. Designs, Codes and Cryptography. 1-15.
  • Show author(s) (2017). Investigations on Periodic Sequences with Maximum Nonlinear Complexity. IEEE Transactions on Information Theory. 6188-6198.
  • Show author(s) (2017). Generic Construction of Bent Functions and Bent Idempotents with Any Possible Algebraic Degrees. IEEE Transactions on Information Theory. 6149-6157.
  • Show author(s) (2017). An analogue of the ℤ4-Goethals code in non-primitive length. Journal of Systems Science and Complexity. 950-966.
  • Show author(s) (2016). Univariate niho bent functions from o-polynomials. IEEE Transactions on Information Theory. 2254-2265.
  • Show author(s) (2016). Quasi-perfect linear codes from planar and APN functions. Cryptography and Communications. 215-227.
  • Show author(s) (2016). On the lifted Melas code. Cryptography and Communications. 7-18.
  • Show author(s) (2016). On the (non-)existence of APN (n, n)-functions of algebraic degree n. IEEE International Symposium on Information Theory. Proceedings. 480-484.
  • Show author(s) (2016). New ternary binomial bent functions. IEEE International Symposium on Information Theory. Proceedings. 101-104.
  • Show author(s) (2016). Linear codes with two or three weights from weakly regular bent functions. IEEE Transactions on Information Theory. 1166-1176.
  • Show author(s) (2016). Construction of de Bruijn sequences from LFSRs with reducible characteristic polynomials. IEEE Transactions on Information Theory. 610-624.
  • Show author(s) (2016). An open problem on the distribution of a Niho-type cross-correlation function. IEEE Transactions on Information Theory. 7546-7554.
  • Show author(s) (2015). Some new classes of cyclic codes with three or six weights. Advances in Mathematics of Communications. 23-36.
  • Show author(s) (2015). Some classes of complete permutation polynomials over $\mathbb{F}_q $. Science China Mathematics. 14 pages.
  • Show author(s) (2015). Permutation polynomials of the form (x(pm)-x plus delta)(s)+L(x) over the finite field F-p2m of odd characteristic. Finite Fields and Their Applications. 20-35.
  • Show author(s) (2015). On the lifted Zetterberg code. Designs, Codes and Cryptography. 16 pages.
  • Show author(s) (2015). On o-equivalence of Niho bent functions. Lecture Notes in Computer Science (LNCS). 155-168.
  • Show author(s) (2015). Linear codes with two or three weights from quadratic Bent functions. Designs, Codes and Cryptography. 13 pages.
  • Show author(s) (2015). A class of quaternary sequences with low correlation. Advances in Mathematics of Communications. 199-210.
  • Show author(s) (2014). The weight distributions of several classes of cyclic codes from APN monomials. IEEE Transactions on Information Theory. 4710-4721.
  • Show author(s) (2014). The properties of a class of linear FSRs and their applications to the construction of nonlinear FSRs. IEEE Transactions on Information Theory. 3052-3061.
  • Show author(s) (2014). Some results on cross-correlation distribution between a p-Ary m-sequence and its decimated sequences. IEEE Transactions on Information Theory. 7368-7381.
  • Show author(s) (2014). Some classes of monomial complete permutation polynomials over finite fields of characteristic two. Finite Fields and Their Applications. 148-165.
  • Show author(s) (2014). Optimal ternary cyclic codes with minimum distance four and five. Finite Fields and Their Applications. 100-120.
  • Show author(s) (2014). New constructions of quadratic bent functions in polynomial form. IEEE Transactions on Information Theory. 5760-5767.
  • Show author(s) (2014). New M-ary sequences with low autocorrelation from interleaved technique. Designs, Codes and Cryptography. 237-249.
  • Show author(s) (2014). Near-optimal partial hadamard codebook construction using binary sequences obtained from quadratic residue mapping. IEEE Transactions on Information Theory. 3698-3705.
  • Show author(s) (2014). Cross-correlation between a p-ary m-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. 964-969.
  • Show author(s) (2014). A note on cross-correlation distribution between a ternary m-sequence and its decimated sequence. Lecture Notes in Computer Science (LNCS). 249-259.
  • Show author(s) (2014). A class of de Bruijn sequences. IEEE Transactions on Information Theory. 7955-7969.
  • Show author(s) (2013). State space cryptanalysis of the MICKEY cipher. Information Theory and Applications.
  • Show author(s) (2013). Permutation polynomials with low differential uniformity over finite fields of odd characteristic. Science China Mathematics. 1429-1440.
  • Show author(s) (2012). Niho bent functions and Subiaco hyperovals. Contemporary Mathematics. 91-101.
  • Show author(s) (2012). New Nonbinary Sequence Families with Low Correlation and Large Linear Span. IEEE International Symposium on Information Theory. Proceedings. 5 pages.
  • Show author(s) (2010). x^{2^l}+x+a and related affine polynomials over the finite fields of GF(2^k). Cryptography and Communications. 85-109.
  • Show author(s) (2010). Security Analysis of the Step (D,K) Generator Respect to its Parameters. International Journal of Cryptology Research. 39-49.
  • Show author(s) (2010). Planar functions and commutative semifields. Tatra Mountains Mathematical Publications. 15-25.
  • Show author(s) (2010). Crosscorrelation of m-sequences, exponential sums and Dickson polynomials. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 2212-2219.
  • Show author(s) (2009). Period-different m-sequences with at most four-valued cross correlation. IEEE Transactions on Information Theory. 3305-3311.
  • Show author(s) (2009). Linear and nonlinear sequences and applications to stream ciphers. Contemporary Mathematics. 21-45.
  • Show author(s) (2009). A new optimal quaternary sequence family of length 2(2(n)-1) obtained from the orthogonal transformation of Families B and C. Designs, Codes and Cryptography. 137-148.
  • Show author(s) (2008). The correlation distribution of quaternary sequences of period 2(2(n)-1). IEEE Transactions on Information Theory. 3130-3139.
  • Show author(s) (2008). On the equation x(2l+1)+x+a=0 over GF(2(k)). Finite Fields and Their Applications. 159-176.
  • Show author(s) (2008). Cascade Jump Controlled Sequence Generator and Pomaranch Stream Cipher. Lecture Notes in Computer Science (LNCS). 224-243.
  • Show author(s) (2007). The divisibility modulo 24 of Kloosterman sums on GF(2^m), m odd. Journal of combinatorial theory. Series A. 322-338.
  • Show author(s) (2007). Propagation characteristics of x --> x^{-1} and Kloostman sums. Finite Fields and Their Applications. 366-381.
  • Show author(s) (2007). On the dual of monomial quadratic p-ary bent functions. Lecture Notes in Computer Science (LNCS). 50-61.
  • Show author(s) (2007). On Niho type cross-correlation functions of m-sequences. Finite Fields and Their Applications. 305-317.
  • Show author(s) (2007). Characterization of m-sequences of length 2^{2k}-1 and 2^k-1 with three-valued crosscorrelation. IEEE Transactions on Information Theory. 2236-2245.
  • Show author(s) (2007). Attacking the filter generator over GF(2^m). Lecture Notes in Computer Science (LNCS). 264-275.
  • Show author(s) (2007). A survey of recent attacks on the filter generator. Lecture Notes in Computer Science (LNCS). 7-17.
  • Show author(s) (2007). A new attack on the filter generator. IEEE Transactions on Information Theory. 1752-1758.
  • Show author(s) (2007). A generic construction of cartesian authentication codes. IEEE Transactions on Information Theory. 2229-2235.
  • Show author(s) (2006). The coset distribution of triple-error-correcting binary primitive BCH codes. IEEE Transactions on Information Theory. 1727-1732.
  • Show author(s) (2006). The Gray-Rankin bound for nonlinear codes. Problems of Information Transmission. 197-203.
  • Show author(s) (2006). Security of jump controlled sequence generators for stream ciphers. Lecture Notes in Computer Science (LNCS). 141-152.
  • Show author(s) (2006). Preface. Lecture Notes in Computer Science (LNCS). V-VI.
  • Show author(s) (2006). On the correlation distribution of the Coulter-Matthews decimation. IEEE Transactions on Information Theory. 2241-2247.
  • Show author(s) (2006). Niho type cross-correlation functions via Dickson polynomials and Kloosterman sums. IEEE Transactions on Information Theory. 613-627.
  • Show author(s) (2006). Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Transactions on Information Theory. 2018-2032.
  • Show author(s) (2006). Linear properties in T-functions. IEEE Transactions on Information Theory. 5151-5157.
  • Show author(s) (2006). Cross correlation of m-sequences of different lengths. IEEE Transactions on Information Theory. 1637-1648.
  • Show author(s) (2006). A new three-valued crosscorrelation between m-sequences of different lengths. IEEE Transactions on Information Theory. 4695-4701.
  • Show author(s) (2005). Preface. Lecture Notes in Computer Science (LNCS). 2 pages.
  • Show author(s) (2005). On cosets of weight 4 of binary BCH codes of minimum distance 8 and exponential sums. Problems of Information Transmission. 331-348.
  • Show author(s) (2005). New pairs of m-sequences with four-level cross-correlation. Finite Fields and Their Applications. 674-683.
  • Show author(s) (2005). New cyclic relative difference sets constructed from d-homogeneous functions with difference-balanced property. IEEE Transactions on Information Theory. 1155-1163.
  • Show author(s) (2004). On weight distributions of shifts of Goethals-like codes. Problems of Information Transmission. 118-134.
  • Show author(s) (2004). New constructions of p-ary bent sequences. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 489-494.
  • Show author(s) (2004). Linear complexity over F_p of Sidel'nikov sequences. IEEE Transactions on Information Theory. 2468-2472.
  • Show author(s) (2004). A simple proof to the minimum distance of Z_4-Linear Goethals codes,. Journal of Complexity. 297-304.
  • Show author(s) (2001). On t-designs from Codes over Z4. Discrete Mathematics. 67-80.
  • Show author(s) (2001). New 3-Designs from Goethals Codes over Z4. Discrete Mathematics. 403-409.
  • Show author(s) (1999). Split weight enumerators for the Preparata Codes with applications to designs. Designs, Codes and Cryptography. 103-124.
  • Show author(s) (1999). New Infinite Families of 3-Designs from Preparata Codes over Z4. Discrete Mathematics. 139-156.
  • Show author(s) (1999). New Families of Almost Perfect Nonlinear Power Mappings. IEEE Transactions on Information Theory. 475-485.
  • Show author(s) (1998). Two new infinite families of 3-designs from Kerdock codes over Z<SUB>4</SUB>. Designs, Codes and Cryptography. 201-214.
  • Show author(s) (1998). On the weight hierarchy of the Goethals codes over Z<sub>4</sub>. IEEE Transactions on Information Theory. 304-307.
  • Show author(s) (1998). On the linear complexity of Legendre sequences. IEEE Transactions on Information Theory. 1276-1278.
  • Show author(s) (1998). On cyclotomic sequences of order r. Information Processing Letters. 21-25.
  • Show author(s) (1998). New infinite families of 3-designs from Preparta codes over Z<SUB>4</SUB>. Discrete Mathematics. 139-156.
  • Show author(s) (1998). New generalized cyclotomy and its applications. Finite Fields and Their Applications. 140-146.
  • Show author(s) (1998). How to build robust shared control systems. Designs, Codes and Cryptography. 111-124.
  • Show author(s) (1998). An infinite family of 3-designs from Preparta codes over Z<SUB>4</SUB>. Designs, Codes and Cryptography. 175-182.
  • Show author(s) (1997). The Newton radius of codes. IEEE Transactions on Information Theory. 1820-1831.
  • Show author(s) (1997). Some power mappings with low differential uniformity. Applicable Algebra in Engineering, Communication and Computing. 363-370.
  • Show author(s) (1997). On the information function of an error-correcting code. IEEE Transactions on Information Theory. 549-557.
  • Show author(s) (1997). On the [162,8,80] codes. IEEE Transactions on Information Theory. 2055.
  • Show author(s) (1997). On the Weight Hierarchy of Preparata Codes Over Z<sub>4</sub>. IEEE Transactions on Information Theory. S. 1832-1842.
  • Show author(s) (1997). An Expansion for the Coordinates of the Trace Function over Galois Rings. Applicable Algebra in Engineering, Communication and Computing. 353-361.
  • Show author(s) (1996). Use characteristic sets to decode cyclic codes up to actual minimum distance. London Mathematical Society Lecture Notes. 297.
  • Show author(s) (1996). Use Characteristic Sets to Decode Cyclic Codes up to Actual Minimum Distance. London Mathematical Society Lecture Notes. 297-312.
  • Show author(s) (1996). Upper Bound for a Hybrid Sum Over Galois Rings with Applications to Aperiodic Correlation of Some q-ary Sequences. IEEE Transactions on Information Theory. 250-?.
  • Show author(s) (1996). The weight hierarchies of some product codes. IEEE Transactions on Information Theory. 1029-1034.
  • Show author(s) (1996). The uniqueness of [87,5,57;3]-codes and the nonexistence of [258,6,171;3]-codes. Journal of Statistical Planning and Inference. 105-127.
  • Show author(s) (1996). On the Weight Hierarchy of the semiprimitive codes. Discrete Mathematics. 185-190.
  • Show author(s) (1996). On the Weight Hierarchy of Kerdock Codes over Z%4. IEEE Transactions on Information Theory. 1587.
  • Show author(s) (1996). Large families of quaternary sequences with low correlation. IEEE Transactions on Information Theory. 579-592.
  • Show author(s) (1996). Improved Estimates via Exponential Sums for the Minimum Distance of Z%_4-Linear Trace Codes. IEEE Transactions on Information Theory. 1212.
  • Show author(s) (1996). Improved Binary Codes and Sequence Families from Z%4-Linear Codes. IEEE Transactions on Information Theory. 1582.
  • Show author(s) (1996). Exponential sums over Galois rings and their applications. London Mathematical Society Lecture Notes. 109.
  • Show author(s) (1996). De Bruijn sequences, irreducible codes and cyclotomy. Discrete Mathematics. 143-154.
  • Show author(s) (1996). Cyclic codes over Z%e, locator polynomials, and Newton's identities. IEEE Transactions on Information Theory. 217-226.
  • Show author(s) (1996). Codes with the same weight distributions as the Goethals codes and the Delsarte-Goethals codes. Designs, Codes and Cryptography. 257-266.
  • Show author(s) (1996). A characterization of (3v%b+v%e, 3v%a+v%d;4,3)-minihyphers and projective ternary (78,5,51) codes. Mathematica Japonica.
  • Show author(s) (1995). The weight of the Kasami codes. Discrete Mathematics. 133-143.
  • Show author(s) (1995). Construction of some optimal ternary linear codes and the uniqueness of @<294,6,195:3@>-codes meeting the Griesmer bound. Finite Fields and Their Applications. 458-468.
  • Show author(s) (1995). Bounds on the Minimum Support Weights. IEEE Transactions on Information Theory. 432-440.
  • Show author(s) (1995). An Upper Bound for Weil Exponential Sums over Galois Rings and Applications. IEEE Transactions on Information Theory. 456.
  • Show author(s) (1995). A characterization of some @(v%b+v%c+2v%d,v%a+v%b+2v%c;4,3@)-minihypers and some @<90,5,59:3@>-codes meeting the Griesmer bound. Mathematica Japonica. 657-672.
  • Show author(s) (1994). Use of Gr@øbner Bases to Decode Binary Cyclic Codes up to the True Minimum Distance. IEEE Transactions on Information Theory. 1654-1661.
  • Show author(s) (1994). Generalizations of the Griesmer bound. Error Control, Cryptography and Speech Compression. Lecture Notes in Computer Science (LNCS). 41-52.
  • Show author(s) (1994). General Principles for the Algebraic Decoding of Cyclic Codes. IEEE Transactions on Information Theory. 1661-1663.
  • Show author(s) (1994). Algebraic decoding of binary cyclic codes: A polynomial point of view. Contemporary Mathematics. 15-21.
  • Show author(s) (1994). A characterization of some Temary Codes Meeting the Griesmer Bound. Contemporary Mathematics. 139-150.
  • Show author(s) (1993). There are exact two nonequivalent @<20,5,12;3@>-codes. Ars combinatoria. 3-14.
  • Show author(s) (1993). The nonexistence of @<51,5,33;3@>-codes. Ars combinatoria. 25-32.
  • Show author(s) (1993). A new class of nonbinary codes meeting the Griesmer bound. Discrete Applied Mathematics. 219-226.
  • Show author(s) (1993). A characterization of some q-ary codes (GF(q),q>(h-1)%2,h@Z3). Mathematica Japonica. 925-940.
  • Show author(s) (1993). A characterization of some @(v%c+2v%d,v%b2v%c;k-1,3@)- minihypers and some (v%<k%>-30,k,3%(k-1%)-21;3)-codes meeting the Griesmer bound. Journal of Statistical Planning and Inference. 387-402.
  • Show author(s) (1993). A characterization of @(2(q+1)+2,2,2;t,q@)-minihypers in PG(t,q)(t@Z3,q_e@(3,4@)). Discrete Mathematics. 175-185.
  • Show author(s) (1992). Projective codes meeting the Griesmer bound. Discrete Mathematics. 265-271.
  • Show author(s) (1992). On the construction of @<q%4 + q%2 - q,5,q%4 - q%3 + q%2 - 2q;q@>codes meeting the Griesmer bound. Designs, Codes and Cryptography. 225-229.
  • Show author(s) (1992). Legendre sums and codes related to QR codes. Discrete Mathematics. 107-113.
  • Show author(s) (1992). Generalized Hamming weights of linear codes. IEEE Transactions on Information Theory. 1133-1140.
  • Show author(s) (1992). A characterization of some linear codes over GF(4) meeting the Griesmer bound. Mathematica Japonica. 231-242.
  • Show author(s) (1992). A characterization of some @(2v%<_a+1%> + v%<_g+1%>, 2v%<_a%> + v_g; k-1,3@)-minihypers and some (n,k,3%(k-1%) - 2@.3%(_a%) - 3%(_g%);3) -codes (k @Z 3,0 @z _a <_g < k - 1) meeting the Griesmer bound. Discrete Mathematics. 67-81.
  • Show author(s) (1991). The number of cross-join pairs in maximum lenght linear sequences. IEEE Transactions on Information Theory.
Academic lecture
  • Show author(s) (2003). The simplex codes are not optimal for binary symmetric channels.
  • Show author(s) (2003). Separating and intersectiong properties of BCH and Kasami codes.
  • Show author(s) (2003). New family of p-ary sequences with optimal correlation property and large linear span.
  • Show author(s) (2003). Improved fast correlation attack using low rate codes.
  • Show author(s) (2003). Error-correction capability of binary linear codes.
  • Show author(s) (2003). Error-correction capability of binary linear codes.
  • Show author(s) (2003). Bounds on error-correction capability of codes beyond half the minimum distance.
  • Show author(s) (2003). A coset count that proves that the simplex codes are not optimal for error correction.
  • Show author(s) (2002). Pairs of $M$-sequences with a six-valued crosscorrelation.
  • Show author(s) (2002). On the p-ranks and Characteristic Polynomials of Cyclic Difference Sets.
  • Show author(s) (2002). On $p$-ary bent functions defined on finite fields.
  • Show author(s) (2002). New Nonbinary Sequences with Ideal Two-Level Autocorrelation Function.
  • Show author(s) (2002). Linear Complexity over F_p and Trace Representation of Lempel-Cohn-Eastman Sequences.
  • Show author(s) (2001). Sequences with ideal autocorrelation.
  • Show author(s) (2001). Sequences with good correlations and some open problems.
  • Show author(s) (2001). Sequences with good correlation properties and open problems.
  • Show author(s) (2001). Ordered orthogonal arrays of strength 4 and 5 from double-error-correcting BCH codes.
  • Show author(s) (2001). Correlation of m-sequences and related topics.
  • Show author(s) (2001). Codes and minihypers.
  • Show author(s) (2000). Ternary m-sequences with three-valued crosscorrelation function: two new decimations.
  • Show author(s) (2000). On some ternary m-sequences with good autocorrelation and crosscorrelation.
  • Show author(s) (2000). On Z_4-linear Goethals codes Kloosterman sums and Dickson polynomials.
  • Show author(s) (2000). Balanced and almost balanced binary sequences of period p^m-1 with optimal autocorrelation using the polynomial (x+1)^d+az^d+b over GF(p^m).
  • Show author(s) (2000). A new family of ternary sequences with ideal two-level autocorrelation function.
  • Show author(s) (1998). Some 3-designs from Goethals codes over Z<SUB>4</SUB>.
  • Show author(s) (1998). On the crosscorrelation of <i>m</i>-sequences and related topics.
  • Show author(s) (1998). On the coset weight distributions of the Z<SUB>4</SUB>-linear Goethals codes.
  • Show author(s) (1998). Kerdock codes over C<SUB>4</SUB> and their applications to designs.
  • Show author(s) (1998). Correlation distribution of the quaternary Kasami sequences.
  • Show author(s) (1997). The Algebraic Decoding of the Z<sub>4</sub>-Linear Calderbank-McGuire Code.
  • Show author(s) (1997). On the weight hierarchy of some codes over Z<sub>4</sub>.
  • Show author(s) (1997). On the information function of an error correcting code.
  • Show author(s) (1997). On the Minimum Support Weights of Goethals Codes over Z<sub>4</sub>.
  • Show author(s) (1997). On the Generalized Hamming Weights for Preparata Codes over Z<sub>4</sub>.
  • Show author(s) (1997). An Expansion for the Coordinates of the Trace Function over Galois Rings.
  • Show author(s) (1996). Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings.
  • Show author(s) (1996). Two New Binary Optimal 8-Dimensional Codes.
  • Show author(s) (1996). The Newton radius of equidistant codes.
  • Show author(s) (1995). The nonexistence of ternary @<270,6,179@> codes and @<309,6,205@> codes.
  • Show author(s) (1995). The Generalized Hamming Weight of Some BCH Codes and Related Codes.
  • Show author(s) (1995). The Algebraic Decoding of the Z%e-Linear Goethals Code.
  • Show author(s) (1995). On Gr@øbner Bases of the Error-Locator Ideal of Hermitian Codes.
  • Show author(s) (1995). New Codes with the Same Weight Distributions as the Coethals Codes and the Delsarte-Goethals Codes.
  • Show author(s) (1995). Improved Estimates for the Minimum Distance of Weighted Degree Z%e Trace Codes.
  • Show author(s) (1995). An Upper Bound for the Extended Kloosterman Sums over Galois Rings.
  • Show author(s) (1995). An Upper Bound for the Aperiodic Correlation of Weighted-Degree CDMA Sequences.
  • Show author(s) (1995). A characterization of @(3v%b + v%e,3v%a + v%d;4,3@)-minihypers and projective ternary @<78,5,51@> codes.
  • Show author(s) (1995). A New Proof of the Minimum Distance of the Quaternary Preparato Code and Goethals Code.
  • Show author(s) (1994). The weight hierarchy of semiprimitive codes.
  • Show author(s) (1994). The weight hierarchy of Kasami codes.
  • Show author(s) (1994). Large families of quaternary sequences with low correlation.
  • Show author(s) (1994). An upper bound for some exponential sums over Galois rings.
  • Show author(s) (1994). Algebraic Decoding of the Goethals Code.
  • Show author(s) (1993). DeBruijn sequences, Irreducible Codes and Cyclotomy.
  • Show author(s) (1993). A charavterization of some tenary codes meeting the Grismer bound.
  • Show author(s) (1993). A characterization of some temary codes meeting the Grismer bound.
  • Show author(s) (1992). On the construction of @<q%3 - q%2 + 1,4,q%3 -2q%2 + q;q@> - codes meeting the Griesmer bound.
  • Show author(s) (1992). Codes, weight hierarchies and chains.
  • Show author(s) (1992). Codes and the chain condition.
  • Show author(s) (1991). A new class of nonbinary codes meeting the Griesmer bound.
Academic anthology/Conference proceedings
  • Show author(s) (2013). Preproceedings, The International Workshop on Coding and Cryptography WCC 2013. Universitetet i Bergen.
  • Show author(s) (2012). Sequences and Their Applications - SETA 2012 7th International Conference Waterloo, ON, Canada, June 2012 Proceedings. Springer.
  • Show author(s) (2010). Arithmetic of Finite Fields, WAIFI 2010. Springer.
  • Show author(s) (2007). 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks. IEEE Press.

More information in national current research information system (CRIStin)