Text
IEEE Transactions on Information Theory | Vol. 61 No. 2
Table of Contents:
- Tight Bounds for Symmetric Divergence Measures and a Refined Bound for Lossless Source Coding (I. Sason)
- Entropy Power Inequality for the Renyi Entropy (S. G. Bobkov and G. P. Chistyakov)
- Dilworth Rate: A Generalization of Witsenhausen’s Zero-Error Rate for Directed Graphs (G. Simonyi and A. Téth)
- On Achievable Rates and Error Exponents for Channels With Mismatched Decoding (A. Somekh-Baruch)
- On Zero-Rate Error Exponents of Finite-State Channels With Input-Dependent States (N. Merhav)
- A Generalization of Peres’s Algorithm for Generating Random Bits From Loaded Dice (S. Pae)
- Polar Codes for Broadcast Channels (N. Goela, E. Abbe, and M. Gastpar)
- Achieving Marton’s Region for Broadcast Channels Using Polar Codes (M. Mondelli, S. H. Hassani, I. Sason and R, L. Urbanke)
- On the Covering Radius of MDS Codes (D. Bartoli, M. Giulietti, and I. Platoni)
- Complexity of Dependences in Bounded Domains, Armstrong Codes and Generalizations (X M. Chee, H. Zhang, and X. Zhang)
- On the List-Decodability of Random Self-Orthogonal Codes (L. Jin, C. Xing, and X. Zhang)
- Gray Code for Row-Reduced Echelon Forms Over the Binary Field (M. Braun)
- A Matroidal Framework for Network-Error Correcting Codes (R Krishnan and B. S. Rajan)
- A Unified Form of Exact-MSR Codes via Product-Matrix Frameworks (S.-J Lin, W-H. Chung, Y. S. Han, and T.Y. Al-Najfouri)
- Classification of the Z2Z4-Linear Hadamard Codes and Their Automorphism Groups (D. S. Krotov and M. Villanueva)
- Information Friction and Its Implications on Minimum Energy Required for Communication (P. Grover)
- Lattice Structures of Precoders Maximizing the Minimum Distance in Linear Channels (D. Kapetanovic, H. V Cheng, W H. Mom and F. Rusek)
- Interference Networks With no CSIT: Impact of Topology (N. Naderializadeh and A. S. Avestimehr)
- The Approximate Capacity Region of the Gaussian Y-Channel via the Deterministic Approach (A. Chaaban and A. Sezgin)
- Diversity-Multiplexing Tradeoff for the Interference Channel With a Relay (D. Zahavi, L. Zhang, I. Maric, R. Dabora, A. J. Goldsmith, and S. Cui)
- The Optimal Use of Rate-Limited Randomness in Broadcast Channels With Confidential Messages (S. Watanabe and Y. Oohama)
- Anonymity of Memory-Limited Chaum Mixes Under Timing Analysis: An Information Theoretic Perspective (P. Venkitasubramaniam and A. Mishra)
- Partition Information and Its Transmission Over Boolean Multi-Access Channels (S. Wu,S.Wei; Y. Wang, R. Vaidyanathan, and J. Yuan)
- Sparse Recovery With Graph' Constraints (M. Wang, W. Xu, E. Mallada, and A. Tang)
- Randomized Dimensionality Reduction for k-Means Clustering (C. Boutsidis, A. Zouzias, M. W Mahoney and R. Drineas)
- Optimal Feature Selection in High-Dimensional Discriminant Analysis (M. Kolar and H. Liu)
- Multigroup Testing for Items With Real-Valued Status Under Standard Arithmetic (F.-H. Chang, H.-B. Chen, J.-Y. Guo, and Y.-R. Huang)
- Entanglement Sampling and Applications (F. Dupuis, 0. Fawzi, and S. Wehner)
- Multiparty Zero-Error Classical Channel Coding With Entanglement (T. Piovesan, G, Scarpa, and C. Schajfner)
- Entanglement-Assisted Zero-Error Source-Channel Coding (J. Briet, H. Buhrman, M. Laurent, T. Piovesan and G. Scarpa)
- (m,n,3,I) Optical Orthogonal Signature Pattern Codes With Maximum Possible Size (R. Pan and K. Chang)
- Comments on “Canalizing Boolean Functions Maximize Mutual Information" (T A. Courtade)
No other version available