Ram Zamir, Meir Feder Information rates of pre/post-filtered dithered quantizers. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1340-1353 [Journal]
Gary J. Sullivan Efficient scalar quantization of exponential and Laplacian random variables. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1365-1374 [Journal]
Amos Lapidoth Mismatched decoding and the multiple-access channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1439-1452 [Journal]
Yoichiro Watanabe The total capacity of two-user multiple-access channel with binary output. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1453-1465 [Journal]
Y. Levy, Daniel J. Costello Jr. A geometric construction procedure for geometrically uniform trellis codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1498-1513 [Journal]
Amos Lapidoth Nearest neighbor decoding for additive non-Gaussian noise channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1520-1529 [Journal]
A. Beghi On the relative entropy of discrete-time Markov processes with given end-point densities. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1529-1535 [Journal]
Shunsuke Ihara Some inequalities for channel capacities, mutual informations and mean-squared errors. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1536-1540 [Journal]
Julia Abrahams Generation of discrete distributions from biased coins. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1541-1546 [Journal]
Bane V. Vasic Capacity of channels with redundant multitrack (d, k) constraints: the k<d case. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1546-1548 [Journal]
H. Schwarte On weak convergence of probability measures, channel capacity and code error probabilities. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1549-1551 [Journal]
Steven S. Pietrobon On the probability of error of convolutional codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1562-1568 [Journal]
Andreas Weber, Tom Head The finest homophonic partition and related code concepts. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1569-1575 [Journal]
Mario A. de Boer Codes spanned by quadratic and Hermitian forms. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1600-1604 [Journal]
J. Ruprecht, M. Rupf On the search for good aperiodic binary invertible sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1604-1612 [Journal]
Torleiv Kløve Reed-Muller codes for error detection: the good, the bad, and the ugly. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1615-1622 [Journal]
K. Sakakibara, M. Kasahara On the minimum distance of a q-ary image of a qm-ary cyclic code. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1631-1635 [Journal]
P. Agabio, Ezio Biglieri Bounds on the weight hierarchy of generalized concatenated codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1635-1640 [Journal]
Alfred M. Bruckstein Review of 'Two-Dimensional Imaging' (Bracewell, R.N.; 1994). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1643- [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