default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTom Høholdt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j28]Peter Beelen
, David G. Glynn, Tom Høholdt, Krishna V. Kaipa:
Counting generalized Reed-Solomon codes. Adv. Math. Commun. 11(4): 777-790 (2017)- 2016
- [i5]Peter Beelen, David G. Glynn, Tom Høholdt, Krishna V. Kaipa:
Counting generalized Reed-Solomon codes. CoRR abs/1611.04341 (2016) - 2015
- [j27]Tom Høholdt, Fernando Piñero, Peng Zeng:
Optimal codes as Tanner codes with cyclic component codes. Des. Codes Cryptogr. 76(1): 37-47 (2015) - [c17]Domingo Gómez-Pérez, Tom Høholdt, Oscar Moreno, Ivelisse Rubio:
Linear complexity for multidimensional arrays - a numerical invariant. ISIT 2015: 2697-2701 - 2014
- [j26]Tom Høholdt, Jørn Justesen:
On the sizes of expander graphs and minimum distances of graph codes. Discret. Math. 325: 38-46 (2014) - 2013
- [j25]Peter Beelen, Tom Høholdt, Johan Sebastian Rosenkilde Nielsen, Yingquan Wu:
On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes. IEEE Trans. Inf. Theory 59(6): 3269-3281 (2013) - [c16]Peter Beelen, Tom Høholdt, Fernando Piñero, Jørn Justesen:
On the dimension of graph codes with Reed-Solomon component codes. ISIT 2013: 1227-1231 - 2012
- [j24]Fernando Hernando, Tom Høholdt, Diego Ruano:
List decoding of matrix-product codes from nested codes: An application to quasi-cyclic codes. Adv. Math. Commun. 6(3): 259-272 (2012) - [j23]Tom Høholdt, Heeralal Janwa:
Eigenvalues and expansion of bipartite graphs. Des. Codes Cryptogr. 65(3): 259-273 (2012) - [j22]Peter Beelen, Sudhir R. Ghorpade, Tom Høholdt:
Duals of Affine Grassmann Codes and Their Relatives. IEEE Trans. Inf. Theory 58(6): 3843-3855 (2012) - [i4]Fernando Hernando, Tom Høholdt, Diego Ruano:
List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codes. CoRR abs/1201.6397 (2012) - [i3]Peter Beelen, Tom Høholdt, Johan Sebastian Rosenkilde Nielsen, Yingquan Wu:
On Rational-Interpolation Based List-Decoding and List-Decoding Binary Goppa Codes. CoRR abs/1211.0122 (2012) - 2011
- [c15]Tom Høholdt, Jørn Justesen:
The Minimum Distance of Graph Codes. IWCC 2011: 201-212 - [i2]Peter Beelen, Sudhir R. Ghorpade, Tom Høholdt:
Duals of Affine Grassmann Codes and their Relatives. CoRR abs/1107.3438 (2011) - 2010
- [j21]Peter Beelen, Sudhir R. Ghorpade, Tom Høholdt:
Affine Grassmann codes. IEEE Trans. Inf. Theory 56(7): 3166-3176 (2010)
2000 – 2009
- 2009
- [c14]Tom Høholdt, Heeralal Janwa:
Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes. AAECC 2009: 53-64 - [e2]Maria Bras-Amorós, Tom Høholdt:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 18th International Symposium, AAECC-18 2009, Tarragona, Catalonia, Spain, June 8-12, 2009. Proceedings. Lecture Notes in Computer Science 5527, Springer 2009, ISBN 978-3-642-02180-0 [contents] - [i1]Peter Beelen, Sudhir R. Ghorpade, Tom Høholdt:
Affine Grassmann Codes. CoRR abs/0911.1298 (2009) - 2008
- [c13]Peter Beelen, Tom Høholdt:
A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm. ICMCTA 2008: 20-32 - [c12]Tom Høholdt:
Codes from Expander Graphs. ICMCTA 2008: 80-81 - 2007
- [j20]Jørn Justesen, Tom Høholdt, Johann Hjaltason:
Iterative List Decoding of Some LDPC Codes. IEEE Trans. Inf. Theory 53(11): 4276-4284 (2007) - [c11]Tom Høholdt, Jørn Justesen:
Iterative List Decoding of LDPC Codes. AAECC 2007: 18-19 - 2006
- [c10]Tom Høholdt:
The Merit Factor Problem for Binary Sequences. AAECC 2006: 51-59 - [c9]Tom Høholdt, Jørn Justesen:
Graph Codes with Reed-Solomon Component Codes. ISIT 2006: 2022-2026 - 2005
- [c8]Tom Høholdt, Jørn Justesen, Bergtor Jonsson:
Euclidean geometry codes, minimum weight words and decodable error-patterns using bit-flipping. ISIT 2005: 2171-2173 - [c7]Jørn Justesen, Tom Høholdt, Johann Hjaltason:
Iterative list decoding. ITW 2005: 90-93 - 2004
- [b1]Jørn Justesen, Tom Høholdt:
A Course In Error-Correcting Codes. EMS textbooks in mathematics, European Mathematical Society 2004, ISBN 978-3-03719-001-2, pp. I-VII, 1-194 - [c6]Jørn Justesen, Christian Thommesen, Tom Høholdt:
Decoding of concatenated codes with interleaved outer codes. ISIT 2004: 329 - [c5]Jørn Justesen, Tom Høholdt:
From concatenated codes to graph codes. ITW 2004: 13-16 - 2003
- [e1]Marc P. C. Fossorier, Tom Høholdt, Alain Poli:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 15th International Symposium, AAECC-15, Toulouse, France, May 12-16, 2003, Proceedings. Lecture Notes in Computer Science 2643, Springer 2003, ISBN 3-540-40111-3 [contents] - 2001
- [j19]Jørn Justesen, Tom Høholdt:
Bounds on list decoding of MDS codes. IEEE Trans. Inf. Theory 47(4): 1604-1609 (2001) - [c4]Olav Geil, Tom Høholdt:
On Hyperbolic Codes. AAECC 2001: 159-171 - 2000
- [j18]Olav Geil, Tom Høholdt:
Footprints or generalized Bezout's theorem. IEEE Trans. Inf. Theory 46(2): 635-641 (2000)
1990 – 1999
- 1999
- [j17]Helge Elbrønd Jensen, Rasmus Refslund Nielsen, Tom Høholdt:
Performance analysis of a decoding algorithm for algebraic-geometry codes. IEEE Trans. Inf. Theory 45(5): 1712-1717 (1999) - [c3]Tom Høholdt, Rasmus Refslund Nielsen:
Decoding Hermitian Codes with Sudan's Algorithm. AAECC 1999: 260-270 - 1998
- [j16]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. IEEE Trans. Inf. Theory 44(4): 1558-1564 (1998) - [j15]Ian F. Blake, Chris Heegard, Tom Høholdt, V. Wei:
Algebraic-Geometry Codes. IEEE Trans. Inf. Theory 44(6): 2596-2618 (1998) - 1997
- [j14]Conny Voss, Tom Høholdt:
An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound: The first steps. IEEE Trans. Inf. Theory 43(1): 128-135 (1997) - [c2]Tom Høholdt, Jacobus H. van Lint, Ruud Pellikaan:
Order Functions and Evaluation Codes. AAECC 1997: 138-150 - 1995
- [j13]Tom Høholdt, Ruud Pellikaan:
On the decoding of algebraic-geometric codes. IEEE Trans. Inf. Theory 41(6): 1589-1614 (1995) - [j12]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. IEEE Trans. Inf. Theory 41(6): 1672-1677 (1995) - [j11]Shojiro Sakata, Helge Elbrønd Jensen, Tom Høholdt:
Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound. IEEE Trans. Inf. Theory 41(6): 1762-1772 (1995) - 1993
- [j10]Helge Elbrønd Jensen, Tom Høholdt, Jørn Justesen:
On the number of correctable errors for some AG-codes. IEEE Trans. Inf. Theory 39(2): 681-684 (1993) - 1992
- [j9]Jørn Justesen, Knud J. Larsen, Helge Elbrønd Jensen, Tom Høholdt:
Fast decoding of codes from algebraic plane curves. IEEE Trans. Inf. Theory 38(1): 111-119 (1992) - 1991
- [j8]Jørn M. Jensen, Helge Elbrønd Jensen, Tom Høholdt:
The merit factor of binary sequences related to difference sets. IEEE Trans. Inf. Theory 37(3): 617-626 (1991)
1980 – 1989
- 1989
- [j7]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. IEEE Trans. Inf. Theory 35(4): 811-821 (1989) - 1988
- [j6]Tom Høholdt, Helge Elbrønd Jensen:
Determination of the merit factor of Legendre sequences. IEEE Trans. Inf. Theory 34(1): 161-164 (1988) - [j5]Helge Elbrønd Jensen, Tom Høholdt, Jørn Justesen:
Double series representation of bounded signals. IEEE Trans. Inf. Theory 34(4): 613-624 (1988) - 1987
- [c1]Helge Elbrønd Jensen, Tom Høholdt:
Binary Sequences with Good Correlation Properties. AAECC 1987: 306-320 - 1986
- [j4]Tom Høholdt, Helge Elbrønd Jensen, Jørn Justesen:
Autocorrelation properties of a class of infinite binary sequences. IEEE Trans. Inf. Theory 32(3): 430-431 (1986) - 1985
- [j3]Tom Høholdt, Helge Elbrønd Jensen, Jørn Justesen:
Aperiodic correlations and the merit factor of a class of binary sequences. IEEE Trans. Inf. Theory 31(4): 549-552 (1985) - 1984
- [j2]Jørn Justesen, Tom Høholdt:
Maxentropic Markov chains. IEEE Trans. Inf. Theory 30(4): 665-667 (1984) - 1983
- [j1]Tom Høholdt, Jørn Justesen:
Ternary sequences with perfect periodic autocorrelation. IEEE Trans. Inf. Theory 29(4): 597-600 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
