Algebraic geometry codes T Høholdt, JH Van Lint, R Pellikaan Handbook of coding theory 1 (Part 1), 871-961, 1998 | 379 | 1998 |

Construction and decoding of a class of algebraic geometry codes J Justesen, KJ Larsen, HE Jensen, A Havemose, T Hoholdt IEEE Transactions on Information Theory 35 (4), 811-821, 1989 | 152 | 1989 |

On the decoding of algebraic-geometric codes T Hoholdt, R Pellikaan IEEE Transactions on Information Theory 41 (6), 1589-1614, 1995 | 127 | 1995 |

A course in error-correcting codes J Justesen, T Høholdt European Mathematical Society, 2004 | 117 | 2004 |

Ternary sequences with perfect periodic autocorrelation (Corresp.) T Hoholdt, J Justesen IEEE Transactions on information theory 29 (4), 597-600, 1983 | 117 | 1983 |

Decoding Reed-Solomon codes beyond half the minimum distance RR Nielsen, T Høholdt Coding Theory, Cryptography and Related Areas, 221-236, 2000 | 112 | 2000 |

Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound S Sakata, HE Jensen, T Hoholdt IEEE Transactions on Information Theory 41 (6), 1762-1768, 1995 | 105 | 1995 |

Fast decoding of codes from algebraic plane curves J Justesen, KJ Larsen, HE Jensen, T Hoholdt IEEE Transactions on Information Theory 38 (1), 111-119, 1992 | 104 | 1992 |

The merit factor of binary sequences related to difference sets JM Jensen, HE Jensen, T Hoholdt IEEE Transactions on Information Theory 37 (3), 617-626, 1991 | 101 | 1991 |

Determination of the merit factor of Legendre sequences T Hoholdt, HE Jensen IEEE transactions on information theory 34 (1), 161-164, 1988 | 101 | 1988 |

Fast decoding of algebraic-geometric codes up to the designed minimum distance S Sakata, J Justesen, Y Madelung, HE Jensen, T Hoholdt IEEE Transactions on Information Theory 41 (6), 1672-1677, 1995 | 96 | 1995 |

Algebraic-geometry codes I Blake, C Heegard, T Hoholdt, V Wei IEEE Transactions on Information Theory 44 (6), 2596-2618, 1998 | 65 | 1998 |

An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps C Voss, T Hoholdt IEEE Transactions on Information Theory 43 (1), 128-135, 1997 | 56 | 1997 |

Decoding Hermitian codes with Sudan’s algorithm T Høholdt, RR Nielsen International Symposium on Applied Algebra, Algebraic Algorithms, and Error …, 1999 | 53 | 1999 |

Bounds on list decoding of MDS codes J Justesen, T Hoholdt IEEE Transactions on Information Theory 47 (4), 1604-1609, 2001 | 50 | 2001 |

Aperiodic correlations and the merit factor of a class of binary sequences (Corresp.) T Hoholdt, H Jensen, J Justesen IEEE transactions on information theory 31 (4), 549-552, 1985 | 48 | 1985 |

Footprints or generalized Bezout's theorem O Geil, T Hoholdt IEEE Transactions on information theory 46 (2), 635-641, 2000 | 44 | 2000 |

A fast decoding method of AG codes from Miura-Kamiya curves Cab up to half the Feng-Rao bound S Sakata, J Justesen, Y Madelung, HE Jensen, T Høholdt Finite Fields and Their Applications 1 (1), 83-101, 1995 | 39 | 1995 |

Maxentropic Markov chains (corresp.) J Justesen, T Hoholdt IEEE transactions on information theory 30 (4), 665-667, 1984 | 38 | 1984 |

The decoding of algebraic geometry codes P Beelen, T Høholdt Advances in algebraic geometry codes 5, 49-98, 2008 | 32 | 2008 |