Search the dblp DataBase
Jørn Justesen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Victor V. Zyablov, Sergo Shavgulidze, Jørn Justesen
Some Constructions of Generalised Concatenated Codes Based on Unit Memory Codes. [Citation Graph (0, 0)][DBLP]
IMA Conf., 1995, pp:237-256 [Conf] - Jørn Justesen
Finite State Predictors for Gaussian Sequences [Citation Graph (0, 0)][DBLP]
Information and Control, 1978, v:39, n:1, pp:35-45 [Journal] - Jørn Justesen, Knud J. Larsen
On Probabilistic Context-Free Grammars that Achieve Capacity [Citation Graph (0, 0)][DBLP]
Information and Control, 1975, v:29, n:3, pp:268-285 [Journal] - Alexander Barg, Jørn Justesen, Christian Thommesen
Concatenated codes with fixed inner code and random outer code. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:361-365 [Journal] - Søren Forchhammer, Jørn Justesen
Bounds on the capacity of constrained two-dimensional codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2659-2666 [Journal] - Søren Forchhammer, Jørn Justesen
Entropy Bounds for Constrained Two-Dimensional Random Fields. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:118-127 [Journal] - Tom Høholdt, Jørn Justesen
Ternary sequences with perfect periodic autocorrelation. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1983, v:29, n:4, pp:597-0 [Journal] - Tom Høholdt, Helge Elbrønd Jensen, Jørn Justesen
Aperiodic correlations and the merit factor of a class of binary sequences. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1985, v:31, n:4, pp:549-0 [Journal] - Tom Høholdt, Helge Elbrønd Jensen, Jørn Justesen
Autocorrelation properties of a class of infinite binary sequences. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1986, v:32, n:3, pp:430-0 [Journal] - Helge Elbrønd Jensen, Tom Høholdt, Jørn Justesen
Double series representation of bounded signals. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1988, v:34, n:4, pp:613-624 [Journal] - Helge Elbrønd Jensen, Tom Høholdt, Jørn Justesen
On the number of correctable errors for some AG-codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:681-0 [Journal] - 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. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:811-821 [Journal] - Jørn Justesen
Upper bounds on the number of errors corrected by a convolutional code. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:350-353 [Journal] - Jørn Justesen
Fields from Markov chains. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2005, v:51, n:12, pp:4358-4362 [Journal] - Jørn Justesen
Information rates and power spectra of digital codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1982, v:28, n:3, pp:457-472 [Journal] - Jørn Justesen
Bounded distance decoding of unit memory codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1993, v:39, n:5, pp:1616-1627 [Journal] - Jørn Justesen, Jakob Dahl Andersen
Critical Lengths of Error Events in Convolutional Codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1998, v:44, n:4, pp:1608-1611 [Journal] - Jørn Justesen, Tom Høholdt
Bounds on list decoding of MDS codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1604-1609 [Journal] - Jørn Justesen, Tom Høholdt
Maxentropic Markov chains. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1984, v:30, n:4, pp:665-0 [Journal] - Jørn Justesen, Knud J. Larsen, Helge Elbrønd Jensen, Tom Høholdt
Fast decoding of codes from algebraic plane curves. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1992, v:38, n:1, pp:111-119 [Journal] - Jørn Justesen, Erik Paaske, Mark Ballan
Quasi-cyclic unit memory convolutional codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:540-547 [Journal] - Jørn Justesen, Christian Thommesen, Victor V. Zyablov
Concatenated codes with convolutional inner codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1217-1225 [Journal] - Gilles Lachaud, Michael A. Tsfasman, Jørn Justesen, Victor K.-W. Wei
Introduction to the special issue on algebraic geometry codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1545-1547 [Journal] - 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. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1672-1677 [Journal] - Christian Thommesen, Jørn Justesen
Bounds on distances and error exponents of unit memory codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1983, v:29, n:5, pp:637-649 [Journal]
Iterative List Decoding of LDPC Codes. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002