Jørn Justesen

According to our database1, Jørn Justesen authored at least 51 papers between 1972 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
On the sizes of expander graphs and minimum distances of graph codes.
Discret. Math., 2014

2013
On the dimension of graph codes with Reed-Solomon component codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2011
Performance of Product Codes and Related Structures with Iterated Decoding.
IEEE Trans. Commun., 2011

The Minimum Distance of Graph Codes.
Proceedings of the Coding and Cryptology - Third International Workshop, 2011

2010
Error correcting coding for OTN.
IEEE Commun. Mag., 2010

Two-Dimensional Information Theory and Coding - With Application to Graphics Data and High-Density Storage Media.
Cambridge University Press, ISBN: 978-0-521-88860-8, 2010

2009
Block pickard models for two-dimensional constraints.
IEEE Trans. Inf. Theory, 2009

2007
Iterative List Decoding of Some LDPC Codes.
IEEE Trans. Inf. Theory, 2007

Upper Bounds on the Number of Errors Corrected by the Koetter-Vardy Algorithm.
IEEE Trans. Inf. Theory, 2007

Iterative List Decoding of LDPC Codes.
Proceedings of the Applied Algebra, 2007

2006
Graph Codes with Reed-Solomon Component Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Fields from Markov chains.
IEEE Trans. Inf. Theory, 2005

Iterative list decoding.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Soft-decision decoding of RS codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Euclidean geometry codes, minimum weight words and decodable error-patterns using bit-flipping.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Upper bounds on the number of errors corrected by a convolutional code.
IEEE Trans. Inf. Theory, 2004

From concatenated codes to graph codes.
Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Decoding of concatenated codes with interleaved outer codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Finite state models of constrained 2D data.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

A Course In Error-Correcting Codes.
EMS textbooks in mathematics, European Mathematical Society, ISBN: 978-3-03719-001-2, 2004

2001
Bounds on list decoding of MDS codes.
IEEE Trans. Inf. Theory, 2001

Concatenated codes with fixed inner code and random outer code.
IEEE Trans. Inf. Theory, 2001

Calculation of power spectra for block coded signals.
IEEE Trans. Commun., 2001

2000
Bounds on the capacity of constrained two-dimensional codes.
IEEE Trans. Inf. Theory, 2000

1999
Entropy Bounds for Constrained Two-Dimensional Random Fields.
IEEE Trans. Inf. Theory, 1999

1998
Critical Lengths of Error Events in Convolutional Codes.
IEEE Trans. Inf. Theory, 1998

1995
Fast decoding of algebraic-geometric codes up to the designed minimum distance.
IEEE Trans. Inf. Theory, 1995

Introduction to the special issue on algebraic geometry codes.
IEEE Trans. Inf. Theory, 1995

Some Constructions of Generalised Concatenated Codes Based on Unit Memory Codes.
Proceedings of the Cryptography and Coding, 1995

1993
Bounded distance decoding of unit memory codes.
IEEE Trans. Inf. Theory, 1993

On the number of correctable errors for some AG-codes.
IEEE Trans. Inf. Theory, 1993

1992
Fast decoding of codes from algebraic plane curves.
IEEE Trans. Inf. Theory, 1992

1990
Quasi-cyclic unit memory convolutional codes.
IEEE Trans. Inf. Theory, 1990

1989
Construction and decoding of a class of algebraic geometry codes.
IEEE Trans. Inf. Theory, 1989

1988
Concatenated codes with convolutional inner codes.
IEEE Trans. Inf. Theory, 1988

Double series representation of bounded signals.
IEEE Trans. Inf. Theory, 1988

1986
Autocorrelation properties of a class of infinite binary sequences.
IEEE Trans. Inf. Theory, 1986

1985
Aperiodic correlations and the merit factor of a class of binary sequences.
IEEE Trans. Inf. Theory, 1985

1984
Maxentropic Markov chains.
IEEE Trans. Inf. Theory, 1984

1983
Bounds on distances and error exponents of unit memory codes.
IEEE Trans. Inf. Theory, 1983

Ternary sequences with perfect periodic autocorrelation.
IEEE Trans. Inf. Theory, 1983

1982
Information rates and power spectra of digital codes.
IEEE Trans. Inf. Theory, 1982

1978
Finite State Predictors for Gaussian Sequences
Inf. Control., October, 1978

1976
On the complexity of decoding Reed-Solomon codes (Corresp.).
IEEE Trans. Inf. Theory, 1976

1975
On Probabilistic Context-Free Grammars that Achieve Capacity
Inf. Control., November, 1975

An algebraic construction of rate 1/v -ary codes; algebraic construction (Corresp.).
IEEE Trans. Inf. Theory, 1975

1974
On maximum-distance-separable convolutional codes (Corresp.).
IEEE Trans. Inf. Theory, 1974

Some long cyclic linear binary codes are not so bad.
IEEE Trans. Inf. Theory, 1974

1973
Polynomial weights and code constructions.
IEEE Trans. Inf. Theory, 1973

New convolutional code constructions and a class of asymptotically good time-varying codes.
IEEE Trans. Inf. Theory, 1973

1972
Class of constructive asymptotically good algebraic codes.
IEEE Trans. Inf. Theory, 1972


  Loading...