Ofir Shalvi, Ehud Weinstein Maximum likelihood and lower bounds in system identification with non-Gaussian inputs. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:328-339 [Journal]
Lang Tong, Guanghan Xu, Thomas Kailath Blind identification and equalization based on second-order statistics: a time domain approach. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:340-349 [Journal]
Gregory Poltyrev On coding without restrictions for the AWGN channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:409-417 [Journal]
Lars K. Rasmussen, Stephen B. Wicker The performance of type-I trellis coded hybrid-ARQ protocols over AWGN and slowly fading channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:418-428 [Journal]
Yoram Baram Corrective memory by a symmetric sparsely encoded network. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:429-438 [Journal]
L. K. Jones Good weights and hyperbolic kernels for neural networks, projection pursuit, and pattern classification: Fourier strategies for extracting information from high-dimensional data. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:439-454 [Journal]
Gábor Lugosi, Miroslaw Pawlak On the posterior-probability estimate of the error rate of nonparametric classification rules. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:475-481 [Journal]
Thierry P. Berger The automorphism group of double-error-correcting BCH codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:538-0 [Journal]
Takeshi Hashimoto On the error exponent of convolutionally coded ARQ. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:567-0 [Journal]
Tamás Linder, Kenneth Zeger Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:575-0 [Journal]
Péter Gács, A. Gal Lower bounds for the complexity of reliable Boolean circuits with noisy gates. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:579-0 [Journal]
Kenjiro Yanagi An upper bound to the capacity of discrete time Gaussian channel with feedback - Part II. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:588-0 [Journal]
G. Hedby Error bounds for the Euclidean channel subject to intentional jamming. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:594-0 [Journal]