Search the dblp DataBase
Tom Høholdt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Olav Geil, Tom Høholdt
On Hyperbolic Codes. [Citation Graph (0, 0)][DBLP]
AAECC, 2001, pp:159-171 [Conf] - Tom Høholdt
The Merit Factor Problem for Binary Sequences. [Citation Graph (0, 0)][DBLP]
AAECC, 2006, pp:51-59 [Conf] - Tom Høholdt, Jacobus H. van Lint, Ruud Pellikaan
Order Functions and Evaluation Codes. [Citation Graph (0, 0)][DBLP]
AAECC, 1997, pp:138-150 [Conf] - Tom Høholdt, Rasmus Refslund Nielsen
Decoding Hermitian Codes with Sudan's Algorithm. [Citation Graph (0, 0)][DBLP]
AAECC, 1999, pp:260-270 [Conf] - Helge Elbrønd Jensen, Tom Høholdt
Binary Sequences with Good Correlation Properties. [Citation Graph (0, 0)][DBLP]
AAECC, 1987, pp:306-320 [Conf] - Ian F. Blake, Chris Heegard, Tom Høholdt, V. Wei
Algebraic-Geometry Codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1998, v:44, n:6, pp:2596-2618 [Journal] - Olav Geil, Tom Høholdt
Footprints or generalized Bezout's theorem. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:635-641 [Journal] - Tom Høholdt, Jørn Justesen
Ternary sequences with perfect periodic autocorrelation. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1983, v:29, n:4, pp:597-0 [Journal] - Tom Høholdt, Helge Elbrønd Jensen
Determination of the merit factor of Legendre sequences. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1988, v:34, n:1, pp:161-0 [Journal] - Tom Høholdt, Helge Elbrønd Jensen, Jørn Justesen
Aperiodic correlations and the merit factor of a class of binary sequences. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1985, v:31, n:4, pp:549-0 [Journal] - Tom Høholdt, Helge Elbrønd Jensen, Jørn Justesen
Autocorrelation properties of a class of infinite binary sequences. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1986, v:32, n:3, pp:430-0 [Journal] - Tom Høholdt, Ruud Pellikaan
On the decoding of algebraic-geometric codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1589-1614 [Journal] - Helge Elbrønd Jensen, Tom Høholdt, Jørn Justesen
Double series representation of bounded signals. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1988, v:34, n:4, pp:613-624 [Journal] - Helge Elbrønd Jensen, Tom Høholdt, Jørn Justesen
On the number of correctable errors for some AG-codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:681-0 [Journal] - Jørn M. Jensen, Helge Elbrønd Jensen, Tom Høholdt
The merit factor of binary sequences related to difference sets. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:617-626 [Journal] - Helge Elbrønd Jensen, Rasmus Refslund Nielsen, Tom Høholdt
Performance analysis of a decoding algorithm for algebraic-geometry codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1999, v:45, n:5, pp:1712-1717 [Journal] - Jørn Justesen, Knud J. Larsen, Helge Elbrønd Jensen, Allan Havemose, Tom Høholdt
Construction and decoding of a class of algebraic geometry codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:811-821 [Journal] - Jørn Justesen, Tom Høholdt
Bounds on list decoding of MDS codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1604-1609 [Journal] - Jørn Justesen, Tom Høholdt
Maxentropic Markov chains. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1984, v:30, n:4, pp:665-0 [Journal] - Jørn Justesen, Knud J. Larsen, Helge Elbrønd Jensen, Tom Høholdt
Fast decoding of codes from algebraic plane curves. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1992, v:38, n:1, pp:111-119 [Journal] - Shojiro Sakata, Helge Elbrønd Jensen, Tom Høholdt
Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1762-1772 [Journal] - Shojiro Sakata, Jørn Justesen, Y. Madelung, Helge Elbrønd Jensen, Tom Høholdt
Fast decoding of algebraic-geometric codes up to the designed minimum distance. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1672-1677 [Journal] - Shojiro Sakata, Douglas A. Leonard, Helge Elbrønd Jensen, Tom Høholdt
Fast Erasure-and-Error Decoding of Algebraic Geometry Codes up to the Feng-Rao Bound. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1998, v:44, n:4, pp:1558-1564 [Journal] - Conny Voss, Tom Høholdt
An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound: The first steps. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:128-135 [Journal]
Iterative List Decoding of LDPC Codes. [Citation Graph (, )][DBLP]
Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes. [Citation Graph (, )][DBLP]
Codes from Expander Graphs. [Citation Graph (, )][DBLP]
A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm. [Citation Graph (, )][DBLP]
Affine Grassmann Codes [Citation Graph (, )][DBLP]
Search in 0.019secs, Finished in 0.021secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002