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

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

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 | 212 | 2006 |

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 | 206 | 2001 |

New generalized cyclotomy and its applications C Ding, T Helleseth Finite fields and their applications 4 (2), 140-166, 1998 | 202 | 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 | 189 | 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 | 176 | 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 | 161 | 1999 |

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

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 | 140 | 2016 |

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 | 139 | 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 | 135 | 2001 |

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

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

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 | 123 | 2016 |

A new attack on the filter generator S Ronjom, T Helleseth IEEE Transactions on Information theory 53 (5), 1752-1758, 2007 | 121 | 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 | 119 | 2006 |

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 | 115 | 1994 |

A generic construction of Cartesian authentication codes C Ding, T Helleseth, T Klove, X Wang IEEE transactions on information theory 53 (6), 2229-2235, 2007 | 112 | 2007 |

How to build robust shared control systems R Anderson, C Ding, T Helleseth, T Klove Designs, Codes and Cryptography 15 (2), 111-124, 1998 | 98 | 1998 |