• Generalized Hamming Weights for Almost Affine Codes   (T. Johnsen and H. Verdure)   
• Efficiently Decoding Reed-Muller Codes from Random Errors   (R. Saptharishi, A. Shpilka, and B. L. Volk)
• Deletion Codes in the High-Noise and High-Rate Regimes   (V. Guruswami and C. Wang)  
• Codes Correcting a Burst of Deletions or Insertions   (C. Schoeny, A. Wachter-Zeh, R. Gabrys and E. Yaakobi)  
• Relaxed Polar Codes   (M. El-Khamy, H. Mahdavifar, G. Feygin, J. Lee, and I. Kang)  
• Explicit Constructions of High-Rate MDS Array Codes with Optimal Repair Bandwidth   (M. Ye and A. Barg)  
• Constructions of High-Rate Minimum Storage Regenerating Codes over Small Fields   (N. Raviv, N. Silberstein, and T. Etzion)  
• Construction and Encoding of QC-LDPC Codes Using Group Rings   (H. Khodaiemehr and D. Kiani)  
• Switch Codes: Codes for Fully Parallel Reconstruction   (Z. Wang, H. M. Kiah, Y. Cassuto, and J. Bruck)  
• Blind Index Coding   (D. T. H. Kao, M. A. Maddah-Ali, and A. S. Avestimehr)  
• Lattice Index Codes from Algebraic Number Fields   (Yu-Chih Huang)  
• Efficient Algorithms for Noisy Group Testing   (S. Cai, M. Jahangoshahi, M. Bakshi, and S. Jaggi)

• Optimal Shrinkage of Singular Values   (M. Gavish and D. L. Donoho)  
• Riemannian Gaussian Distributions on the Space of Symmetric Positive Definite Matrices   (S. Said, L. Bombrun, Y. Berthoumieu,and J. H. Manton)  
• Recipes for Stable Linear Embeddings from Hilbert Spaces to R^m   (G. Puy, M. E. Davies, and R. Gribonval)  
• On Bandlimited Field Estimation from Samples Recorded by a Location-Unaware Mobile Sensor   (Animesh Kumar)  
• Adversarial Top-Κ Ranking   (C. Suh, V. Y. F. Tan, and R. Zhao)  
• A class of Weiss-Weinstein bounds and its relationship with the Bobrovsky-Mayer-Wolf-Zakaï bounds   (E. Chaumette, A. Renaux, and M. N. El Korsote)  

SHANNON THEORY

• The ρ-Capacity of a Graph   (S. Hu and O. Shayevitz)  
• Improving on the Cut-Set Bound via Geometric Analysis of Typical Sets   (X. Wu, A. Özgür, and L.-L. Xie)  
• The Log-Volume of Optimal Codes for Memoryless Channels, Asymptotically Within A Few Nats   (Pierre Moulin)  
• Information-Theoretic Lower Bounds for Distributed Function Computation   (A. Xu and M. Raginsky)  
• On the Capacity of Generalized Ising Channels   (A. Sharov and R. M. Roth)  
• Meta-Fibonacci Codes: Efficient Universal Coding of Natural Numbers   (B. T. Ávila and R. M. Campello de Souza)  

GAUSSIAN CHANNELS

• Models and Information Rates for Wiener Phase Noise Channels   (H. Ghozlan and G. Kramer)  
• On the Multiplexing Gain of Discrete-Time MIMO Phase Noise Channels   (S. Yang and S. Shamai)  
• Interactive Schemes for the AWGN Channel with Noisy Feedback   (A. Ben-Yishai and O. Shayevitz)  

SEQUENCES

• Exact Reconstruction from Insertions in Synchronization Codes   (F. Sala, R. Gabrys, C. Schoeny, and L. Dolecek)  
• New lower bounds for secure codes and related hash families: A hypergraph theoretical approach   (Y. Yang, Y. Zhang, and G. Ge)  
• On the Dual of the Coulter-Matthews Bent Functions   (H. Hu, Q. Zhang, and S. Shao)  

QUANTUM INFORMATION THEORY

• Sparse Quantum Codes from Quantum Circuits   (D. Bacon, S. T. Flammia, A. W. Harrow, and J. Shi)  

COMPLEXITY AND CRYPTOGRAPHY

• Quantum-Proof Randomness Extractors via Operator Space Theory   (M. Berta, O. Fawzi, and V. B. Scholz)  
• Random Number Conversion and LOCC Conversion via Restricted Storage   (Wataru Kumagai)  

SECURE COMMUNICATION

• A Large Deviations Approach to Secure Lossy Compression   (N. Weinberger and N. Merhav)  
• Wiretapped Oblivious Transfer   (M. Mishra, B. K. Dey, V. M. Prabhakaran, and S. N. Diggavi)  
• Source-Channel Secrecy for Shannon Cipher System   (L. Yu, H. Li, and W. Li)  

COMMENTS AND CORRECTIONS

• A Correction to ``Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius''   (N. Raviv and A. Wachter-Zeh)  
• Corrections to “Second-Order Asymptotics for Source Coding, Dense Coding, and Pure-State Entanglement Conversions”   (N. Datta and F. Leditzky)