default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward C. van der Meulen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j27]Vyacheslav V. Prelov, Edward C. van der Meulen:
Remark on "On Error-free Filtering of Finite-State Singular Processes under Dependent Distortions" published in Probl. Peredachi Inf., 2007, no. 4. Probl. Inf. Transm. 45(2): 191 (2009)- 2008
- [j26]Vyacheslav V. Prelov, Edward C. van der Meulen:
Mutual information, variation, and Fano's inequality. Probl. Inf. Transm. 44(3): 185-197 (2008) - 2007
- [j25]János Levendovszky
, Lorant Kovacs, Edward C. van der Meulen:
Minimum Probability of Error-Based Equalization Algorithms for Fading Channels. EURASIP J. Wirel. Commun. Netw. 2007 (2007) - [j24]Vyacheslav V. Prelov, Edward C. van der Meulen:
On error-free filtering of finite-state singular processes under dependent distortions. Probl. Inf. Transm. 43(4): 271-279 (2007) - [j23]Edward C. van der Meulen, Peter Vanroose:
The Capacity of a Relay Channel, Both With and Without Delay. IEEE Trans. Inf. Theory 53(10): 3774-3776 (2007) - 2006
- [c4]Sándor Csibi, Edward C. van der Meulen:
Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint. GTIT-C 2006: 218-248 - 2005
- [j22]Sándor Csibi, Edward C. van der Meulen:
Huge-size codes for identification via a multiple access channel under a word length constraint. Electron. Notes Discret. Math. 21: 263-264 (2005) - [j21]Igor Vajda, Edward C. van der Meulen:
On minimum divergence adaptation of discrete bivariate distributions to given marginals. IEEE Trans. Inf. Theory 51(1): 313-320 (2005) - 2004
- [c3]Edward C. van der Meulen, Saskia Vangheluwe:
Construction of new signature codes for the T-terminal binary adder multiple access channel with partially active users. ISIT 2004: 107 - 2003
- [j20]Vyacheslav V. Prelov, Edward C. van der Meulen:
Higher-Order Asymptotics of Mutual Information for Nonlinear Channels with Non-Gaussian Noise. Probl. Inf. Transm. 39(4): 324-340 (2003) - 2002
- [j19]Gábor Jeney, János Levendovszky, László Pap, Edward C. van der Meulen:
Adaptive Near-Optimal Multiuser Detection Using a Stochastic and Hysteretic Hopfield Net Receiver. EURASIP J. Adv. Signal Process. 2002(12): 1401-1414 (2002) - [j18]Vyacheslav V. Prelov, Edward C. van der Meulen:
On the Epsilon-entropy of One Class of Ellipsoids in a Hamming Space. Probl. Inf. Transm. 38(2): 113-125 (2002) - 2001
- [j17]Igor Vajda, Edward C. van der Meulen:
Optimization of Barron density estimates. IEEE Trans. Inf. Theory 47(5): 1867-1883 (2001) - 2000
- [j16]János Levendovszky, Csaba Végsö, Edward C. van der Meulen:
Nonparametric decision algorithms for CAC in ATM networks. Perform. Evaluation 41(2-3): 133-147 (2000)
1990 – 1999
- 1998
- [j15]Alain Berlinet, Igor Vajda, Edward C. van der Meulen:
About the Asymptotic Accuracy of Barron Density Estimates. IEEE Trans. Inf. Theory 44(3): 999-1009 (1998) - 1994
- [j14]László Györfi, Istvan Pali, Edward C. van der Meulen:
There is no universal source code for an infinite source alphabet. IEEE Trans. Inf. Theory 40(1): 267-271 (1994) - [c2]W. Mommaerts, Edward C. van der Meulen, Tatyana S. Turova:
Analysis of critical effects in a stochastic neural model. ESANN 1994 - 1993
- [j13]László Györfi, Istvan Pali, Edward C. van der Meulen:
On Universal Noiseless Source Coding for Infinite Source Alphabets. Eur. Trans. Telecommun. 4(2): 125-132 (1993) - [j12]Vyacheslav V. Prelov, Edward C. van der Meulen:
An asymptotic expression for the information and capacity of a multidimensional channel with weak input signals. IEEE Trans. Inf. Theory 39(5): 1728-1735 (1993) - 1992
- [j11]Peter Vanroose, Edward C. van der Meulen:
Uniquely decodable codes for deterministic relay channels. IEEE Trans. Inf. Theory 38(4): 1203-1212 (1992) - [j10]Andrew R. Barron, László Györfi, Edward C. van der Meulen:
Distribution estimation consistent in total variation and in two types of information divergence. IEEE Trans. Inf. Theory 38(5): 1437-1454 (1992) - 1991
- [c1]János Levendovszky, W. Mommaerts, Edward C. van der Meulen:
Neural Networks with Hysterisis Type of Nonlinearity Exhibit Global Optimization Property. IWANN 1991: 62-68 - 1990
- [j9]Bart Verboven, Edward C. van der Meulen:
Capacity bounds for identification via broadcast channels which are optimal for the deterministic broadcast channel. IEEE Trans. Inf. Theory 36(6): 1197-1205 (1990)
1980 – 1989
- 1987
- [j8]Kristien de Bruyn, Vyacheslav V. Prelov, Edward C. van der Meulen:
Reliable transmission of two correlated sources over an asymmetric multiple-access channel. IEEE Trans. Inf. Theory 33(5): 716-718 (1987) - 1986
- [j7]Kristien de Bruyn, Edward C. van der Meulen:
An iterative code construction and codes generated by permutations for the asymmetric multiple-access channel. IEEE Trans. Inf. Theory 32(4): 607-612 (1986) - 1985
- [j6]Frans M. J. Willems, Edward C. van der Meulen:
The discrete memoryless multiple-access channel with cribbing encoders. IEEE Trans. Inf. Theory 31(3): 313-327 (1985) - 1983
- [j5]Frans M. J. Willems, Edward C. van der Meulen:
Partial feedback for the discrete memoryless multiple access channel. IEEE Trans. Inf. Theory 29(2): 287-290 (1983) - 1981
- [j4]Abbas A. El Gamal, Edward C. van der Meulen:
A proof of Marton's coding theorem for the discrete memoryless broadcast channel. IEEE Trans. Inf. Theory 27(1): 120-122 (1981)
1970 – 1979
- 1977
- [j3]Edward C. van der Meulen:
A survey of multi-way channels in information theory: 1961-1976. IEEE Trans. Inf. Theory 23(1): 1-37 (1977) - 1975
- [j2]Edward C. van der Meulen:
Random coding theorems for the general discrete memoryless broadcast channel. IEEE Trans. Inf. Theory 21(2): 180-190 (1975) - 1974
- [j1]Edward C. van der Meulen:
On a Problem by Ahlswede Regarding the Capacity Region of Certain Multiway Channels. Inf. Control. 25(4): 351-356 (1974)
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-25 05:42 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:
