Edward C. van der Meulen

According to our database1, Edward C. van der Meulen authored at least 30 papers between 1974 and 2009.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 1992, "For contributions to the study of multiway channels in information theory".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
Remark on "On Error-free Filtering of Finite-State Singular Processes under Dependent Distortions" published in <i>Probl. Peredachi Inf.</i>, 2007, no. 4.
Probl. Inf. Transm., 2009

2008
Mutual information, variation, and Fano's inequality.
Probl. Inf. Transm., 2008

2007
The Capacity of a Relay Channel, Both With and Without Delay.
IEEE Trans. Inf. Theory, 2007

On error-free filtering of finite-state singular processes under dependent distortions.
Probl. Inf. Transm., 2007

Minimum Probability of Error-Based Equalization Algorithms for Fading Channels.
EURASIP J. Wirel. Commun. Netw., 2007

2005
On minimum divergence adaptation of discrete bivariate distributions to given marginals.
IEEE Trans. Inf. Theory, 2005

Huge-size codes for identification via a multiple access channel under a word length constraint.
Electron. Notes Discret. Math., 2005

2004
Construction of new signature codes for the T-terminal binary adder multiple access channel with partially active users.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Higher-Order Asymptotics of Mutual Information for Nonlinear Channels with Non-Gaussian Noise.
Probl. Inf. Transm., 2003

2002
On the Epsilon-entropy of One Class of Ellipsoids in a Hamming Space.
Probl. Inf. Transm., 2002

Adaptive Near-Optimal Multiuser Detection Using a Stochastic and Hysteretic Hopfield Net Receiver.
EURASIP J. Adv. Signal Process., 2002

2001
Optimization of Barron density estimates.
IEEE Trans. Inf. Theory, 2001

2000
Nonparametric decision algorithms for CAC in ATM networks.
Perform. Evaluation, 2000

1998
About the Asymptotic Accuracy of Barron Density Estimates.
IEEE Trans. Inf. Theory, 1998

1994
There is no universal source code for an infinite source alphabet.
IEEE Trans. Inf. Theory, 1994

Analysis of critical effects in a stochastic neural model.
Proceedings of the 2nd European Symposium on Artificial Neural Networks, 1994

1993
An asymptotic expression for the information and capacity of a multidimensional channel with weak input signals.
IEEE Trans. Inf. Theory, 1993

On Universal Noiseless Source Coding for Infinite Source Alphabets.
Eur. Trans. Telecommun., 1993

1992
Uniquely decodable codes for deterministic relay channels.
IEEE Trans. Inf. Theory, 1992

Distribution estimation consistent in total variation and in two types of information divergence.
IEEE Trans. Inf. Theory, 1992

1991
Neural Networks with Hysterisis Type of Nonlinearity Exhibit Global Optimization Property.
Proceedings of the Artificial Neural Networks, 1991

1990
Capacity bounds for identification via broadcast channels which are optimal for the deterministic broadcast channel.
IEEE Trans. Inf. Theory, 1990

1987
Reliable transmission of two correlated sources over an asymmetric multiple-access channel.
IEEE Trans. Inf. Theory, 1987

1986
An iterative code construction and codes generated by permutations for the asymmetric multiple-access channel.
IEEE Trans. Inf. Theory, 1986

1985
The discrete memoryless multiple-access channel with cribbing encoders.
IEEE Trans. Inf. Theory, 1985

1983
Partial feedback for the discrete memoryless multiple access channel.
IEEE Trans. Inf. Theory, 1983

1981
A proof of Marton's coding theorem for the discrete memoryless broadcast channel.
IEEE Trans. Inf. Theory, 1981

1977
A survey of multi-way channels in information theory: 1961-1976.
IEEE Trans. Inf. Theory, 1977

1975
Random coding theorems for the general discrete memoryless broadcast channel.
IEEE Trans. Inf. Theory, 1975

1974
On a Problem by Ahlswede Regarding the Capacity Region of Certain Multiway Channels
Inf. Control., August, 1974


  Loading...