| Algebraic geometry codes T Høholdt, JH Van Lint, R Pellikaan Handbook of coding theory 1 (Part 1), 871-961, 1998 | 449 | 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 | 179 | 1989 |
| A course in error-correcting codes J Justesen, T Høholdt European Mathematical Society, 2004 | 159 | 2004 |
| On the decoding of algebraic-geometric codes T Hoholdt, R Pellikaan IEEE Transactions on Information Theory 41 (6), 1589-1614, 1995 | 150 | 1995 |
| Ternary sequences with perfect periodic autocorrelation (Corresp.) T Hoholdt, J Justesen IEEE Transactions on Information Theory 29 (4), 597-600, 1983 | 127 | 1983 |
| Decoding Reed-Solomon codes beyond half the minimum distance RR Nielsen, T Høholdt Coding Theory, Cryptography and Related Areas: Proceedings of an …, 2000 | 122 | 2000 |
| Determination of the merit factor of Legendre sequences T Hoholdt, HE Jensen IEEE Transactions on Information Theory 34 (1), 161-164, 1988 | 118 | 1988 |
| 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 | 114 | 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 | 112 | 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 | 111 | 1991 |
| 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 | 109 | 1995 |
| Algebraic-geometry codes I Blake, C Heegard, T Hoholdt, V Wei IEEE Transactions on Information Theory 44 (6), 2596-2618, 1998 | 76 | 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 | 63 | 1997 |
| Decoding Hermitian codes with Sudan’s algorithm T Høholdt, RR Nielsen International Symposium on Applied Algebra, Algebraic Algorithms, and Error …, 1999 | 61 | 1999 |
| Bounds on list decoding of MDS codes J Justesen, T Hoholdt IEEE Transactions on Information Theory 47 (4), 1604-1609, 2001 | 58 | 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 | 57 | 1985 |
| Footprints or generalized Bezout's theorem O Geil, T Hoholdt IEEE Transactions on information theory 46 (2), 635-641, 2000 | 55 | 2000 |
| Maxentropic Markov chains (corresp.) J Justesen, T Hoholdt IEEE transactions on information theory 30 (4), 665-667, 1984 | 50 | 1984 |
| The decoding of algebraic geometry codes P Beelen, T Høholdt Advances in algebraic geometry codes 5, 49-98, 2008 | 44 | 2008 |
| 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 | 40 | 1995 |
Peter BeelenTechnical University of DenmarkVerified email at dtu.dk
