Journal: IEEE Transactions on Information Theory

Volume 56, Issue 9

4181 -- 4206Paul Cuff, Haim H. Permuter, Thomas M. Cover. Coordination capacity
4207 -- 4214Chandra Nair. Capacity regions of two new classes of two-receiver broadcast channels
4215 -- 4227Ruoheng Liu, Tie Liu, H. Vincent Poor, Shlomo Shamai. Multiple-input multiple-output Gaussian broadcast channels with confidential messages
4228 -- 4244Peter Harremoës, Oliver Johnson, Ioannis Kontoyiannis. Thinning, entropy, and the law of thin numbers
4245 -- 4255Alvaro Martín, Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger. Twice-universal simulation of Markov sources and individual sequences
4286 -- 4300Joseph Jean Boutros, Albert Guillen i Fabregas, Ezio Biglieri, Gilles Zémor. Low-density parity-check codes for nonergodic block-fading channels
4301 -- 4308Dmitri V. Truhachev, Kamil Sh. Zigangirov, Daniel J. Costello Jr.. Distance bounds for periodically time-varying and tail-biting LDPC convolutional codes
4309 -- 4320Yanling Chen, A. J. Han Vinck. A lower bound on the optimum distance profiles of the second-order Reed-Muller codes
4335 -- 4340Nathan Drake, Gretchen L. Matthews. Minimum distance decoding of general algebraic geometry codes via lists
4341 -- 4349Peter Trifonov. Efficient interpolation in the Guruswami-Sudan algorithm
4350 -- 4358Thomas Britz. Code enumerators and tutte polynomials
4359 -- 4366Roope Vehkalahti. The coding gain of real matrix lattices: bounds and existence results
4367 -- 4387Soheil Mohajer, Chao Tian, Suhas N. Diggavi. Asymmetric multilevel diversity coding and asymmetric Gaussian multiple descriptions
4388 -- 4394T. Tony Cai, Lie Wang, Guangwu Xu. New bounds for restricted isometry constants
4395 -- 4401Mark A. Davenport, Michael B. Wakin. Analysis of orthogonal matching pursuit using the restricted isometry property
4402 -- 4416Kiryung Lee, Yoram Bresler. ADMiRA: atomic decomposition for minimum rank approximation
4438 -- 4446Hongxiang Li, Guanying Ru, Younsun Kim, Hui Liu. OFDMA capacity analysis in MIMO channels
4447 -- 4470Hazer Inaltekin, Mung Chiang, H. Vincent Poor. Average message delivery time for small-world networks in the continuum limit
4471 -- 4487Sibi Raj Bhaskaran, Stephen V. Hanly, Nasreen Badruddin, Jamie S. Evans. Maximizing the sum rate in symmetric networks of interfering links
4488 -- 4505Alejandro Ribeiro, Georgios B. Giannakis. Separation principles in wireless networking
4506 -- 4519Sundar Subramanian, Sanjay Shakkottai. Geographic routing with limited information in sensor networks
4520 -- 4531Abhay T. Subramanian, Andrew Thangaraj. Path gain algebraic formulation for the scalar linear network coding problem
4532 -- 4538Da Wang, Danilo Silva, Frank R. Kschischang. Robust network coding in the presence of untrusted nodes
4539 -- 4551Alexandros G. Dimakis, Brighten Godfrey, Yunnan Wu, Martin J. Wainwright, Kannan Ramchandran. Network coding for distributed storage systems
4552 -- 4565Viveck R. Cadambe, Syed Ali Jafar, Chenwei Wang. Interference alignment with asymmetric complex signaling: settling the Høst-Madsen-Nosratinia conjecture
4566 -- 4592Guy Bresler, Abhay Parekh, David N. C. Tse. The approximate capacity of the many-to-one and one-to-many Gaussian interference channels
4593 -- 4607Nihat Ay, Markus Müller, Arleta Szkola. Effective complexity and its relation to logical depth
4608 -- 4630Saswati Sarkar, Eitan Altman, Pramod Vaidyanathan. Information concealing games
4631 -- 4642David Rebollo-Monedero, Jordi Forné. Optimized query forgery for private information retrieval
4643 -- 4645Graham H. Norton. Minimal polynomial algorithms for finite sequences
4646 -- 4652Tor Helleseth, Alexander Kholosha. New binomial bent functions over the finite fields of odd characteristic
4653 -- 4658Xiaohu Tang, Udaya Parampalli. On the noncyclic property of Sylvester Hadamard matrices
4659 -- 4667Mohammad M. Alem-Karladani, Jawad A. Salehi. Spectral classification and multiplicative partitioning of constant-weight sequences based on circulant matrix representation of optical orthogonal codes
4668 -- 4673Mikel Sanz, David Pérez-García, Michael M. Wolf, Juan I. Cirac. A quantum version of Wielandt s inequality
4674 -- 4681Marco Tomamichel, Roger Colbeck, Renato Renner. Duality between smooth min- and max-entropies
4682 -- 4704Min-Hsiu Hsieh, Mark M. Wilde. Entanglement-assisted communication of classical and quantum information
4705 -- 4730Min-Hsiu Hsieh, Mark M. Wilde. Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
4731 -- 4734Zhuo Li, Li-Juan Xing. On a problem concerning the quantum hamming bound for impure quantum codes
4735 -- 4740Lingfei Jin, San Ling, Jinquan Luo, Chaoping Xing. Application of classical hermitian self-orthogonal MDS codes to quantum MDS codes
4741 -- 4753Abdourrahmane M. Atto, Dominique Pastor, Grégoire Mercier. Wavelet packets of fractional Brownian motion: asymptotic analysis and spectrum estimation
4754 -- 4761Davide Cescato, Helmut Bölcskei. QR decomposition of Laurent polynomial matrices sampled on the unit circle
4762 -- 0Ender Tekin, Aylin Yener. Correction to: the Gaussian multiple access wire-tap channel and the general Gaussian multiple access and two-way wire-tap channels: achievable rates and cooperative jamming
4762 -- 0Jun Muramatsu, Shigeki Miyake. Corrections to hash property and coding theorems for sparse matrices and maximum-likelihood coding
4763 -- 0S. Sandeep Pradhan, Kannan Ramchandran. Correction to on functional duality in multiuser source and channel coding problems having one-sidedcollaboration