Search the dblp DataBase
Edward C. van der Meulen :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
János Levendovszky , W. Mommaerts , Edward C. van der Meulen Neural Networks with Hysterisis Type of Nonlinearity Exhibit Global Optimization Property. [Citation Graph (0, 0)][DBLP ] IWANN, 1991, pp:62-68 [Conf ] Sándor Csibi , Edward C. von der Meulen Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint. [Citation Graph (0, 0)][DBLP ] GTIT-C, 2006, pp:218-248 [Conf ] Edward C. van der Meulen On a Problem by Ahlswede Regarding the Capacity Region of Certain Multiway Channels [Citation Graph (0, 0)][DBLP ] Information and Control, 1974, v:25, n:4, pp:351-356 [Journal ] János Levendovszky , Csaba Végsö , Edward C. van der Meulen Nonparametric decision algorithms for CAC in ATM networks. [Citation Graph (0, 0)][DBLP ] Perform. Eval., 2000, v:41, n:2-3, pp:133-147 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1992, v:38, n:5, pp:1437-1454 [Journal ] Alain Berlinet , Igor Vajda , Edward C. van der Meulen About the Asymptotic Accuracy of Barron Density Estimates. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:999-1009 [Journal ] Kristien de Bruyn , Edward C. van der Meulen An iterative code construction and codes generated by permutations for the asymmetric multiple-access channel. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1986, v:32, n:4, pp:607-0 [Journal ] Kristien de Bruyn , Vyacheslav V. Prelov , Edward C. van der Meulen Reliable transmission of two correlated sources over an asymmetric multiple-access channel. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1987, v:33, n:5, pp:716-0 [Journal ] Abbas A. El Gamal , Edward C. van der Meulen A proof of Marton's coding theorem for the discrete memoryless broadcast channel. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1981, v:27, n:1, pp:120-0 [Journal ] László Györfi , Istvan Pali , Edward C. van der Meulen There is no universal source code for an infinite source alphabet. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1994, v:40, n:1, pp:267-0 [Journal ] Vyacheslav V. Prelov , Edward C. van der Meulen An asymptotic expression for the information and capacity of a multidimensional channel with weak input signals. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1993, v:39, n:5, pp:1728-0 [Journal ] Igor Vajda , Edward C. van der Meulen Optimization of Barron density estimates. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1867-1883 [Journal ] Igor Vajda , Edward C. van der Meulen On minimum divergence adaptation of discrete bivariate distributions to given marginals. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:313-320 [Journal ] Peter Vanroose , Edward C. van der Meulen Uniquely decodable codes for deterministic relay channels. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1992, v:38, n:4, pp:1203-1212 [Journal ] Bart Verboven , Edward C. van der Meulen Capacity bounds for identification via broadcast channels which are optimal for the deterministic broadcast channel. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1197-1205 [Journal ] Frans M. J. Willems , Edward C. van der Meulen Partial feedback for the discrete memoryless multiple access channel. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1983, v:29, n:2, pp:287-0 [Journal ] Frans M. J. Willems , Edward C. van der Meulen The discrete memoryless multiple-access channel with cribbing encoders. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:313-327 [Journal ] Search in 0.004secs, Finished in 0.004secs