John B. Anderson Sequential decoding based on an error criterion. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:987-1001 [Journal]
Timo Koski, Stamatis Cambanis On the statistics of the error in predictive coding for stationary Ornstein-Uhlenbeck processes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1029-1040 [Journal]
Michael L. Honig, Kenneth Steiglitz Maximizing the output energy of a linear channel with a time- and amplitude-limited input. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1041-1052 [Journal]
Salvatore D. Morgera The role of abstract algebra in structured estimation theory. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1053-1065 [Journal]
Eimear M. Goggin Convergence of filters with applications to the Kalman-Bucy case. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1091-1100 [Journal]
Santosh S. Venkatesh Robustness in neural computation: Random graphs and sparsity. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1114-0 [Journal]
John F. Humphreys Algebraic decoding of the ternary (13, 7, 5) quadratic residue code. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1122-0 [Journal]
Xing Chao-Ping When are two geometric Goppa codes equal? [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1140-0 [Journal]
Dusan B. Jevtic Disjoint uniquely decodable codebooks for noiseless synchronized multiple-access adder channels generated by integer sets. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1142-0 [Journal]
T. Aaron Gulliver Serf-reciprocal polynomials and generalized Fermat numbers. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1149-0 [Journal]
Klaus Huber Solving equations in finite fields and some results concerning the structure of GF(pm). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1154-0 [Journal]
Khaled Ben Letaief, John S. Sadowsky Computing bit-error probabilities for avalanche photodiode receivers by large deviations theory. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1162-0 [Journal]
Peter F. Swaszek Unrestricted multistage vector quantizers. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1169-0 [Journal]
Ron M. Roth Author's Reply to Comments on 'Maximum-rank array codes and their application to crisscross error correction'. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1183-0 [Journal]
Ernst M. Gabidulin Comments on 'Maximum-rank array codes and their application to crisscross error correction'. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1183-0 [Journal]
Tuvi Etzion Correction to 'New lower bounds for asymmetric and unidirectional codes' (Nov 91 1696-1704). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1183-0 [Journal]
Takeshi Hashimoto Correction to 'Source coding for average rate and average distortion: A new variable-length coding theorems' (Nov 83 785-792). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1184-0 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
