Jørn Justesen

From MaRDI portal
Person:2364842

Available identifiers

zbMath Open justesen.jornMaRDI QIDQ2364842

List of research outcomes

PublicationDate of PublicationType
Some constructions of generalised concatenated codes based on unit memory codes2018-03-21Paper
Block Pickard Models for Two-Dimensional Constraints2017-08-08Paper
A course in error-correcting codes2017-07-25Paper
On the sizes of expander graphs and minimum distances of graph codes2014-05-06Paper
The Minimum Distance of Graph Codes2011-06-08Paper
Two-Dimensional Information Theory and Coding2009-07-22Paper
Upper Bounds on the Number of Errors Corrected by a Convolutional Code2008-12-21Paper
Fields From Markov Chains2008-12-21Paper
Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm2008-12-21Paper
Iterative List Decoding of Some LDPC Codes2008-12-21Paper
https://portal.mardi4nfdi.de/entity/Q44608062004-03-29Paper
A course in error-correcting codes.2004-02-18Paper
Calculation of power spectra for block coded signals2003-09-08Paper
Concatenated codes with fixed inner code and random outer code2002-08-04Paper
Bounds on list decoding of MDS codes2002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q45359342002-06-16Paper
Bounds on the capacity of constrained two-dimensional codes2001-03-19Paper
Critical lengths of error events in convolutional codes1999-11-21Paper
Entropy bounds for constrained two-dimensional random fields1999-11-21Paper
Decoding concatenated codes with inner convolutional codes1999-03-16Paper
Combinatorial entropy of images1998-07-15Paper
Fast decoding of algebraic-geometric codes up to the designed minimum distance1996-08-13Paper
https://portal.mardi4nfdi.de/entity/Q48572391995-11-26Paper
A fast decoding method of AG codes from Miura-Kamiya curves \(C_{ab}\) up to half the Feng-Rao bound1995-02-09Paper
Bounded distance decoding of unit memory codes1994-10-03Paper
On the number of correctable errors for some AG-codes1993-10-12Paper
Fast decoding of codes from algebraic plane curves1992-06-28Paper
Quasi-cyclic unit memory convolutional codes1990-01-01Paper
Concatenated codes with convolutional inner codes1989-01-01Paper
Construction and decoding of a class of algebraic geometry codes1989-01-01Paper
Double series representation of bounded signals1988-01-01Paper
Aperiodic correlations and the merit factor of a class of binary sequences (Corresp.)1985-01-01Paper
Maxentropic Markov chains (Corresp.)1984-01-01Paper
Bounds on distances and error exponents of unit memory codes1983-01-01Paper
Ternary sequences with perfect periodic autocorrelation (Corresp.)1983-01-01Paper
Information rates and power spectra of digital codes1982-01-01Paper
Finite state predictors for Gaussian sequences1978-01-01Paper
Determinants of a class of Toeplitz matrices.1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41593051977-01-01Paper
On the complexity of decoding Reed-Solomon codes (Corresp.)1976-01-01Paper
An algebraic construction of rate<tex>1/v</tex>-ary codes; algebraic construction (Corresp.)1975-01-01Paper
On probabilistic context-free grammars that achieve capacity1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40414381974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40414391974-01-01Paper
On maximum-distance-separable convolutional codes (Corresp.)1974-01-01Paper
Some long cyclic linear binary codes are not so bad1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32147961973-01-01Paper
Polynomial weights and code constructions1973-01-01Paper
New convolutional code constructions and a class of asymptotically good time-varying codes1973-01-01Paper
Class of constructive asymptotically good algebraic codes1972-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jørn Justesen