default search action
Thomas H. E. Ericson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j18]Victor A. Zinoviev, Thomas H. E. Ericson:
Fourier-invariant pairs of partitions of finite abelian groups and association schemes. Probl. Inf. Transm. 45(3): 221 (2009)
1990 – 1999
- 1997
- [j17]Thomas H. E. Ericson, Juriaan Simonis, Hannu Tarnanen, Victor A. Zinoviev:
F-partitions of Cyclic Groups. Appl. Algebra Eng. Commun. Comput. 8(5): 387-393 (1997) - 1995
- [j16]Thomas H. E. Ericson, Victor A. Zinoviev:
Spherical codes generated by binary partitions of symmetric pointsets. IEEE Trans. Inf. Theory 41(1): 107-129 (1995) - 1994
- [j15]Thomas H. E. Ericson, Vladimir I. Levenshtein:
Superimposed codes in the Hamming space. IEEE Trans. Inf. Theory 40(6): 1882-1893 (1994) - 1992
- [j14]Thomas H. E. Ericson, Victor A. Zinoviev:
On spherical codes generating the kissing number in dimensions 8 and 24. Discret. Math. 106-107: 199-207 (1992) - 1990
- [c2]Thomas H. E. Ericson, Victor A. Zinoviev:
Concatenated spherical codes. EUROCODE 1990: 2-5
1980 – 1989
- 1988
- [j13]Thomas H. E. Ericson, László Györfi:
Superimposed codes in Rn. IEEE Trans. Inf. Theory 34(4): 877-880 (1988) - 1987
- [j12]Thomas H. E. Ericson, Victor A. Zinoviev:
An improvement of the Gilbert bound for constant weight codes. IEEE Trans. Inf. Theory 33(5): 721-723 (1987) - 1986
- [j11]Thomas H. E. Ericson:
The noncooperative binary adder channel. IEEE Trans. Inf. Theory 32(3): 365-374 (1986) - [c1]Thomas H. E. Ericson:
A Simple Analysis of the Blokh-Zyablov Decoding Algorithm. AAECC 1986: 43-57 - 1985
- [j10]Thomas H. E. Ericson:
Exponential error bounds for random codes in the arbitrarily varying channel. IEEE Trans. Inf. Theory 31(1): 42-48 (1985) - 1984
- [j9]Thomas H. E. Ericson:
A min-max theorem for antijamming group codes. IEEE Trans. Inf. Theory 30(6): 792-799 (1984) - 1983
- [j8]Thomas H. E. Ericson, János Körner:
Successive encoding of correlated sources. IEEE Trans. Inf. Theory 29(3): 390-395 (1983) - 1981
- [j7]Thomas H. E. Ericson:
Modulation by means of linear periodic filtering. IEEE Trans. Inf. Theory 27(3): 322-326 (1981) - [j6]Thomas H. E. Ericson, Ingemar Ingemarsson:
A two-way communication problem with application to information retrieval. IEEE Trans. Inf. Theory 27(4): 420-430 (1981)
1970 – 1979
- 1974
- [j5]Thomas H. E. Ericson, Ulf J. S. Johansson:
A general time-discrete equivalent to a time-continuous Gaussian channel (Corresp.). IEEE Trans. Inf. Theory 20(4): 544-549 (1974) - 1973
- [j4]Thomas H. E. Ericson, Ulf J. S. Johansson:
High-Capacity Digital Line Links. IEEE Trans. Commun. 21(6): 680-686 (1973) - [j3]Thomas H. E. Ericson:
Optimum PAM filters are always band limited (Corresp.). IEEE Trans. Inf. Theory 19(4): 570-573 (1973) - 1971
- [j2]Thomas H. E. Ericson:
Structure of optimum receiving filters in data transmission systems (Corresp.). IEEE Trans. Inf. Theory 17(3): 352-353 (1971) - 1970
- [j1]Thomas H. E. Ericson:
A Gaussian channel with slow fading (Corresp.). IEEE Trans. Inf. Theory 16(3): 353-355 (1970)
Coauthor Index
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-24 22: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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: