#### Filter Results:

- Full text PDF available (23)

#### Publication Year

1972

2014

- This year (0)
- Last 5 years (2)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jørn Justesen
- IEEE Trans. Information Theory
- 1972

- James L. Massey, Daniel J. Costello, Jørn Justesen
- IEEE Trans. Information Theory
- 1973

An explicit and easily implemented solution is given to the<lb>general problem of linear mean-square estimation of a signal or system<lb>process based upon noisy observations, under the assumption that the<lb>autoand cross-correlation functions of the signal and the observation<lb>processes are known. Also a number of specific estimation problems… (More)

- Jørn Justesen, Tom Høholdt
- IEEE Trans. Information Theory
- 2001

- Jørn Justesen
- IEEE Trans. Information Theory
- 1973

- Jørn Justesen
- IEEE Trans. Communications
- 2011

- Christian Thommesen, Jørn Justesen
- IEEE Trans. Information Theory
- 1983

- Tom Høholdt, Helge Elbrønd Jensen, Jørn Justesen
- IEEE Trans. Information Theory
- 1985

and conjectured that F I 12.32, for all binary sequences, with the exception of the Barker sequence of length 13, for which F = 14.08. In a recent paper Golay [5] argued that the merit factor of Legendre sequences, shifted by one quarter of their lengths, has the highly probable asymptotic value 6, but he did not prove this. For maximal-length shift… (More)

- Jørn Justesen
- IEEE Trans. Information Theory
- 1976

- T. Hoholdt, J. Justesen
- 2006 IEEE International Symposium on Information…
- 2006

We treat a specific case of codes based on bipartite expander graphs coming from finite geometries. The code symbols are associated with the branches and the symbols connected to a given node are restricted to be codewords in a Reed-Solomon code. We give results on the parameters of the codes and methods for their encoding

- Shojiro Sakata, Jørn Justesen, Y. Madelung, Helge Elbrønd Jensen, Tom Høholdt
- IEEE Trans. Information Theory
- 1995

We present a decoding algorithm for algebraicgeometric codes from regular plane curves, in particular the Hermitian curve, which corrects all error patternes of weight less than d*/2 with low complexity. The algorithm is based on the majority scheme of Feng and Rao and uses a modified version of Sakata’s generalization of the Berlekamp-Massey algorithm.