Home
Tor Helleseth's picture

Tor Helleseth

Professor Emeritus
  • E-mailTor.Helleseth@uib.no
  • Phone+47 55 58 41 60
  • Visitor Address
    HIB - Thormøhlens gate 55
  • Postal Address
    Postboks 7803
    5020 Bergen
Academic article
  • Show author(s) 2013. State space cryptanalysis of the MICKEY cipher. Information Theory and Applications.
  • 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) 2012. Generalized bent functions and their relation to Maiorana-McFarland class. IEEE International Symposium on Information Theory. Proceedings. 4 pages.
  • Show author(s) 2012. Binary Niho sequences with four-valued cross correlations. 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. Sequences, bent functions and Jacobsthal sums. Lecture Notes in Computer Science (LNCS). 416-429.
  • 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. Algebraic Attack on the Alternating Step(r,s) Generator. IEEE International Symposium on Information Theory. Proceedings. 2493-2497.
  • Show author(s) 2009. Linear and nonlinear sequences and applications to stream ciphers. Contemporary Mathematics. 21-45.
  • Show author(s) 2008. On the correlation distribution of Kerdock sequences. Lecture Notes in Computer Science (LNCS). 121-129.
  • Show author(s) 2008. New perfect nonlinear multinomials over F_p^{2k}}for any odd prime p. Lecture Notes in Computer Science (LNCS). 403-414.
  • Show author(s) 2008. Cascade Jump Controlled Sequence Generator and Pomaranch Stream Cipher. Lecture Notes in Computer Science (LNCS). 224-243.
  • Show author(s) 2008. $m$-Sequences of Lengths $2^{2k}-1$ and $2^k-1$ with at Most Four-Valued Cross Correlation. Lecture Notes in Computer Science (LNCS). 106-120.
  • Show author(s) 2007. The linear vector space spanned by the nonlinear filter generator. Lecture Notes in Computer Science (LNCS). 169-183.
  • 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 attacks on filtering generators using linear subspace structures. Lecture Notes in Computer Science (LNCS). 204-217.
  • 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 family of Gold-like sequences. Lecture Notes in Computer Science (LNCS). 62-69.
  • 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. Linear properties in T-functions. IEEE Transactions on Information Theory. 5151-5157.
  • 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. The second support weight distribution of the Kasami codes. IEEE Transactions on Information Theory. 2892-2894.
  • 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) 2005. Error-correction capability of binary linear codes. IEEE Transactions on Information Theory. 1408-1423.
  • Show author(s) 2004. The simplex codes and other even-weight binary linear codes for error correction. IEEE Transactions on Information Theory. 2818-2823.
  • Show author(s) 2004. On weight distributions of shifts of Goethals-like codes. Problems of Information Transmission. 118-134.
  • Show author(s) 2004. On the p-ranks and characteristic polynomials of cyclic difference sets. Designs, Codes and Cryptography. 23-37.
  • Show author(s) 2004. On the p-rank and characteristic polynomials of cyclic difference sets. Designs, Codes and Cryptography. 23-37.
  • Show author(s) 2004. On the minimum distance of array codes as LDPC codes. IEEE Transactions on Information Theory. 3268-3271.
  • Show author(s) 2004. On the (2,1)-separating weight of the Kerdock code. IEEE Transactions on Information Theory. 3312-3315.
  • Show author(s) 2004. On a new identity for Kloosterman sums and nonlinear systems of equations over finite fields over characteristic 2. Discrete Mathematics. 109-124.
  • Show author(s) 2004. New family of p-ary sequences with optimal correlation property and large linear span. IEEE Transactions on Information Theory. 1839-1844.
  • 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. Improved fast correlation attack using low rate codes. Lecture Notes in Computer Science (LNCS). 67-81.
  • Show author(s) 2004. Double circulant quadratic residue codes. IEEE Transactions on Information Theory. 2154-2155.
  • Show author(s) 2004. An improved correlation attack against irregular clocked and filtered keystream generators. Lecture Notes in Computer Science (LNCS). 373-389.
  • Show author(s) 2004. An Assmus-Mattson-type approach for identifying 3-designs from linear codes over Z_4. Designs, Codes and Cryptography. 75-92.
  • 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) 2004. A proof of Simmons's; conjecture. Designs, Codes and Cryptography. 39-43.
  • Show author(s) 2003. Separating and intersecting properties of BCH and Kasami codes. Lecture Notes in Computer Science (LNCS). 52-65.
  • Show author(s) 2003. On the minimum distance of array codes as LDPC codes. IEEE Transactions on Information Theory. 3268-3272.
  • Show author(s) 2003. Logarithm Cartesian Authentication Codes. Information and Computation. 93-108.
  • Show author(s) 2003. Logarithm Cartesian Authentication Codes. Information and Computation. 93-108.
  • Show author(s) 2003. Linear complexity over $F_p$ and trace representation of Lempel-Cohn-Eastman sequences. IEEE Transactions on Information Theory. 1548-1552.
  • Show author(s) 2003. Hypercubic 4 and 5-designs from double-error-correcting BCH codes. Designs, Codes and Cryptography. 265-282.
  • Show author(s) 2003. 3-Designs from the $Z_4$ Goethals codes via a new Kloosterman sum identity. Designs, Codes and Cryptography. 247-263.
  • Show author(s) 2002. The nonexistence of a ternary [97,6,63] code. Journal of Statistical Planning and Inference. 485-507.
  • Show author(s) 2002. The minimum distance of the duals of the binary irreducible codes. IEEE Transactions on Information Theory. 2679-2689.
  • Show author(s) 2002. New nonbinary sequences with ideal two-level autocorrelation function. IEEE Transactions on Information Theory. 2868-2872.
  • Show author(s) 2001. Ternary m-sequences with three-valued crosscorrelation function: Two new decimations. IEEE Transactions on Information Theory. 1472-1482.
  • Show author(s) 2001. On t-designs from Codes over Z4. Discrete Mathematics. 67-80.
  • Show author(s) 2001. On t-designs from Codes over Z4. Discrete Mathematics. 67-80.
  • Show author(s) 2001. On t-designs for codes over Z_4. Discrete Mathematics. 67-80.
  • Show author(s) 2001. On coset weight distribution of the $Z_4$-linear Goethals code. IEEE Transactions on Information Theory. 1758-1773.
  • Show author(s) 2001. New families of binary sequences with optimal three-level autocorrelation. IEEE Transactions on Information Theory. 428-433.
  • Show author(s) 2001. New construction for binary sequences of period $p^m-1$ with optimal autocorrelation using $(z+1)^d+az^d+b$. IEEE Transactions on Information Theory. 1638-1644.
  • Show author(s) 2001. New 3-designs for Goethals codes over $Z_4$. Discrete Mathematics. 403-409.
  • Show author(s) 2001. New 3-Designs from Goethals Codes over Z4. Discrete Mathematics. 403-409.
  • Show author(s) 2001. New 3-Designs from Goethals Codes over Z4. Discrete Mathematics. 403-409.
  • Show author(s) 2001. Codes with the same coset weight distribution as the $Z_4$-linear Goethals codes. IEEE Transactions on Information Theory. 1589-1596.
  • Show author(s) 2001. A new family of ternary sequences with ideal two-level autocorrelation function. Designs, Codes and Cryptography. 157-166.
  • Show author(s) 2001. 5-Designs for the lifted Golay code over Z_4 via an Assmuss-Mattson-type approach. Discrete Mathematics. 479-487.
  • Show author(s) 2000. There is no ternary [28,6,18] code. IEEE Transactions on Information Theory. 1550-1554.
  • Show author(s) 2000. The nonexistence of some ternary linear codes and some updates of the bounds for n_3(6,d), 1<=d<=243. Mathematica Japonica. 31-43.
  • Show author(s) 2000. On a conjectured ideal autocorrelation sequence and a relation to a triple-error-correcting cyclic code,. IEEE Transactions on Information Theory. 474-485.
  • Show author(s) 2000. Duadic sequences of prime lengths. Discrete Mathematics. 33-49.
  • Show author(s) 2000. Arcs, blocking sets and minihypers. Computers and Mathematics with Applications. 157-169.
  • 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. 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 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) 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.
  • Show author(s) 1981. On group-theoretic codes for asymmetric channels. Information and Computation. 1-9.
  • Show author(s) 1978. On the covering radius of binary codes. IEEE Transactions on Information Theory. 627-628.
  • Show author(s) 1977. The weight distribution of irreducible cyclic codes with block lengths n_1((q^l-1)/N). Discrete Mathematics. 179-211.
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)