THE WEIGHT ENUMERATOR POLYNOMIALS OF SOME CLASSES OF CODES WITH COMPOSITE PARITY-CHECK POLYNOMIALS.HELLESETH T.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 20; NO 1; PP. 21-31; BIBL. 6 REF.Article

SOME TWO-WEIGHT CODES WITH COMPOSITE PARITY-CHECK POLYNOMIALS.HELLESETH T.1976; I.E.E.E., TRANS. INFORM. THEORY; U.S.A.; DA. 1976; VOL. 22; NO 5; PP. 631-632; BIBL. 5 REF.Article

THE WEIGHT DISTRIBUTION OF THE COSET LEADERS FOR SOME CLASSES OF CODES WITH RELATED PARITY-CHECK MATRICESHELLESETH T.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 28; NO 2; PP. 161-171; BIBL. 8 REF.Article

A NOTE ON THE CROSS-CORRELATION FUNCTION BETWEEN TWO BINARY MAXIMAL LENGTH LINEAR SEQUENCESHELLESETH T.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 23; NO 3; PP. 301-307; BIBL. 7 REF.Article

On the covering radius of cyclic linear codes and arithmetic codesHELLESETH, T.Discrete applied mathematics. 1985, Vol 11, Num 2, pp 157-173, issn 0166-218XArticle

Further classifications of codes meeting the Griesmer boundHELLESETH, T.IEEE transactions on information theory. 1984, Vol 30, Num 2, pp 395-403, issn 0018-9448Article

ON GROUP-THEORETIC CODES FOR ASYMMETRIC CHANNELSHELLESETH T; KLOEVE T.1981; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 49; NO 1; PP. 1-9; BIBL. 17 REF.Article

Projective codes meeting the Griesmer boundHELLESETH, T.Discrete mathematics. 1992, Vol 106-7, pp 265-271, issn 0012-365XArticle

THE WEIGHT DISTRIBUTION OF IRREDUCIBLE CYCLIC CODES WITH BLOCK LENGTHS N₁(Q-1)/N).HELLESETH T; KL NONOVE T; MYKKELTVEIT J et al.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 18; NO 2; PP. 179-211; BIBL. 12 REF.Article

A characterization of some {2v_α+1+v_γ+1,2v_α+v_γ;k-1,3}-minihypers and some (n,k,3^k-1-2.3^α-3^γ;3)-codes (k≥3,0≤α<γ<k-1) meeting the Griesmer boundHAMADA, N; HELLESETH, T.Discrete mathematics. 1992, Vol 104, Num 1, pp 67-81, issn 0012-365XArticle

The number of cross-join pairs in maximum length linear sequencesHELLESETH, T; KLØVE, T.IEEE transactions on information theory. 1991, Vol 37, Num 6, pp 1731-1733, issn 0018-9448Article

Binary sequences of period 2^m - 1 with large linear complexityHELLESETH, T; MARTINSEN, H. M.Information and computation (Print). 1999, Vol 151, Num 1-2, pp 73-91, issn 0890-5401Article

A characterization of some {ν₂+2ν₃, ν₁+2ν₂; k-1,3}minihypers and some (ν_k-30,k,3^k-1-21;3)-codes meeting the Griesmer bound = A characterization of some {v₂+2v₃, v₁+2v₂; k-1,3} - minihypers and some (v_k-30,k,3^k-1-21; 3) - codes meeting the Griesmer boundHAMADA, N; HELLESETH, T.Journal of statistical planning and inference. 1993, Vol 34, Num 3, pp 387-402, issn 0378-3758Article

There is no binary [25, 8, 10] codeYTREHUS, Ø; HELLESETH, T.IEEE transactions on information theory. 1990, Vol 36, Num 3, pp 695-696, issn 0018-9448Article

Kerdock codes over Z₄ and their application to designsYANG, K; HELLESETH, T.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 399Conference Paper

Characterization of {2(q+1)+2,2; t,q}-minihypers in PG(t,q) t≥3,q∈{3,4}HAMADA, N; HELLESETH, T; YTREHUS, O et al.Discrete mathematics. 1993, Vol 115, Num 1-3, pp 175-185, issn 0012-365XArticle

A new class of nonbinary codes meeting the Griesmer boundHAMADA, N; HELLESETH, T; YTREHUS, Ø et al.Discrete applied mathematics. 1993, Vol 47, Num 3, pp 219-226, issn 0166-218XArticle

On the cosets of the simplex codeHELLESETH, T; MATTSON, H. F. JR.Discrete mathematics. 1985, Vol 56, Num 2-3, pp 169-189, issn 0012-365XArticle

Bounds on the minimum support weightsHELLESETH, T; KLØVE, T; LEVENSHTEIN, V. I et al.IEEE transactions on information theory. 1995, Vol 41, Num 2, pp 432-440, issn 0018-9448Article

New bounds on binary linear codes of dimension eightDODUNEKOV, S. M; HELLESETH, T; MANEV, N et al.IEEE transactions on information theory. 1987, Vol 33, Num 6, pp 917-919, issn 0018-9448Article

General principles for the algebraic decoding of cyclic codesXUEMIN CHEN; REED, I. S; HELLESETH, T et al.IEEE transactions on information theory. 1994, Vol 40, Num 5, pp 1661-1663, issn 0018-9448Article

Use of Gröbner bases to decode binary cyclic codes up to the true minimum distanceXUEMIN CHEN; REED, I. S; HELLESETH, T et al.IEEE transactions on information theory. 1994, Vol 40, Num 5, pp 1654-1661, issn 0018-9448Article

Logarithm Cartesian authentication codesSZE, T. W; CHANSON, S; DING, C et al.Information and computation (Print). 2003, Vol 184, Num 1, pp 93-108, issn 0890-5401, 16 p.Article