Jørn Justesen

Available identifiers

zbMath Open justesen.jornMaRDI QIDQ2364842

List of research outcomes

Publication	Date of Publication	Type
Some constructions of generalised concatenated codes based on unit memory codes	2018-03-21	Paper
Block Pickard Models for Two-Dimensional Constraints	2017-08-08	Paper
A course in error-correcting codes	2017-07-25	Paper
On the sizes of expander graphs and minimum distances of graph codes	2014-05-06	Paper
The Minimum Distance of Graph Codes	2011-06-08	Paper
Two-Dimensional Information Theory and Coding	2009-07-22	Paper
Upper Bounds on the Number of Errors Corrected by a Convolutional Code	2008-12-21	Paper
Fields From Markov Chains	2008-12-21	Paper
Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm	2008-12-21	Paper
Iterative List Decoding of Some LDPC Codes	2008-12-21	Paper
https://portal.mardi4nfdi.de/entity/Q4460806	2004-03-29	Paper
A course in error-correcting codes.	2004-02-18	Paper
Calculation of power spectra for block coded signals	2003-09-08	Paper
Concatenated codes with fixed inner code and random outer code	2002-08-04	Paper
Bounds on list decoding of MDS codes	2002-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4535934	2002-06-16	Paper
Bounds on the capacity of constrained two-dimensional codes	2001-03-19	Paper
Critical lengths of error events in convolutional codes	1999-11-21	Paper
Entropy bounds for constrained two-dimensional random fields	1999-11-21	Paper
Decoding concatenated codes with inner convolutional codes	1999-03-16	Paper
Combinatorial entropy of images	1998-07-15	Paper
Fast decoding of algebraic-geometric codes up to the designed minimum distance	1996-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q4857239	1995-11-26	Paper
A fast decoding method of AG codes from Miura-Kamiya curves \(C_{ab}\) up to half the Feng-Rao bound	1995-02-09	Paper
Bounded distance decoding of unit memory codes	1994-10-03	Paper
On the number of correctable errors for some AG-codes	1993-10-12	Paper
Fast decoding of codes from algebraic plane curves	1992-06-28	Paper
Quasi-cyclic unit memory convolutional codes	1990-01-01	Paper
Concatenated codes with convolutional inner codes	1989-01-01	Paper
Construction and decoding of a class of algebraic geometry codes	1989-01-01	Paper
Double series representation of bounded signals	1988-01-01	Paper
Aperiodic correlations and the merit factor of a class of binary sequences (Corresp.)	1985-01-01	Paper
Maxentropic Markov chains (Corresp.)	1984-01-01	Paper
Bounds on distances and error exponents of unit memory codes	1983-01-01	Paper
Ternary sequences with perfect periodic autocorrelation (Corresp.)	1983-01-01	Paper
Information rates and power spectra of digital codes	1982-01-01	Paper
Finite state predictors for Gaussian sequences	1978-01-01	Paper
Determinants of a class of Toeplitz matrices.	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4159305	1977-01-01	Paper
On the complexity of decoding Reed-Solomon codes (Corresp.)	1976-01-01	Paper
An algebraic construction of rate<tex>1/v</tex>-ary codes; algebraic construction (Corresp.)	1975-01-01	Paper
On probabilistic context-free grammars that achieve capacity	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4041438	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4041439	1974-01-01	Paper
On maximum-distance-separable convolutional codes (Corresp.)	1974-01-01	Paper
Some long cyclic linear binary codes are not so bad	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3214796	1973-01-01	Paper
Polynomial weights and code constructions	1973-01-01	Paper
New convolutional code constructions and a class of asymptotically good time-varying codes	1973-01-01	Paper
Class of constructive asymptotically good algebraic codes	1972-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Jørn Justesen