J. Suzuki On Strong Consistency of Model Selection in Classification. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4767-4774 [Journal]

A. Steiner, S. S. Shamai Single-User Broadcasting Protocols Over a Two-Hop Relay Fading Channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4821-4838 [Journal]

Tadashi Wadayama Average Coset Weight Distribution of Combined LDPC Matrix Ensembles. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4856-4866 [Journal]

Tuvi Etzion On the Stopping Redundancy of Reed-Muller Codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4867-4879 [Journal]

M. Burnashev, Ilya Dumer Error Exponents for Recursive Decoding of Reed-Muller Codes on a Binary-Symmetric Channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4880-4891 [Journal]

Gil I. Shamir Universal Lossless Compression With Unknown Alphabets - The Average Case. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4915-4944 [Journal]

Benjamin Farber, Kenneth Zeger Quantization of Multiple Sources Using Nonnegative Integer Bit Allocation. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4945-4964 [Journal]

Sung-il Pae, Michael C. Loui Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4965-4976 [Journal]

C. Bordenave Spatial Capacity of Multiple-Access Wireless Networks. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4977-4988 [Journal]

Y. Gabbai, Shraga I. Bross Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4989-5007 [Journal]

E. Hof, Shraga I. Bross On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel With Degraded Message Sets. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5023-5044 [Journal]

Nihar Jindal MIMO Broadcast Channels With Finite-Rate Feedback. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5045-5060 [Journal]

R. Vaze, B. Sundar Rajan On Space-Time Trellis Codes Achieving Optimal Diversity Multiplexing Tradeoff. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5060-5067 [Journal]

Randall Dougherty, Kenneth Zeger Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5067-5077 [Journal]

K. Censor, Tuvi Etzion The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5128-5140 [Journal]

W. Mao, X. Su, X. Xu Comments on "Correlated Jamming on MIMO Gaussian Fading Channels". [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5163-5165 [Journal]

Marc Andre Armand Correction to "List Decoding of Generalized Reed-Solomon Codes Over Commutative Rings". [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5167-5167 [Journal]

P. Xu Erratum for "Voronoi Cells, Probabilistic Bounds, and Hypothesis Testing in Mixed Integer Linear Models". [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5168- [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