Sequences with low correlation T Helleseth Handbook of coding theory, 1998 | 447 | 1998 |

Some results about the cross-correlation function between two maximal linear sequences T Helleseth Discrete Mathematics 16 (3), 209-232, 1976 | 319 | 1976 |

Almost difference sets and their sequences with optimal autocorrelation KT Arasu, C Ding, T Helleseth, PV Kumar, HM Martinsen IEEE transactions on information theory 47 (7), 2934-2943, 2001 | 194 | 2001 |

Monomial and quadratic bent functions over the finite fields of odd characteristic T Helleseth, A Kholosha IEEE Transactions on Information Theory 52 (5), 2018-2032, 2006 | 193 | 2006 |

New generalized cyclotomy and its applications C Ding, T Helleseth Finite fields and their applications 4 (2), 140-166, 1998 | 188 | 1998 |

The weight distribution of irreducible cyclic codes with block lengths n1 ((q1− 1) N) T Helleseth, T Kløve, J Mykkeltveit Discrete Mathematics 18 (2), 179-211, 1977 | 183 | 1977 |

An upper bound for Weil exponential sums over Galois rings and applications PV Kumar, T Helleseth, AR Calderbank IEEE transactions on Information Theory 41 (2), 456-468, 1995 | 164 | 1995 |

Several classes of binary sequences with three-level autocorrelation C Ding, T Helleseth, KY Lam IEEE Transactions on Information Theory 45 (7), 2606-2612, 1999 | 155 | 1999 |

Generalized Hamming weights of linear codes T Helleseth, T Klove, Ø Ytrehus IEEE transactions on information theory 38 (3), 1133-1140, 1992 | 142 | 1992 |

Large families of quaternary sequences with low correlation PV Kumar, T Helleseth, AR Calderbank, AR Hammons IEEE transactions on Information Theory 42 (2), 579-592, 1996 | 140 | 1996 |

New families of binary sequences with optimal three-level autocorrelation C Ding, T Helleseth, H Martinsen IEEE Transactions on Information Theory 47 (1), 428-433, 2001 | 126 | 2001 |

On the covering radius of binary codes (corresp.) T Helleseth, T Klove, J Mykkeltveit IEEE Transactions on Information Theory 24 (5), 627-628, 1978 | 123 | 1978 |

Linear codes with two or three weights from quadratic bent functions Z Zhou, N Li, C Fan, T Helleseth Designs, Codes and Cryptography 81 (2), 283-295, 2016 | 116 | 2016 |

A new attack on the filter generator S Ronjom, T Helleseth IEEE Transactions on Information theory 53 (5), 1752-1758, 2007 | 115 | 2007 |

Niho type cross-correlation functions via Dickson polynomials and Kloosterman sums H Dobbertin, P Felke, T Helleseth, P Rosendahl IEEE transactions on information theory 52 (2), 613-627, 2006 | 113 | 2006 |

New families of almost perfect nonlinear power mappings T Helleseth, C Rong, D Sandberg IEEE transactions on Information Theory 45 (2), 475-485, 1999 | 112 | 1999 |

Use of Grobner bases to decode binary cyclic codes up to the true minimum distance X Chen, IS Reed, T Helleseth, TK Truong IEEE Transactions on Information Theory 40 (5), 1654-1661, 1994 | 112 | 1994 |

New nonbinary sequences with ideal two-level autocorrelation T Helleseth, G Gong IEEE Transactions on Information Theory 48 (11), 2868-2872, 2002 | 94 | 2002 |

Linear codes with two or three weights from weakly regular bent functions C Tang, N Li, Y Qi, Z Zhou, T Helleseth IEEE Transactions on Information Theory 62 (3), 1166-1176, 2016 | 93 | 2016 |

On the covering radius of cyclic linear codes and arithmetic codes T Helleseth Discrete Applied Mathematics 11 (2), 157-173, 1985 | 89 | 1985 |