default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJørn Justesen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j38]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
- [c11]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 - 2011
- [j37]Jørn Justesen:
Performance of Product Codes and Related Structures with Iterated Decoding. IEEE Trans. Commun. 59(2): 407-415 (2011) - [c10]Tom Høholdt, Jørn Justesen:
The Minimum Distance of Graph Codes. IWCC 2011: 201-212 - 2010
- [b2]Jørn Justesen, Søren Forchhammer:
Two-Dimensional Information Theory and Coding - With Application to Graphics Data and High-Density Storage Media. Cambridge University Press 2010, ISBN 978-0-521-88860-8, pp. I-IX, 1-171 - [j36]Jørn Justesen, Knud J. Larsen, Lars A. Pedersen:
Error correcting coding for OTN. IEEE Commun. Mag. 48(9): 70-75 (2010)
2000 – 2009
- 2009
- [j35]Søren Forchhammer, Jørn Justesen:
Block pickard models for two-dimensional constraints. IEEE Trans. Inf. Theory 55(10): 4626-4634 (2009) - 2007
- [j34]Jørn Justesen:
Upper Bounds on the Number of Errors Corrected by the Koetter-Vardy Algorithm. IEEE Trans. Inf. Theory 53(8): 2881-2885 (2007) - [j33]Jørn Justesen, Tom Høholdt, Johann Hjaltason:
Iterative List Decoding of Some LDPC Codes. IEEE Trans. Inf. Theory 53(11): 4276-4284 (2007) - [c9]Tom Høholdt, Jørn Justesen:
Iterative List Decoding of LDPC Codes. AAECC 2007: 18-19 - 2006
- [c8]Tom Høholdt, Jørn Justesen:
Graph Codes with Reed-Solomon Component Codes. ISIT 2006: 2022-2026 - 2005
- [j32]Jørn Justesen:
Fields from Markov chains. IEEE Trans. Inf. Theory 51(12): 4358-4362 (2005) - [c7]Jørn Justesen:
Soft-decision decoding of RS codes. ISIT 2005: 1183-1185 - [c6]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 - [c5]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 - [j31]Jørn Justesen:
Upper bounds on the number of errors corrected by a convolutional code. IEEE Trans. Inf. Theory 50(2): 350-353 (2004) - [c4]Jørn Justesen:
Finite state models of constrained 2D data. ISIT 2004: 160 - [c3]Jørn Justesen, Christian Thommesen, Tom Høholdt:
Decoding of concatenated codes with interleaved outer codes. ISIT 2004: 329 - [c2]Jørn Justesen, Tom Høholdt:
From concatenated codes to graph codes. ITW 2004: 13-16 - 2001
- [j30]Jørn Justesen:
Calculation of power spectra for block coded signals. IEEE Trans. Commun. 49(3): 389-392 (2001) - [j29]Alexander Barg, Jørn Justesen, Christian Thommesen:
Concatenated codes with fixed inner code and random outer code. IEEE Trans. Inf. Theory 47(1): 361-365 (2001) - [j28]Jørn Justesen, Tom Høholdt:
Bounds on list decoding of MDS codes. IEEE Trans. Inf. Theory 47(4): 1604-1609 (2001) - 2000
- [j27]Søren Forchhammer, Jørn Justesen:
Bounds on the capacity of constrained two-dimensional codes. IEEE Trans. Inf. Theory 46(7): 2659-2666 (2000)
1990 – 1999
- 1999
- [j26]Søren Forchhammer, Jørn Justesen:
Entropy Bounds for Constrained Two-Dimensional Random Fields. IEEE Trans. Inf. Theory 45(1): 118-127 (1999) - 1998
- [j25]Jørn Justesen, Jakob Dahl Andersen:
Critical Lengths of Error Events in Convolutional Codes. IEEE Trans. Inf. Theory 44(4): 1608-1611 (1998) - 1995
- [j24]Gilles Lachaud, Michael A. Tsfasman, Jørn Justesen, Victor K.-W. Wei:
Introduction to the special issue on algebraic geometry codes. IEEE Trans. Inf. Theory 41(6): 1545-1547 (1995) - [j23]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) - [c1]Victor V. Zyablov, Sergo Shavgulidze, Jørn Justesen:
Some Constructions of Generalised Concatenated Codes Based on Unit Memory Codes. IMACC 1995: 237-256 - 1993
- [j22]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) - [j21]Jørn Justesen:
Bounded distance decoding of unit memory codes. IEEE Trans. Inf. Theory 39(5): 1616-1627 (1993) - 1992
- [j20]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) - 1990
- [j19]Jørn Justesen, Erik Paaske, Mark Ballan:
Quasi-cyclic unit memory convolutional codes. IEEE Trans. Inf. Theory 36(3): 540-547 (1990)
1980 – 1989
- 1989
- [j18]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
- [j17]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) - [j16]Jørn Justesen, Christian Thommesen, Victor V. Zyablov:
Concatenated codes with convolutional inner codes. IEEE Trans. Inf. Theory 34(5): 1217-1225 (1988) - 1986
- [j15]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
- [j14]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
- [j13]Jørn Justesen, Tom Høholdt:
Maxentropic Markov chains. IEEE Trans. Inf. Theory 30(4): 665-667 (1984) - 1983
- [j12]Tom Høholdt, Jørn Justesen:
Ternary sequences with perfect periodic autocorrelation. IEEE Trans. Inf. Theory 29(4): 597-600 (1983) - [j11]Christian Thommesen, Jørn Justesen:
Bounds on distances and error exponents of unit memory codes. IEEE Trans. Inf. Theory 29(5): 637-649 (1983) - 1982
- [j10]Jørn Justesen:
Information rates and power spectra of digital codes. IEEE Trans. Inf. Theory 28(3): 457-472 (1982)
1970 – 1979
- 1978
- [j9]Jørn Justesen:
Finite State Predictors for Gaussian Sequences. Inf. Control. 39(1): 35-45 (1978) - 1976
- [j8]Jørn Justesen:
On the complexity of decoding Reed-Solomon codes (Corresp.). IEEE Trans. Inf. Theory 22(2): 237-238 (1976) - 1975
- [j7]Jørn Justesen, Knud J. Larsen:
On Probabilistic Context-Free Grammars that Achieve Capacity. Inf. Control. 29(3): 268-285 (1975) - [j6]Jørn Justesen:
An algebraic construction of rate 1/v -ary codes; algebraic construction (Corresp.). IEEE Trans. Inf. Theory 21(5): 577-580 (1975) - 1974
- [j5]Jørn Justesen, Lawrence R. Hughes:
On maximum-distance-separable convolutional codes (Corresp.). IEEE Trans. Inf. Theory 20(2): 288 (1974) - [j4]Elwyn R. Berlekamp, Jørn Justesen:
Some long cyclic linear binary codes are not so bad. IEEE Trans. Inf. Theory 20(3): 351-356 (1974) - 1973
- [j3]James L. Massey, Daniel J. Costello Jr., Jørn Justesen:
Polynomial weights and code constructions. IEEE Trans. Inf. Theory 19(1): 101-110 (1973) - [j2]Jørn Justesen:
New convolutional code constructions and a class of asymptotically good time-varying codes. IEEE Trans. Inf. Theory 19(2): 220-225 (1973) - 1972
- [j1]Jørn Justesen:
Class of constructive asymptotically good algebraic codes. IEEE Trans. Inf. Theory 18(5): 652-656 (1972)
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-25 05:41 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:
