Jørn Justesen

Publication Activity (10 Years)

Years Active: 1972-2014
Publications (10 Years): 0

Top Topics

Connected Dominating Set

Evolving Graphs

Reachability Queries

Top Venues

Publications

Tom Høholdt, Jørn Justesen
On the sizes of expander graphs and minimum distances of graph codes. Discret. Math. 325 (2014)
Peter Beelen, Tom Høholdt, Fernando Piñero, Jørn Justesen
On the dimension of graph codes with Reed-Solomon component codes. ISIT (2013)
Jørn Justesen
Performance of Product Codes and Related Structures with Iterated Decoding. IEEE Trans. Commun. 59 (2) (2011)
Tom Høholdt, Jørn Justesen
The Minimum Distance of Graph Codes. IWCC (2011)
Jørn Justesen, Knud J. Larsen, Lars A. Pedersen
Error correcting coding for OTN. IEEE Commun. Mag. 48 (9) (2010)
Søren Forchhammer, Jørn Justesen
Block pickard models for two-dimensional constraints. IEEE Trans. Inf. Theory 55 (10) (2009)
Tom Høholdt, Jørn Justesen
Iterative List Decoding of LDPC Codes. AAECC (2007)
Jørn Justesen, Tom Høholdt, Johann Hjaltason
Iterative List Decoding of Some LDPC Codes. IEEE Trans. Inf. Theory 53 (11) (2007)
Jørn Justesen
Upper Bounds on the Number of Errors Corrected by the Koetter-Vardy Algorithm. IEEE Trans. Inf. Theory 53 (8) (2007)
Tom Høholdt, Jørn Justesen
Graph Codes with Reed-Solomon Component Codes. ISIT (2006)
Tom Høholdt, Jørn Justesen, Bergtor Jonsson
Euclidean geometry codes, minimum weight words and decodable error-patterns using bit-flipping. ISIT (2005)
Jørn Justesen
Fields from Markov chains. IEEE Trans. Inf. Theory 51 (12) (2005)
Jørn Justesen
Soft-decision decoding of RS codes. ISIT (2005)
Jørn Justesen, Tom Høholdt, Johann Hjaltason
Iterative list decoding. ITW (2005)
Jørn Justesen, Christian Thommesen, Tom Høholdt
Decoding of concatenated codes with interleaved outer codes. ISIT (2004)
Jørn Justesen, Tom Høholdt
From concatenated codes to graph codes. ITW (2004)
Jørn Justesen
Upper bounds on the number of errors corrected by a convolutional code. IEEE Trans. Inf. Theory 50 (2) (2004)
Jørn Justesen
Finite state models of constrained 2D data. ISIT (2004)
Jørn Justesen, Tom Høholdt
Bounds on list decoding of MDS codes. IEEE Trans. Inf. Theory 47 (4) (2001)
Alexander Barg, Jørn Justesen, Christian Thommesen
Concatenated codes with fixed inner code and random outer code. IEEE Trans. Inf. Theory 47 (1) (2001)
Jørn Justesen
Calculation of power spectra for block coded signals. IEEE Trans. Commun. 49 (3) (2001)
Søren Forchhammer, Jørn Justesen
Bounds on the capacity of constrained two-dimensional codes. IEEE Trans. Inf. Theory 46 (7) (2000)
Søren Forchhammer, Jørn Justesen
Entropy Bounds for Constrained Two-Dimensional Random Fields. IEEE Trans. Inf. Theory 45 (1) (1999)
Jørn Justesen, Jakob Dahl Andersen
Critical Lengths of Error Events in Convolutional Codes. IEEE Trans. Inf. Theory 44 (4) (1998)
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) (1995)
Victor V. Zyablov, Sergo Shavgulidze, Jørn Justesen
Some Constructions of Generalised Concatenated Codes Based on Unit Memory Codes. IMACC (1995)
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) (1995)
Jørn Justesen
Bounded distance decoding of unit memory codes. IEEE Trans. Inf. Theory 39 (5) (1993)
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) (1993)
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) (1992)
Jørn Justesen, Erik Paaske, Mark Ballan
Quasi-cyclic unit memory convolutional codes. IEEE Trans. Inf. Theory 36 (3) (1990)
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) (1989)
Helge Elbrønd Jensen, Tom Høholdt, Jørn Justesen
Double series representation of bounded signals. IEEE Trans. Inf. Theory 34 (4) (1988)
Jørn Justesen, Christian Thommesen, Victor V. Zyablov
Concatenated codes with convolutional inner codes. IEEE Trans. Inf. Theory 34 (5) (1988)
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) (1986)
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) (1985)
Jørn Justesen, Tom Høholdt
Maxentropic Markov chains. IEEE Trans. Inf. Theory 30 (4) (1984)
Tom Høholdt, Jørn Justesen
Ternary sequences with perfect periodic autocorrelation. IEEE Trans. Inf. Theory 29 (4) (1983)
Christian Thommesen, Jørn Justesen
Bounds on distances and error exponents of unit memory codes. IEEE Trans. Inf. Theory 29 (5) (1983)
Jørn Justesen
Information rates and power spectra of digital codes. IEEE Trans. Inf. Theory 28 (3) (1982)
Jørn Justesen
Finite State Predictors for Gaussian Sequences Inf. Control. 39 (1) (1978)
Jørn Justesen
On the complexity of decoding Reed-Solomon codes (Corresp.). IEEE Trans. Inf. Theory 22 (2) (1976)
Jørn Justesen, Knud J. Larsen
On Probabilistic Context-Free Grammars that Achieve Capacity Inf. Control. 29 (3) (1975)
Jørn Justesen
An algebraic construction of rate 1/v -ary codes; algebraic construction (Corresp.). IEEE Trans. Inf. Theory 21 (5) (1975)
Jørn Justesen, Lawrence R. Hughes
On maximum-distance-separable convolutional codes (Corresp.). IEEE Trans. Inf. Theory 20 (2) (1974)
Elwyn R. Berlekamp, Jørn Justesen
Some long cyclic linear binary codes are not so bad. IEEE Trans. Inf. Theory 20 (3) (1974)
Jørn Justesen
New convolutional code constructions and a class of asymptotically good time-varying codes. IEEE Trans. Inf. Theory 19 (2) (1973)
James L. Massey, Daniel J. Costello Jr., Jørn Justesen
Polynomial weights and code constructions. IEEE Trans. Inf. Theory 19 (1) (1973)
Jørn Justesen
Class of constructive asymptotically good algebraic codes. IEEE Trans. Inf. Theory 18 (5) (1972)