![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Helge Elbrønd Jensen
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1999
- [j14]Helge Elbrønd Jensen, Rasmus Refslund Nielsen, Tom Høholdt:
Performance analysis of a decoding algorithm for algebraic-geometry codes. IEEE Trans. Inf. Theory 45(5): 1712-1717 (1999) - 1998
- [j13]Shojiro Sakata, Douglas A. Leonard, Helge Elbrønd Jensen, Tom Høholdt:
Fast Erasure-and-Error Decoding of Algebraic Geometry Codes up to the Feng-Rao Bound. IEEE Trans. Inf. Theory 44(4): 1558-1564 (1998) - [j12]Johan P. Hansen
, Helge Elbrønd Jensen, Ralf Kötter:
Determination of Error Values for Algebraic-Geometry Codes and the Forney Formula. IEEE Trans. Inf. Theory 44(5): 1881-1886 (1998) - 1996
- [j11]Sylvia B. Encheva, Helge Elbrønd Jensen:
Optimal binary linear codes and Z4-linearity. IEEE Trans. Inf. Theory 42(4): 1216-1222 (1996) - 1995
- [j10]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. IEEE Trans. Inf. Theory 41(6): 1672-1677 (1995) - [j9]Shojiro Sakata, Helge Elbrønd Jensen, Tom Høholdt:
Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound. IEEE Trans. Inf. Theory 41(6): 1762-1772 (1995) - 1993
- [j8]Helge Elbrønd Jensen, Tom Høholdt, Jørn Justesen:
On the number of correctable errors for some AG-codes. IEEE Trans. Inf. Theory 39(2): 681-684 (1993) - 1992
- [j7]Jørn Justesen, Knud J. Larsen, Helge Elbrønd Jensen, Tom Høholdt:
Fast decoding of codes from algebraic plane curves. IEEE Trans. Inf. Theory 38(1): 111-119 (1992) - 1991
- [j6]Jørn M. Jensen, Helge Elbrønd Jensen, Tom Høholdt:
The merit factor of binary sequences related to difference sets. IEEE Trans. Inf. Theory 37(3): 617-626 (1991)
1980 – 1989
- 1989
- [j5]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. IEEE Trans. Inf. Theory 35(4): 811-821 (1989) - 1988
- [j4]Tom Høholdt, Helge Elbrønd Jensen:
Determination of the merit factor of Legendre sequences. IEEE Trans. Inf. Theory 34(1): 161-164 (1988) - [j3]Helge Elbrønd Jensen, Tom Høholdt, Jørn Justesen:
Double series representation of bounded signals. IEEE Trans. Inf. Theory 34(4): 613-624 (1988) - 1987
- [c1]Helge Elbrønd Jensen, Tom Høholdt:
Binary Sequences with Good Correlation Properties. AAECC 1987: 306-320 - 1986
- [j2]Tom Høholdt, Helge Elbrønd Jensen, Jørn Justesen:
Autocorrelation properties of a class of infinite binary sequences. IEEE Trans. Inf. Theory 32(3): 430-431 (1986) - 1985
- [j1]Tom Høholdt, Helge Elbrønd Jensen, Jørn Justesen:
Aperiodic correlations and the merit factor of a class of binary sequences. IEEE Trans. Inf. Theory 31(4): 549-552 (1985)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint