T. Weissman, Abbas El Gamal Source Coding With Limited-Look-Ahead Side Information at the Decoder. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5218-5239 [Journal]
S. Matloub, T. Weissman Universal Zero-Delay Joint Source-Channel Coding. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5240-5250 [Journal]
G. Han, B. Marcus Analyticity of Entropy Rate of Hidden Markov Chains. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5251-5266 [Journal]
L. A. Lastras-Montao On Certain Pathwise Properties of the Sliding-Window Lempel-Ziv Algorithm. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5267-5283 [Journal]
H. Zhang, H. Dai, Q. Zhou, B. L. Hughes On the Diversity Order of Spatial Multiplexing Systems With Transmit Antenna Selection: A Geometrical Approach. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5297-5311 [Journal]
A. Medles, Dirk T. M. Slock Achieving the Optimal Diversity-Versus-Multiplexing Tradeoff for MIMO Flat Channels With QAM Space-Time Spreading and DFE Equalization. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5312-5323 [Journal]
O. Henkel Geometrical Relations Between Space-Time Block Code Designs and Complexity Reduction. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5324-5335 [Journal]
Steven H. Simon, Aris L. Moustakas, L. Marinelli Capacity and Character Expansions: Moment-Generating Function and Other Exact Results for MIMO Correlated Channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5336-5351 [Journal]
S. S. Kunniyur, S. S. Venkatesh Threshold Functions, Node Isolation, and Emergent Lacunae in Sensor Networks. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5352-5372 [Journal]
Nick G. Duffield Network Tomography of Binary Network Performance Characteristics. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5373-5388 [Journal]
Onkar Dabeer, A. Karnik Signal Parameter Estimation Using 1-Bit Dithered Quantization. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5389-5405 [Journal]
Emmanuel J. Candès, Terence Tao Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5406-5425 [Journal]
Samir Jafar Capacity With Causal and Noncausal Side Information: A Unified View. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5468-5474 [Journal]
Michael Mitzenmacher Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the q-ary Random Deletion Channel for Large q. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5496-5501 [Journal]
Alberto Perotti, Sergio Benedetto An Upper Bound on the Minimum Distance of Serially Concatenated Convolutional Codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5501-5509 [Journal]
S. Murphy The Independence of Linear Approximations in Symmetric Cryptanalysis. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5510-5518 [Journal]
Kalle Ranto, Petri Rosendahl On Four-Valued Niho-Type Cross-Correlation Functions of m-Sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5533-5536 [Journal]
H. Chen Reducing the Computation of Linear Complexities of Periodic Sequences Over GF(pm). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5537-5539 [Journal]
Armand M. Makowski On the Optimality of Uniform Pulse Amplitude Modulation. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5546-5549 [Journal]
Luca G. Tallini, Samir Elmougy, Bella Bose Analysis of Plain and Diversity Combining Hybrid ARQ Protocols Over the m(geq 2)-Ary Asymmetric Channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5550-5558 [Journal]
Michael Elad Why Simple Shrinkage Is Still Relevant for Redundant Representations? [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5559-5569 [Journal]
A. Garivier Redundancy of the Context-Tree Weighting Method on Renewal and Markov Renewal Processes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5579-5586 [Journal]
Chandrashekhara Thejaswi, V. Sharma Adaptive Joint Source-Channel Rate Allocation Policies for Delay Sensitive Applications Over Fading Channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5587-5598 [Journal]