John C. Kieffer Comparison of two optimum rates for noiseless encoding of a nonstationary information source. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:256-261 [Journal]
John A. Gubner On the deterministic-code capacity of the multiple-access arbitrarily varying channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:262-275 [Journal]
Dan Hajela On computing the minimum distance for faster than Nyquist signaling. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:289-295 [Journal]
Ofir Shalvi, Ehud Weinstein New criteria for blind deconvolution of nonminimum phase systems (channels). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:312-321 [Journal]
T. T. Kadota A nonlinear optimum-detection problem - I: Theory. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:347-357 [Journal]
Jehoshua Bruck, Moni Naor The hardness of decoding linear codes with preprocessing. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:381-385 [Journal]
Henk D. L. Hollmann Design of test sequences for VLSI self-testing using LFSR. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:386-392 [Journal]
Philippe Jacquet, Eric Merle Analysis of a stack algorithm for CSMA-CD random length packet communication. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:420-0 [Journal]
Evaggelos Geraniotis Robust matched filters for noise uncertainty within two alternating capacity classes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:426-0 [Journal]
T. T. Kadota A nonlinear optimum-detection problem-II: Simple numerical examples. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:434-0 [Journal]
Kailash Birmiwal The minimum codeword length and redundancy in the binary Huffman code for uncertain sources. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:439-0 [Journal]
Nick J. Patterson, Douglas H. Wiedemann Correction to 'The covering radius of the (215, 16) Reed-Muller code is at least 16276' (May 83 354-356). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:443-0 [Journal]