En-Hui Yang, John C. Kieffer On the Performance of Data Compression Algorithms Based Upon String Matching. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:47-65 [Journal]
András Méhes, Kenneth Zeger Binary Lattice Vector Quantization with Linear Block Codes and Affine Index Assignments. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:79-94 [Journal]
Eric M. Rains Shadow Bounds for Self-Dual Codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:134-139 [Journal]
Kenneth G. Paterson Binary Sequence Sets with Favorable Correlations from Difference Sets and MDS Codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:172-180 [Journal]
Rudolf Ahlswede, Imre Csiszár Common Randomness in Information Theory and Cryptography - Part II: CR Capacity. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:225-240 [Journal]
Thanh A. Diep Capacity of Multilevel Threshold Devices. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:241-255 [Journal]
Chuanyi Ji, Demetri Psaltis Capacity of Two-Layer Feedforward Neural Networks with Binary Weights. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:256-268 [Journal]
A. S. Holevo The Capacity of the Quantum Channel with General Signal States. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:269-273 [Journal]
Vladimir D. Tonchev Maximum Disjoint Bases and Constant-Weight Codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:333-334 [Journal]
Shraga I. Bross, Ian F. Blake Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:334-340 [Journal]
Anne Canteaut, Florent Chabaud A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece's Cryptosystem and to Narrow-Sense BCH Codes of Length 511. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:367-378 [Journal]
Kjell Jørgen Hole, Øyvind Ytrehus Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:423-431 [Journal]
Ludo M. G. M. Tolhuizen Correction to 'The Generalized Gilbert-Varshamov Bound is Implied by Turin's Theorem'. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:436- [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