IEEE Transactions on Information Theory, Volume 55

Volume 55, Number 1, January 2009

• Louay Bazzi, Mohammad Mahdian, Daniel A. Spielman:
  The Minimum Distance of Turbo-Like Codes. 6-15
  
• Yuri L. Borissov:
  On the Cusick-Cheon Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code. 16-18
  
• Venkatesan Guruswami, Atri Rudra:
  Better Binary List Decodable Codes Via Multilevel Concatenation. 19-26
  
• Sarah J. Johnson:
  A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel. 27-32
  
• Charanjit S. Jutla, Anindya C. Patthak:
  Provably Good Codes for Hash Function Design. 33-45
  
• Navin Kashyap, David L. Neuhoff:
  Data Synchronization With Timing: The Variable-Rate Case. 46-52
  
• Stefan Laendner, Thorsten Hehn, Olgica Milenkovic, Johannes B. Huber:
  The Trapping Redundancy of Linear Block Codes. 53-63
  
• Chao Li, Qiang Li, San Ling:
  Properties and Applications of Preimage Distributions of Perfect Nonlinear Functions. 64-69
  
• Chao Li, Longjiang Qu, San Ling:
  On the Covering Structures of Two Classes of Linear Codes From Perfect Nonlinear Functions. 70-82
  
• Neri Merhav:
  Relations Between Random Coding Exponents and the Statistical Physics of Random Codes. 83-92
  
• Wai Ho Mow:
  Recursive Constructions of Detecting Matrices for Multiuser Coding: A Unifying Approach. 93-98
  
• Jaume Pujol, Josep Rifà, Faina I. Solov'eva:
  Construction of BBZ₄-Linear Reed-Muller Codes. 99-104
  
• Siman Yang:
  Improvements on Parameters of Algebraic-Geometry Codes From Hermitian Curves. 105-108
  
• Leonard Grokop, David N. C. Tse:
  Diversity-Multiplexing Tradeoff in ISI Channels. 109-135
  
• Dmitri V. Truhachev, Christian Schlegel, Lukasz Krzymien:
  A Two-Stage Capacity-Achieving Demodulation/Decoding Method for Random Matrix Channels. 136-146
  
• Michael Langberg, Alexander Sprintson, Jehoshua Bruck:
  Network Coding: A Computational Perspective. 147-157
  
• Peyman Razaghi, Wei Yu:
  Parity Forwarding for Multiple-Relay Networks. 158-173
  
• Peter Rost, Gerhard Fettweis:
  Analysis of a Mixed Strategy for Multiple Relay Networks. 174-189
  
• Osvaldo Simeone, Oren Somekh, H. Vincent Poor, Shlomo Shamai:
  Local Base Station Cooperation Via Finite-Capacity Links for the Uplink of Linear Cellular Networks. 190-204
  
• Dong Zheng, Weiyan Ge, Junshan Zhang:
  Distributed Opportunistic Scheduling for Ad Hoc Networks With Random Access: An Optimal Stopping Approach. 205-222
  
• Sanjay Karmakar, B. Sundar Rajan:
  Multigroup Decodable STBCs From Clifford Algebras. 223-231
  
• Terasan Niyomsataya, Ali Miri, Monica Nevins:
  An Application of theBruhat Decomposition to the Design of Full Diversity Unitary Space-Time Codes. 232-244
  
• Erik Stauffer, Djordje Tujkovic, Arogyaswami Paulraj:
  Code Rate-Diversity-Multiplexing Tradeoff. 245-254
  
• Vummintala Shashidhar, B. Sundar Rajan, P. Vijay Kumar:
  Asymptotic-Information-Lossless Designs and the Diversity-Multiplexing Tradeoff. 255-268
  
• Viveck R. Cadambe, Syed Ali Jafar, Shlomo Shamai:
  Interference Alignment on the Deterministic Channel and Application to Fully Connected Gaussian Interference Networks. 269-274
  
• Shraga I. Bross, Michele A. Wigger:
  On the Relay Channel With Receiver-Transmitter Feedback. 275-291
  
• Neri Merhav, Marcelo J. Weinberger:
  Universal Simulation With Fidelity Criteria. 292-302
  
• Amos Lapidoth, Stefan M. Moser:
  On the Capacity of the Discrete-Time Poisson Channel. 303-322
  
• Sekhar Tatikonda, Sanjoy K. Mitter:
  The Capacity of Channels With Feedback. 323-349
  
• Jiming Yu, Sergio Verdú:
  Universal Estimation of Erasure Entropy. 350-357
  
• Stéphane Boucheron, Aurélien Garivier, Elisabeth Gassiat:
  Coding on Countably Infinite Alphabets. 358-373
  
• V. Chandrasekaran, Michael B. Wakin, Dror Baron, Richard G. Baraniuk:
  Representation and Compression of Multidimensional Piecewise Functions Using Surflets. 374-400
  
• Hua Wang, Pramod Viswanath:
  Vector Gaussian Multiple Description With Two Levels of Receivers. 401-410
  
• Wen Ming Liu, Amr Youssef:
  On the Existence of (10, 2, 7, 488) Resilient Functions. 411-412
  
• Bernard C. Levy:
  Robust Hypothesis Testing With a Relative Entropy Tolerance. 413-421
  
• Urs Niesen, Aslan Tchamkerten:
  Tracking Stopping Times Through Noisy Observations. 422-432
  
• Andrew W. Cross, Graeme Smith, John A. Smolin, Bei Zeng:
  Codeword Stabilized Quantum Codes. 433-438
  
• Paolo Gibilisco, Fumio Hiai, Denes Petz:
  Quantum Covariance, Quantum Fisher Information, and the Uncertainty Relations. 439-443
  
• Pieter W. Adriaans, Paul M. B. Vitányi:
  Approximation of the Two-Part MDL Code. 444-457
  
• Wenfeng Jiang, Lei Hu, Xiaohu Tang, Xiangyong Zeng:
  New Optimal Quadriphase Sequences With Larger Linear Span. 458-470
  

Volume 55, Number 2, February 2009

• Abdelaziz Amraoui, Andrea Montanari, Thomas J. Richardson, Rüdiger L. Urbanke:
  Finite-Length Scaling for Iteratively Decoded LDPC Ensembles. 473-498
  
• Hao Chen, Pramod K. Varshney, S. M. Kay, James H. Michels:
  Noise Enhanced Nonparametric Detection. 499-506
  
• Vasken Bohossian, Jehoshua Bruck:
  Shortening Array Codes and the Perfect 1-Factorization Conjecture. 507-513
  
• Koji Momihara, Marco Buratti:
  Bounds and Constructions of Optimal (n, 4, 2, 1) Optical Orthogonal Codes. 514-523
  
• Ezio Biglieri, Yi Hong, Emanuele Viterbo:
  On Fast-Decodable Space-Time Block Codes. 524-530
  
• Shengli Fu, Xiang-Gen Xia, Haiquan Wang:
  Recursive Space-Time Trellis Codes Using Differential Encoding. 531-546
  
• K. Raj Kumar, Giuseppe Caire:
  Space-Time Codes From Structured Lattices. 547-556
  
• Hua-Chieh Li, Ming-Yang Chen:
  Generally Explicit Space-Time Codes With Nonvanishing Determinants for Arbitrary Numbers of Transmit Antennas. 557-563
  
• Huiyong Liao, Xiang-Gen Xia:
  Diversity Product Properties of Lu-Kumar's Space-Time Codes. 564-568
  
• Huiyong Liao, Haiquan Wang, Xiang-Gen Xia:
  Some Designs and Normalized Diversity Product Upper Bounds for Lattice-Based Diagonal and Full-Rate Space-Time Block Codes. 569-583
  
• Laura Luzzi, Ghaya Rekaya-Ben Othman, Jean-Claude Belfiore, Emanuele Viterbo:
  Golden Space-Time Block-Coded Modulation. 584-597
  
• Hon-Fah Chong, Mehul Motani:
  The Capacity Region of a Class of Semideterministic Interference Channels. 598-603
  
• Yingbin Liang, Anelia Somekh-Baruch, H. Vincent Poor, Shlomo Shamai, Sergio Verdú:
  Capacity of Cognitive Interference Channels With and Without Secrecy. 604-619
  
• Abolfazl S. Motahari, Amir K. Khandani:
  Capacity Bounds for the Gaussian Interference Channel. 620-643
  
• Haim H. Permuter, Tsachy Weissman, Andrea J. Goldsmith:
  Finite State Channels With Time-Invariant Deterministic Feedback. 644-662
  
• Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams:
  Optimization of Information Rate Upper and Lower Bounds for Channels With Memory. 663-688
  
• Xiaohu Shang, Gerhard Kramer, Biao Chen:
  A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for Gaussian Interference Channels. 689-699
  
• Raymond W. Yeung, Ning Cai, Siu-Wai Ho, Aaron B. Wagner:
  Reliable Communication in the Absence of a Common Clock. 700-712
  
• Yanwu Ding, Jian-Kang Zhang, Kon Max Wong:
  Ergodic Channel Capacities for the Amplify-and-Forward Half-Duplex Cooperative Systems. 713-730
  
• Krishna Srikanth Gomadam, Syed Ali Jafar:
  The Effect of Noise Correlation in Amplify-and-Forward Relay Networks. 731-745
  
• Somsak Kittipiyakul, Petros Elia, Tara Javidi:
  High-SNR Analysis of Outage-Limited Communications With Bursty and Delay-Limited Information. 746-763
  
• Fredrik Rusek, John B. Anderson:
  Constrained Capacities for Faster-Than-Nyquist Signaling. 764-775
  
• Shivratna Giri Srinivasan, Mahesh K. Varanasi:
  Optimal Constellations for the Low-SNR Noncoherent MIMO Block Rayleigh-Fading Channel. 776-796
  
• Tracey Ho, Harish Viswanathan:
  Dynamic Algorithms for Multicast With Intra-Session Network Coding. 797-815
  
• Animashree Anandkumar, Lang Tong, Ananthram Swami:
  Detection of Gauss-Markov Random Fields With Nearest-Neighbor Dependency. 816-827
  
• Hao Chen, Biao Chen, Pramod K. Varshney:
  Further Results on the Optimality of the Likelihood-Ratio Test for Local Sensor Decision Rules in the Presence of Nonideal Channels. 828-832
  
• Adil M. Bagirov, Conny Clausen, Michael Kohler:
  Estimation of a Regression Function by Maxima of Minima of Linear Functions. 833-845
  
• Shuheng Zhou, John D. Lafferty, Larry A. Wasserman:
  Compressed and Privacy-Sensitive Sparse Regression. 846-866
  
• Gennian Ge, Ying Miao, Zhongxiang Yao:
  Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties. 867-879
  
• Aina Johansen, Tor Helleseth:
  A Family of m -Sequences With Five-Valued Cross Correlation. 880-887
  
• Paul Tseng:
  Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise. 888-899
  
• Daniel Marco:
  Markov Random Processes Are Neither Bandlimited nor Recoverable From Samples or After Quantization. 900-905
  
• Lifeng Lai, Hesham El Gamal, H. Vincent Poor:
  Authentication Over Noisy Channels. 906-916
  
• David N. C. Tse, Pramod Viswanath:
  Fundamentals of Wireless Communication (Tse, D. and Viswanath, P.) [Book review]. 919-920
  

Volume 55, Number 3, March 2009

• Marko Aleksic, Peyman Razaghi, Wei Yu:
  Capacity of a Class of Modulo-Sum Relay Channels. 921-930
  
• Mathilde Durvy, Olivier Dousse, Patrick Thiran:
  Self-Organization Properties of CSMA/CA Systems and Their Consequences on Fairness. 931-943
  
• Sha Yao, Mikael Skoglund:
  Hybrid Digital-Analog Relaying for Cooperative Transmission Over Slow Fading Channels. 944-951
  
• Jürgen Bierbrauer, Yves Edel, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco:
  Short Additive Quaternary Codes. 952-954
  
• Cunsheng Ding:
  The Weight Distribution of Some Irreducible Cyclic Codes. 955-960
  
• Tuvi Etzion, Eitan Yaakobi:
  Error-Correction of Multidimensional Bursts. 961-976
  
• Eran Hof, Igal Sason, Shlomo Shamai:
  Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels. 977-996
  
• Ge Li, Ivan J. Fair, Witold A. Krzymien:
  Density Evolution for Nonbinary LDPC Codes Under Gaussian Approximation. 997-1015
  
• Zongpeng Li, Baochun Li, Lap Chi Lau:
  A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks. 1016-1026
  
• Enrico Paolini, Marc P. C. Fossorier, Marco Chiani:
  Doubly-Generalized LDPC Codes: Stability Bound Over the BEC. 1027-1046
  
• Yuansheng Tang, Xinmei Huang:
  A Note on Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding. 1047-1050
  
• Chao Tian, Vinay A. Vaishampayan, Neil J. A. Sloane:
  A Coding Algorithm for Constant Weight Vectors: A Geometric Approach Based on Dissections. 1051-1060
  
• Martin J. Wainwright, Emin Martinian:
  Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information. 1061-1079
  
• Xiaoyong Guo, Xiang-Gen Xia:
  An Elementary Condition for Non-Norm Elements. 1080-1085
  
• Camilla Hollanti, Hsiao-feng Lu:
  Construction Methods for Asymmetric and Multiblock Space-Time Codes. 1086-1103
  
• Haiquan Wang, Dong Wang, Xiang-Gen Xia:
  On Optimal Quasi-Orthogonal Space-Time Block Codes With Minimum Decoding Complexity. 1104-1130
  
• Fredrik Brannstrom, Lars K. Rasmussen:
  Classification of Unique Mappings for 8PSK Based on Bit-Wise Distance Spectra. 1131-1145
  
• Ismail Demirkan, Paul H. Siegel, Jack K. Wolf:
  Error Event Characterization on 2-D ISI Channels. 1146-1152
  
• Shunsuke Hayashi, Zhi-Quan Luo:
  Spectrum Management for Interference-Limited Multiuser Communication Systems. 1153-1175
  
• Ramy H. Gohary, Timothy N. Davidson:
  Noncoherent MIMO Communication: Grassmannian Constellations and Efficient Detection. 1176-1205
  
• Husheng Li, H. Vincent Poor:
  Asymptotic Analysis of Outage Region in CDMA MIMO Systems. 1206-1217
  
• Wiroonsak Santipach, Michael L. Honig:
  Capacity of a Multiple-Antenna Fading Channel With a Quantized Precoding Matrix. 1218-1234
  
• Ruoheng Liu, H. Vincent Poor:
  Secrecy Capacity Region of a Multiple-Antenna Gaussian Broadcast Channel With Confidential Messages. 1235-1249
  
• Neri Merhav:
  The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes. 1250-1268
  
• Ofer Shayevitz, Meir Feder:
  Achieving the Empirical Capacity Using Feedback: Memoryless Additive Models. 1269-1295
  
• Yangfan Zhong, Fady Alajaji, L. Lorne Campbell:
  Joint Source-Channel Coding Excess Distortion Exponent for Some Memoryless Continuous-Alphabet Systems. 1296-1319
  
• Runyao Duan, Yuan Feng, Yu Xin, Mingsheng Ying:
  Distinguishability of Quantum States by Separable Operations. 1320-1330
  
• Zhicheng Luo, Igor Devetak:
  Channel Simulation With Quantum Side Information. 1331-1342
  
• Noga Alon, Rani Hod:
  Optimal Monotone Encodings. 1343-1353
  
• Kishan Chand Gupta, Palash Sarkar:
  Computing Partial Walsh Transform From the Algebraic Normal Form of a Boolean Function. 1354-1359
  
• Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka, Shun Watanabe:
  Universal Source Coding OverGeneralized Complementary Delivery Networks. 1360-1373
  
• Krishnamurthy Viswanathan, Erik Ordentlich:
  Lower Limits of Discrete Universal Denoising. 1374-1386
  
• Haitao Cao, Ruizhong Wei:
  Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes. 1387-1394
  
• Husheng Li, H. Vincent Poor:
  Large System Spectral Analysis of Covariance Matrix Estimation. 1395-1422
  
• Urs Niesen, Devavrat Shah, Gregory W. Wornell:
  Adaptive Alternating Minimization Algorithms. 1423-1429
  
• Manabu Hagiwara, Marc P. C. Fossorier:
  Comment on "Quasi-Cyclic Low Density Parity Check Codes From Circulant Permutation Matrices". 1430
  

Volume 55, Number 4, April 2009

• Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe, Ugo Vaccaro:
  Two Batch Search With Lie Cost. 1433-1439
  
• Yaniv Akirav, Neri Merhav:
  Exact Characterization of the Minimax Loss in Error Exponents of Universal Decoders. 1440-1459
  
• Jun Luo, Dongning Guo:
  On the Entropy Rate of Hidden Markov Processes Observed Through Arbitrary Memoryless Channels. 1460-1467
  
• S. Yang, Y. Chen, P. Qiu:
  Linear-Codes-Based Lossless Joint Source-Channel Coding for Multiple-Access Channels. 1468-1486
  
• Yangfan Zhong, Fady Alajaji, L. Lorne Campbell:
  Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Coding Systems. 1487-1518
  
• Robert F. H. Fischer, Christian Siegl:
  Reed-Solomon and Simplex Codes for Peak-to-Average Power Ratio Reduction in OFDM. 1519-1528
  
• Thanh Tùng Kim, Mikael Skoglund, Giuseppe Caire:
  Quantifying the Loss of Compress-Forward Relaying Without Wyner-Ziv Coding. 1529-1533
  
• Nathan Levy, Oren Somekh, Shlomo Shamai, Ofer Zeitouni:
  On Certain Large Random Hermitian Jacobi Matrices With Applications to Wireless Communications. 1534-1554
  
• Vignesh Sethuraman, Ligong Wang, Bruce E. Hajek, Amos Lapidoth:
  Low-SNR Capacity of Noncoherent Fading Channels. 1555-1574
  
• Xiaojun Tang, Ruoheng Liu, Predrag Spasojevic, H. Vincent Poor:
  On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels. 1575-1591
  
• Nghi H. Tran, Ha H. Nguyen, Tho Le-Ngoc:
  Performance Analysis and Design Criteria of BICM-ID With Signal Space Diversity for Keyhole Nakagami-m Fading Channels. 1592-1602
  
• Stojan Z. Denic, Charalambos D. Charalambous, Seddik M. Djouadi:
  Information Theoretic Bounds for Compound MIMO Gaussian Channels. 1603-1617
  
• Thanh Tùng Kim, Giuseppe Caire:
  Diversity Gains of Power Control With Noisy CSIT in MIMO Channels. 1618-1626
  
• Weifeng Su, Zoltan Safar, K. J. Ray Liu:
  Orthogonal Space-Time Block Codes With Sphere Packing. 1627-1639
  
• Tianyu Wu, Vincent K. N. Lau:
  Robust Precoder Adaptation for MIMO Links With Noisy Limited Feedback. 1640-1649
  
• Cedric Florens, Masoud Sharif, Robert J. McEliece:
  Random Sensory Networks: A Delay Analysis. 1650-1664
  
• Gaurav Sharma, Ayalvadi J. Ganesh, Peter B. Key:
  Performance Analysis of Contention Based Medium Access Control Protocols. 1665-1682
  
• V. Bach, R. Seiler:
  Analysis of Optimal High Resolution and Fixed Rate Scalar Quantization. 1683-1691
  
• J. Cheng:
  On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources. 1692-1695
  
• M. B. J. Higgs, Stephanie Perkins, Derek H. Smith:
  The Construction of Variable Length Codes With Good Synchronization Properties. 1696-1700
  
• J. Wang, X. Wu, S. Yu, J. Sun:
  New Results on Multiple Descriptions in the Wyner-Ziv Setting. 1701-1708
  
• Yunnan Wu, Vladimir Stankovic, Zixiang Xiong, Sun-Yuan Kung:
  On Practical Design for Joint Distributed Source and Network Coding. 1709-1720
  
• Y. Cassuto, J. Bruck:
  Cyclic Lowest Density MDS Array Codes. 1721-1729
  
• H. Q. Dinh:
  Constacyclic Codes of Length BBF₂+uBBF₂. 1730-1740
  
• Todd K. Moon, Jacob H. Gunther, J. J. Kupin:
  Sinkhorn Solves Sudoku. 1741-1746
  
• J. Park, J. Moon:
  Error-Pattern-Correcting Cyclic Codes Tailored to a Prescribed Set of Error Cluster Patterns. 1747-1765
  
• Josep Rifà, Faina I. Solov'eva, Mercè Villanueva:
  On the Intersection of BBZ₂BBZ₄-Additive Hadamard Codes. 1766-1774
  
• Jeremiah J. Harmsen, William A. Pearlman:
  Capacity of Steganographic Channels. 1775-1792
  
• E. Lee, H.-S. Lee, C.-M. Park:
  Efficient and Generalized Pairing Computation on Abelian Varieties. 1793-1803
  
• Andrzej K. Brodzik, Richard Tolimieri:
  Bat Chirps With Good Properties: Zak Space Construction of Perfect Polyphase Sequences. 1804-1814
  
• Y. K. Han, K. Yang:
  New M -Ary Sequence Families With Low Correlation and Large Size. 1815-1823
  
• K.-U. Schmidt:
  Quaternary Constant-Amplitude Codes for Multicode CDMA. 1824-1832
  
• Xiaohu Tang, Tor Helleseth, Lei Hu, Wenfeng Jiang:
  Two New Families of Optimal Binary Sequences Obtained From Quaternary Sequences. 1833-1840
  
• Nicolas Bissantz, Hajo Holzmann, M. Pawlak:
  Testing for Image Symmetries - With Application to Confocal Microscopy. 1841-1855
  
• Joel B. Predd, Sanjeev R. Kulkarni, H. Vincent Poor:
  A Collaborative Training Algorithm for Distributed Learning. 1856-1871
  
• Thomas Blumensath, Michael E. Davies:
  Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces. 1872-1882
  
• G. Casinovi:
  Sampling and Ergodic Theorems for Weakly Almost Periodic Signals. 1883-1897
  
• Karol Horodecki, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim:
  General Paradigm for Distilling Classical Key From Quantum States. 1898-1929
  
• Yiannis Socratous, Farzad Rezaei, Charalambos D. Charalambous:
  Nonlinear Estimation for a Class of Systems. 1930-1938
  
• Martin Haenggi:
  Correction to "A Geometric Interpretation of Fading in Wireless Networks: Theory and Applications" [Dec 08 5500-5510]. 1939
  

Volume 55, Number 5, May 2009

• Jacob Ziv:
  The universal LZ77 compression algorithm is essentially optimal for individual finite-length N-blocks. 1941-1944
  
• Maxim Raginsky:
  Joint universal lossy coding and identification of stationary mixing sources with general alphabets. 1945-1960
  
• Ankit Gupta, Sergio Verdú:
  Nonlinear sparse-graph codes for lossy compression. 1961-1975
  
• Chih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Poor:
  Finding all small error-prone substructures in LDPC codes. 1976-1999
  
• Kees A. Schouhamer Immink, Kui Cai:
  Simple classes of constrained systems with unconstrained positions that outperform the maxentropic bound. 2000-2003
  
• Jagadeesh Harshan, B. Sundar Rajan:
  High-rate, single-symbol ML decodable precoded DSTBCs for cooperative networks. 2004-2015
  
• David Haley, Alex J. Grant:
  Reversible low-density parity-check codes. 2016-2036
  
• Giacomo Como, Fabio Fagnani:
  The capacity of finite Abelian group codes over symmetric memoryless channels. 2037-2054
  
• Shashi Kiran Chilappagari, Bane V. Vasic:
  Error-correction capability of column-weight-three LDPC codes. 2055-2061
  
• Fredrik Brännström, Lars K. Rasmussen, Alex J. Grant:
  Optimal puncturing ratios and energy allocation for multiple parallel concatenated codes. 2062-2077
  
• Grégory Berhuy, Frédérique E. Oggier:
  On the existence of perfect space-time codes. 2078-2082
  
• Yoichiro Watanabe, Koichi Kamoi:
  A formulation of the channel capacity of multiple-access channel. 2083-2096
  
• Ertem Tuncel:
  Capacity/storage tradeoff in high-dimensional identification systems. 2097-2106
  
• Alexander Schönhuth, Herbert Jaeger:
  Characterization of ergodic hidden Markov sources. 2107-2118
  
• Alexander Schönhuth:
  On analytic properties of entropy rate. 2119-2127
  
• Mohammad Ali Maddah-Ali, Amin Mobasher, Amir K. Khandani:
  Fairness in multiuser systems with polymatroid capacity region. 2128-2138
  
• Giacomo Como, Serdar Yüksel, Sekhar Tatikonda:
  The error exponent of variable-length codes over Markov channels with feedback. 2139-2160
  
• Shraga I. Bross:
  On the discrete memoryless partially cooperative relay broadcast channel and the broadcast channel with cooperating decoders. 2161-2182
  
• Martin J. Wainwright:
  Sharp thresholds for high-dimensional and noisy sparsity recovery using l1-constrained quadratic programming (Lasso). 2183-2202
  
• Michael Evan Davies, Rémi Gribonval:
  Restricted isometry constants where l^psparse recovery can fail for 0 < p <= 1. 2203-2214
  
• Wei Dai, Olgica Milenkovic:
  Weighted superimposed codes and constrained integer compressed sensing. 2215-2229
  
• Wei Dai, Olgica Milenkovic:
  Subspace pursuit for compressive sensing signal reconstruction. 2230-2249
  
• Gerard Ascensi, Joaquim Bruna:
  Model space results for the Gabor and wavelet transforms. 2250-2259
  
• Tsan-Ming Wu, Tsung-Hua Tsai:
  Successive interference cancelers for multimedia multicode DS-CDMA systems over frequency-selective fading channels. 2260-2282
  
• Sundeep Venkatraman, Oliver M. Collins:
  The performance of BICM with a single decision feedback for the AWGN channel. 2283-2291
  
• Mei Chen, Oliver M. Collins:
  Multilevel coding for nonlinear ISI channels. 2292-2303
  
• Kaushik Chakraborty, Subhrakanti Dey, Massimo Franceschetti:
  Service-outage-based power and rate control for poisson fading channels. 2304-2318
  
• Somsak Kittipiyakul, Tara Javidi:
  Delay-optimal server allocation in multiqueue multiserver systems with time-varying connectivities. 2319-2333
  
• Viveck R. Cadambe, Syed Ali Jafar:
  Degrees of freedom of wireless networks with relays, feedback, cooperation, and full duplex operation. 2334-2344
  
• Darryl Dexu Lin, Teng Joon Lim:
  A variational inference framework for soft-in soft-out detection in multiple-access channels. 2345-2364
  
• Daniele Angelosante, Ezio Biglieri, Marco Lops:
  Multiuser detection in a dynamic environment: part II: joint user identification and parameter estimation. 2365-2374
  
• Thomas Decker:
  Symmetric measurements attaining the accessible information. 2375-2383
  
• Yun Kyoung Han, Kyeongcheol Yang:
  On the cross-correlation distributions of M-ary multiplicative character sequences. 2384-2391
  
• Qing Wang, Sanjeev R. Kulkarni, Sergio Verdú:
  Divergence estimation for multidimensional densities via k-nearest-neighbor distances. 2392-2405
  
• Longjiang Qu, Keqin Feng, Feng Liu, Lei Wang:
  Constructing symmetric boolean functions with maximum algebraic immunity. 2406-2412
  
• Ciamac Cyrus Moallemi, Benjamin Van Roy:
  Convergence of min-sum message passing for quadratic optimization. 2413-2423
  

Volume 55, Number 6, June 2009

• Osvaldo Simeone, Deniz Gündüz, H. Vincent Poor, Andrea J. Goldsmith, Shlomo Shamai:
  Compound multiple-access channels with partial cooperation. 2425-2441
  
• Tal Philosof, Ram Zamir:
  On the loss of single-letter characterization: the dirty multiple access channel. 2442-2454
  
• Haim H. Permuter, Tsachy Weissman, Jun Chen:
  Capacity region of the finite-state multiple-access channel with and without feedback. 2455-2477
  
• Yoav Nebat, Rene L. Cruz, Sumit Bhardwaj:
  The capacity of wireless networks in nonergodic random fading. 2478-2493
  
• Vivek P. Mhatre, Catherine Rosenberg, Ravi R. Mazumdar:
  On the capacity of ad hoc networks under random packet losses. 2494-2498
  
• Yindi Jing, Hamid Jafarkhani:
  Network beamforming using relays with perfect channel information. 2499-2517
  
• Vaneet Aggarwal, Amir Bennatan, A. Robert Calderbank:
  On maximizing coverage in Gaussian relay channels. 2518-2536
  
• Ertem Tuncel, Jayanth Nayak, Prashant Koulgi, Kenneth Rose:
  On complementary graph entropy. 2537-2546
  
• Tie Liu, Shlomo Shamai:
  A note on the secrecy capacity of the multiple-antenna wiretap channel. 2547-2553
  
• Christos P. Kitsos, Nikolaos K. Tavoularis:
  Logarithmic Sobolev inequalities for information measures. 2554-2561
  
• Jun Tong, Li Ping, Xiao Ma:
  Superposition coded modulation with peak-power limitation. 2562-2576
  
• Roxana Smarandache, Ali Emre Pusane, Pascal O. Vontobel, Daniel J. Costello Jr.:
  Pseudocodeword performance analysis for LDPC convolutional codes. 2577-2598
  
• Igor Shparlinski:
  On the values of Kloosterman sums. 2599-2601
  
• Igal Sason, Gil Wiechman:
  Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel. 2602-2617
  
• Christophe Mouaha:
  On cyclic q-ary images in concatenated form. 2618-2621
  
• Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen, Faina I. Solov'eva:
  Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs. 2622-2625
  
• John J. Metzner:
  Simplification of packet-symbol decoding with errors, deletions, misordering of packets, and no sequence numbers. 2626-2639
  
• Alberto Jiménez Feltström, Dmitri V. Truhachev, Michael Lentmaier, Kamil Sh. Zigangirov:
  Braided block codes. 2640-2658
  
• Anxiao Jiang, Robert Mateescu, Moshe Schwartz, Jehoshua Bruck:
  Rank modulation for flash memories. 2659-2673
  
• Idan Goldenberg, David Burshtein:
  Upper bound on error exponent of regular LDPC codes transmitted over the BEC. 2674-2681
  
• Sanjay Karmakar, B. Sundar Rajan:
  High-rate, multisymbol-decodable STBCs from Clifford algebras. 2682-2695
  
• Zhihong Hong, Ke Liu, Nigel Boston, Akbar M. Sayeed:
  Algebraic number precoding for space-time block codes. 2696-2704
  
• Pedram Pad, Farokh Marvasti, Kasra Alishahi, Saieed Akbari:
  A class of errorless codes for overloaded synchronous wireless and optical CDMA systems. 2705-2715
  
• Stefan M. Moser:
  The fading number of multiple-input multiple-output fading channels with memory. 2716-2755
  
• Alfonso Martinez, Albert Guillen i Fabregas, Giuseppe Caire, Frans M. J. Willems:
  Bit-interleaved coded modulation revisited: a mismatched decoding perspective. 2756-2765
  
• Andrea Conti, Dmitry Panchenko, Sergiy Sidenko, Velio Tralli:
  Log-concavity property of the error probability with application to local bounds for wireless communications. 2766-2775
  
• David Poulin, Jean-Pierre Tillich, Harold Ollivier:
  Quantum serial turbo codes. 2776-2798
  
• Yuan Feng, Yaoyun Shi:
  Characterizing locally indistinguishable orthogonal product states. 2799-2806
  
• Nilanjana Datta, Renato Renner:
  Smooth entropies and the quantum information spectrum. 2807-2815
  
• Nilanjana Datta:
  Min- and max-relative entropies and a new entanglement monotone. 2816-2826
  
• Youngchul Sung, H. Vincent Poor, Heejung Yu:
  How much information can one get from a wireless ad hoc sensor network over a correlated random field? 2827-2847
  
• Hendra Ishwara Nurdin, Ravi R. Mazumdar, Arunabha Bagchi:
  Reduced-dimension linear transform coding of distributed correlated signals with incomplete observations. 2848-2858
  
• Jesús Navarro-Moreno, María Dolores Estudillo-Martínez, Rosa M. Fernández-Alcalá, Juan Carlos Ruiz-Molina:
  Estimation of improper complex-valued random signals in colored noise by using the Hilbert space theory. 2859-2867
  
• Jun Chen, Chao Tian, Suhas N. Diggavi:
  Multiple description coding for stationary Gaussian sources. 2868-2881
  
• Frank Nielsen, Richard Nock:
  Sided and symmetrized Bregman centroids. 2882-2904
  
• Francesco Gianfelici, Viviana Battistelli:
  Review of "Methods of information geometry" by Shunichi Amari and Hiroshi Nagaoka, American Mathematical Society and Oxford University Press, 2000. 2905-2906
  

Volume 55, Number 7, July 2009

• Tuvi Etzion, Natalia Silberstein:
  Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams. 2909-2919
  
• Heide Gluesing-Luerssen, Gert Schneider:
  A MacWilliams identity for convolutional codes: the general case. 2920-2930
  
• Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman:
  Error-correcting codes for automatic control. 2931-2941
  
• Eirik Rosnes:
  On the pairwise error probability of linear programming decoding on independent Rayleigh flat-fading channels. 2942-2955
  
• Igal Sason:
  On universal properties of capacity-approaching LDPC code ensembles. 2956-2990
  
• Georg Schmidt, Vladimir Sidorenko, Martin Bossert:
  Collaborative decoding of interleaved Reed-Solomon codes and concatenated code designs. 2991-3012
  
• Yong Sun, Yang Yang, Angelos D. Liveris, Vladimir Stankovic, Zixiang Xiong:
  Near-capacity dirty-paper code design: a source-channel coding approach. 3013-3031
  
• V. Sreekanth Annapureddy, Venugopal V. Veeravalli:
  Gaussian interference networks: sum capacity in the low-interference regime and new outer bounds on the capacity region. 3032-3050
  
• Erdal Arikan:
  Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. 3051-3073
  
• Peter Berlin, Baris Nakiboglu, Bixio Rimoldi, Emre Telatar:
  A simple converse of Burnashev's reliability function. 3074-3080
  
• Andrew W. Eckford:
  Ordering finite-state Markov channels by mutual information. 3081-3086
  
• Daniel Francis Schmidt, Enes Makalic:
  Universal models for the exponential distribution. 3087-3090
  
• Árpád Baricz, Yin Sun:
  New bounds for the generalized Marcum Q-function. 3091-3100
  
• Sameer A. Pawar, K. Raj Kumar, Petros Elia, P. Vijay Kumar, B. A. Sethuraman:
  Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel. 3101-3114
  
• Øyvind Ryan, Mérouane Debbah:
  Asymptotic behavior of random vandermonde matrices with entries on the unit circle. 3115-3147
  
• Huseyin Balli, Xijin Yan, Zhen Zhang:
  On randomized linear network codes and their error correction capabilities. 3148-3160
  
• Petros Elia, K. Vinodh, M. Anand, P. Vijay Kumar:
  D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols. 3161-3185
  
• K. Raj Kumar, Giuseppe Caire:
  Coding and decoding for the dynamic decode and forward relay protocol. 3186-3205
  
• Oren Somekh, Osvaldo Simeone, Yeheskel Bar-Ness, Alexander M. Haimovich, Shlomo Shamai:
  Cooperative multicell zero-forcing beamforming in cellular downlink channels. 3206-3219
  
• Farhad Meshkati, H. Vincent Poor, Stuart C. Schwartz:
  Energy efficiency-delay tradeoffs in CDMA networks: a game-theoretic approach. 3220-3228
  
• Sanjoy Dasgupta, Yoav Freund:
  Random projection trees for vector quantization. 3229-3242
  
• Aurélia Fraysse, Béatrice Pesquet-Popescu, Jean-Christophe Pesquet:
  On the uniform quantization of a class of sparse sources. 3243-3263
  
• Yangfan Zhong, Fady Alajaji, Tamás Linder:
  Random-coding lower bounds for the error exponent of joint quantization and watermarking systems. 3264-3283
  
• Daniel Marco, Michelle Effros:
  On lossless coding with coded side information. 3284-3296
  
• Cunsheng Ding, Ryoh Fuji-Hara, Yuichiro Fujiwara, Masakazu Jimbo, Miwako Mishima:
  Sets of frequency hopping sequences: bounds and optimal constructions. 3297-3304
  
• Tor Helleseth, Lei Hu, Alexander Kholosha, Xiangyong Zeng, Nian Li, Wenfeng Jiang:
  Period-different m-sequences with at most four-valued cross correlation. 3305-3311
  
• Kenneth W. Shum, Chung Shue Chen, Chi Wan Sung, Wing Shing Wong:
  Shift-invariant protocol sequences for the collision channel without feedback. 3312-3322
  
• Savas Dayanik, Christian Goulding:
  Sequential detection and identification of a change in the distribution of a Markov-modulated random sequence. 3323-3345
  
• Olympia Hadjiliadis, Hongzhong Zhang, H. Vincent Poor:
  One shot schemes for decentralized quickest change detection. 3346-3359
  
• Igor Bjelakovic, Holger Boche:
  Classical capacities of compound and averaged quantum channels. 3360-3374
  
• Dong Yang, Karol Horodecki, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim, Wei Song:
  Squashed entanglement for multipartite states and entanglement measures based on the mixed convex roof. 3375-3387
  
• T. Tony Cai, Guangwu Xu, Jun Zhang:
  On recovery of sparse signals via l1 minimization. 3388-3397
  
• Enes Pasalic:
  On guess and determine cryptanalysis of LFSR-based stream ciphers. 3398-3406
  
• Mohammad Shaqfeh, Norbert Goertz:
  Comments on the boundary of the capacity region of multiaccess fading channels. 3407-3408
  
• Imre Csiszár:
  Review of "Information theory and network coding" by Raymond W. Yeung, Springer, 2008. 3409
  

Volume 55, Number 8, August 2009

• Massimo Franceschetti, Marco Donald Migliore, Paolo Minero:
  The capacity of wireless networks: information-theoretic and physical limits. 3413-3424
  
• Javad Ghaderi, Liang-Liang Xie, Xuemin Shen:
  Hierarchical cooperation in ad hoc networks: optimal clustering and achievable throughput. 3425-3436
  
• Jiaping Liu, Alexandre Proutiére, Yung Yi, Mung Chiang, H. Vincent Poor:
  Stability, fairness, and performance: a flow-level study on nonconvex and time-varying rate regions. 3437-3456
  
• Amichai Sanderovich, Oren Somekh, H. Vincent Poor, Shlomo Shamai:
  Uplink macro diversity of limited backhaul cellular network. 3457-3478
  
• Alexandros G. Dimakis, Amin A. Gohari, Martin J. Wainwright:
  Guessing facets: polytope structure and improved LP decoder. 3479-3487
  
• Morteza Esmaeili, Mohammad Javad Amoshahy:
  On the stopping distance of array code parity-check matrices. 3488-3493
  
• Hendrik C. Ferreira, Khaled A. S. Abdel-Ghaffar, Ling Cheng, Theo G. Swart, Khmaies Ouahada:
  Moment balancing templates: constructions to add insertion/deletion correction capability to error correcting or constrained codes. 3494-3500
  
• Navin Kashyap:
  On minimal tree realizations of linear codes. 3501-3519
  
• Torleiv Kløve:
  Constructing proper codes for error detection. 3520-3525
  
• Teng Li, Oliver M. Collins:
  Design and analysis of successive decoding with finite levels for the Markov channel. 3526-3543
  
• Eyal Lubetzky, Uri Stav:
  Nonlinear index coding outperforming the linear optimum. 3544-3551
  
• Carmen Martínez, Ramón Beivide, Ernst M. Gabidulin:
  Perfect codes from Cayley graphs over Lipschitz integers. 3552-3562
  
• Marko J. Moisio:
  On certain values of Kloosterman sums. 3563-3564
  
• Ido Tal, Tuvi Etzion, Ron M. Roth:
  On row-by-row coding for 2-D constraints. 3565-3576
  
• Kasra Alishahi, Farokh Marvasti, Vahid Aref, Pedram Pad:
  Bounds on the sum capacity of synchronous binary CDMA channels. 3577-3593
  
• Tobias Koch, Amos Lapidoth, Paul-Peter Sotiriadis:
  Channels that heat up. 3594-3612
  
• Miquel Payaró, Daniel Pérez Palomar:
  Hessian and concavity of mutual information, differential entropy, and entropy power in linear vector Gaussian channels. 3613-3628
  
• Brooke Shrader, Haim H. Permuter:
  Feedback capacity of the compound channel. 3629-3644
  
• Yaming Yu:
  On the entropy of compound distributions on nonnegative integers. 3645-3650
  
• Wei Dai, Youjian Liu, Brian Rider:
  The effect of finite rate feedback on CDMA signature optimization and MIMO beamforming vector selection. 3651-3669
  
• Chien-Hwa Hwang:
  Asymptotic theorems for the product of certain structured random matrices and their application to analysis of synchronous CDMA. 3670-3700
  
• Vasilios M. Kapinas, Sotirios K. Mihos, George K. Karagiannidis:
  On the monotonicity of the generalized Marcum and Nuttall Q-functions. 3701-3710
  
• John Papandriopoulos, Jamie S. Evans:
  SCALE: a low-complexity distributed protocol for spectrum balancing in multiuser DSL networks. 3711-3724
  
• Charalambos D. Charalambous, Stojan Z. Denic, Costas Constantinou:
  Capacity of the class of MIMO channels with incomplete CDI: properties of mutual information for a class of channels. 3725-3734
  
• Xiqi Gao, Bin Jiang, Xiao Li, Alex B. Gershman, Matthew R. McKay:
  Statistical eigenmode transmission over jointly correlated MIMO channels. 3735-3750
  
• Roope Vehkalahti, Camilla Hollanti, Jyrki T. Lahtonen, Kalle Ranto:
  On the densest MIMO lattices from cyclic division algebras. 3751-3780
  
• Alenka G. Zajic, Gordon L. Stüber:
  A space-time code design for CPM: diversity order and coding gain. 3781-3798
  
• Kristiaan Pelckmans, Jos De Brabanter, Johan A. K. Suykens, Bart De Moor:
  Least conservative support and tolerance tubes. 3799-3806
  
• Masahito Hayashi:
  Discrimination of two channels by adaptive methods and its application to quantum system. 3807-3820
  
• Zhuo Li, Li-Juan Xing, Xinmei Wang:
  A family of asymptotically good quantum codes based on code concatenation. 3821-3824
  
• Patrice Abry, Pierre Chainais, Laure Coutin, Vladas Pipiras:
  Multifractal random walks as fractional Wiener integrals. 3825-3846
  
• Gregory Cresp, Hai Huyen Dam, Hans-Jürgen Zepernick:
  Design of sequence family subsets using a branch and bound technique. 3847-3857
  
• Chaoping Xing, Yang Ding:
  Multisequences with large linear and k-error linear complexity from Hermitian function fields. 3858-3863
  
• Todd P. Coleman, Emin Martinian, Erik Ordentlich:
  Joint source-channel coding for transmitting correlated sources over broadcast networks. 3864-3868
  
• Chao Tian, Soheil Mohajer, Suhas N. Diggavi:
  Approximating the Gaussian multiple description rate region under symmetric distortion constraints. 3869-3891
  
• Tor M. Aulin:
  Comment on "improved analysis of list decoding and its application to convolutional codes and turbo codes". 3892
  

Volume 55, Number 9, September 2009

• Viveck R. Cadambe, Syed Ali Jafar:
  Interference alignment and the degrees of freedom of wireless X networks. 3893-3908
  
• Yijia Fan, Chao Wang, H. Vincent Poor, John S. Thompson:
  Cooperative multiplexing: toward higher spectral efficiency in multiple-antenna relay networks. 3909-3926
  
• Deniz Gündüz, Elza Erkip, Andrea J. Goldsmith, H. Vincent Poor:
  Source and channel coding for correlated sources over multiuser channels. 3927-3944
  
• Aleksandar Jovicic, Pramod Viswanath:
  Cognitive radio: an information-theoretic perspective. 3945-3958
  
• Urs Niesen, Piyush Gupta, Devavrat Shah:
  On capacity scaling in arbitrary wireless networks. 3959-3982
  
• Viveck R. Cadambe, Syed Ali Jafar:
  Parallel Gaussian interference channels are not always separable. 3983-3990
  
• Jun Chen:
  Rate region of Gaussian multiple description coding with individual and central distortion constraints. 3991-4005
  
• Jun Chen, Dake He, Ashish Jagmohan:
  On the duality between Slepian-Wolf coding and channel coding under mismatched decoding. 4006-4018
  
• Hamidreza Farmanbar, Amir K. Khandani:
  Precoding for the AWGN channel with discrete interference. 4019-4032
  
• Shabnam Shafiee, Nan Liu, Sennur Ulukus:
  Towards the secrecy capacity of the Gaussian MIMO wire-tap channel: the 2-2-1 channel. 4033-4039
  
• Sahand Haji Ali Ahmad, Mingyan Liu, Tara Javidi, Qing Zhao, Bhaskar Krishnamachari:
  Optimality of myopic sensing in multichannel opportunistic access. 4040-4050
  
• Changhun Bae, Wayne E. Stark:
  End-to-end energy-bandwidth tradeoff in multihop wireless networks. 4051-4066
  
• Radha Krishna Ganti, Martin Haenggi:
  Interference and outage in clustered wireless ad hoc networks. 4067-4086
  
• Jiaping Liu, Alexander L. Stolyar, Mung Chiang, H. Vincent Poor:
  Queue back-pressure random access in multihop wireless networks: optimality and stability. 4087-4098
  
• Nathan Axvig, Deanna Dreher, Katherine Morrison, Eric Psota, Lance C. Pérez, Judy L. Walker:
  Analysis of connections between pseudocodewords. 4099-4107
  
• Marat V. Burnashev, Ilya Dumer:
  Error exponents for two soft-decision decoding algorithms of Reed-Muller codes. 4108-4118
  
• Stark C. Draper, Frank R. Kschischang, Brendan J. Frey:
  Rateless coding for arbitrary channel mixtures with decoder channel state information. 4119-4133
  
• Mark F. Flanagan, Vitaly Skachek, Eimear Byrne, Marcus Greferath:
  Linear-programming decoding of nonbinary linear codes. 4134-4154
  
• Junsheng Han, Paul H. Siegel, Ron M. Roth:
  Single-exclusion number and the stopping redundancy of MDS codes. 4155-4166
  
• Eirik Rosnes, Øyvind Ytrehus:
  An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices. 4167-4178
  
• Ron M. Roth, Pascal O. Vontobel:
  List decoding of burst errors. 4179-4190
  
• Chia-Lung Wu, Po-Ning Chen, Yunghsiang S. Han, Ming-Hsin Kuo:
  Maximum-likelihood priority-first search decodable codes for combined channel estimation and error correction. 4191-4203
  
• Kostis Xenoulis, Nicholas Kalouptsidis:
  Improvement of Gallager upper bound and its variations for discrete channels. 4204-4210
  
• Chiachi Huang, Syed Ali Jafar:
  Degrees of freedom of the MIMO interference channel with cooperation and cognition. 4211-4220
  
• Pablo Piantanida, Gerald Matz, Pierre Duhamel:
  Outage behavior of discrete memoryless channels under channel estimation errors. 4221-4239
  
• Wenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Laneman:
  On downlink transmission without transmit channel state information and with outage constraints. 4240-4248
  
• Kaoru Kurosawa, Tsuyoshi Takagi:
  One-wayness equivalent to general factoring. 4249-4262
  
• Yassir Nawaz, Kishan Chand Gupta, Guang Gong:
  Algebraic immunity of S-boxes based on power mappings: analysis and construction. 4263-4273
  
• Yanxun Chang, Xiao Wang:
  New upper bound for (m, k, lambda)-IRSs with lambda >= 2. 4274-4278
  
• Yun Kyoung Han, Kyeongcheol Yang:
  On the Sidel'nikov sequences as frequency-hopping sequences. 4279-4285
  
• Jayanth Nayak, Ertem Tuncel:
  Successive coding of correlated sources. 4286-4298
  
• Sina Jafarpour, Weiyu Xu, Babak Hassibi, A. Robert Calderbank:
  Efficient and robust compressed sensing using optimized expander graphs. 4299-4308
  
• Boris Ryabko:
  Compression-based methods for nonparametric prediction and estimation of some characteristics of time series. 4309-4315
  
• Stéphan Clémençon, Nicolas Vayatis:
  Tree-based ranking methods. 4316-4336
  
• Robert König, Renato Renner, Christian Schaffner:
  The operational meaning of min- and max-entropy. 4337-4347
  
• Luca G. Tallini, Sulaiman Al-Bassam, Bella Bose:
  Correction to "Feedback codes achieving the capacity of the Z-channel". 4348-4350
  

Volume 55, Number 10, October 2009

• Dongwoon Bai, Patrick Mitran, Saeed S. Ghassemzadeh, Robert R. Miller, Vahid Tarokh:
  Rate of channel hardening of antenna selection diversity schemes and its implication on scheduling. 4353-4365
  
• Xiaoyong Guo, Xiang-Gen Xia:
  On full diversity space-time block codes with partial interference cancellation group decoding. 4366-4385
  
• Abla Kammoun, Malika Kharouf, Walid Hachem, Jamal Najim:
  BER and outage probability approximations for LMMSE detectors on correlated MIMO channels. 4386-4397
  
• K. Raj Kumar, Giuseppe Caire, Aris L. Moustakas:
  Asymptotic performance of linear receivers in MIMO fading channels. 4398-4418
  
• Amichai Sanderovich, Shlomo Shamai, Yossef Steinberg:
  Distributed MIMO receiver: achievable rates and upper bounds. 4419-4438
  
• Le Chung Tran, Tadeusz A. Wysocki, Jennifer Seberry, Alfred Mertins, Sarah Spence Adams:
  Novel constructions of improved square complex orthogonal designs for eight transmit antennas. 4439-4448
  
• Amos Lapidoth, Stefan M. Moser, Michele A. Wigger:
  On the capacity of free-space optical intensity channels. 4449-4461
  
• Pierre Moulin:
  A Neyman-Pearson approach to universal erasure and list decoding. 4462-4478
  
• Chandra Nair, Abbas El Gamal:
  The capacity region of a class of three-receiver broadcast channels with degraded message sets. 4479-4493
  
• Ravi Tandon, Sennur Ulukus:
  Outer bounds for multiple-access channels with feedback using dependence balance. 4494-4507
  
• Aslan Tchamkerten, Venkat Chandar, Gregory W. Wornell:
  Communication under strong asynchronism. 4508-4528
  
• Jin Xu, Yi Cao, Biao Chen:
  Capacity bounds for broadcast channels with confidential messages. 4529-4542
  
• Mustafa Cenk Gursoy:
  On the capacity and energy efficiency of training-based transmissions over fading channels. 4543-4567
  
• Zuleita Ka Ming Ho, Vincent K. N. Lau, Roger Shu-Kwan Cheng:
  Cross-layer design of FDD-OFDM systems based on ACK/NAK feedbacks. 4568-4584
  
• Mehdi Ansari Sadrabadi, Alireza Bayesteh, Amir K. Khandani:
  Achieving long-term fairness and optimum multiuser diversity gain in time-varying broadcast channels. 4585-4597
  
• Shabnam Shafiee, Sennur Ulukus:
  Mutual information games in multiuser channels with correlated jamming. 4598-4607
  
• Nianjun Zhou, Alhussein A. Abouzeid:
  Information theoretic analysis of proactive routing overhead in mobile ad hoc networks. 4608-4625
  
• Søren Forchhammer, Jørn Justesen:
  Block pickard models for two-dimensional constraints. 4626-4634
  
• Shrinivas Kudekar, Nicolas Macris:
  Sharp bounds for optimal decoding of low-density parity-check codes. 4635-4650
  
• Roberto Montemanni, Derek H. Smith:
  Heuristic algorithms for constructing binary constant weight codes. 4651-4656
  
• Patric R. J. Östergård, Olli Pottonen:
  The perfect binary one-error-correcting codes of length 15: part I-classification. 4657-4660
  
• Jan Østergaard, Ram Zamir:
  Multiple-description coding by dithered delta-sigma quantization. 4661-4675
  
• Chao Tian, Jun Chen:
  Remote vector Gaussian source coding with decoder side information under mutual information and distortion constraints. 4676-4680
  
• Tuvi Etzion, Nicholas Kalouptsidis, Nicholas Kolokotronis, Konstantinos Limniotis, Kenneth G. Paterson:
  Properties of the error linear complexity spectrum. 4681-4686
  
• Honggang Hu, Guang Gong, Dengguo Feng:
  New results on periodic sequences with large k-error linear complexity. 4687-4694
  
• Ana Salagean:
  An algorithm for computing minimal bidirectional linear recurrence relations. 4695-4700
  
• Michael Elad, Irad Yavneh:
  A plurality of sparse representations is better than the sparsest one alone. 4701-4714
  
• Veit Elser:
  Noise limits on reconstructing diffraction signals from random tomographs. 4715-4722
  
• Niall P. Hurley, Scott T. Rickard:
  Comparing measures of sparsity. 4723-4741
  
• Patrick Lacharme:
  Analysis and construction of correctors. 4742-4748
  
• Palash Sarkar:
  Efficient tweakable enciphering schemes from (block-wise) universal hash functions. 4749-4760
  
• Yoav Levinbook, Tan F. Wong:
  Restricted risk Bayes linear state estimation. 4761-4776
  
• Enbin Song, Xiaojing Shen, Jie Zhou, Yunmin Zhu, Zhisheng You:
  Performance analysis of communication direction for two-sensor tandem binary decision system. 4777-4785
  
• Joel B. Predd, Robert Seiringer, Elliott H. Lieb, Daniel N. Osherson, H. Vincent Poor, Sanjeev R. Kulkarni:
  Probabilistic coherence and proper scoring rules. 4786-4792
  

Volume 55, Number 11, November 2009

• Cyril Measson, Andrea Montanari, Thomas J. Richardson, Rüdiger L. Urbanke:
  The generalized area theorem and some of its consequences. 4793-4821
  
• Sujay Sanghavi, Devavrat Shah, Alan S. Willsky:
  Message passing for maximum weight independent set. 4822-4834
  
• David Burshtein:
  Iterative approximate linear programming decoding of LDPC codes with linear complexity. 4835-4859
  
• Bas Heijne, Jaap Top:
  On the minimal distance of binary self-dual cyclic codes. 4860-4863
  
• Navin Kashyap:
  Constraint complexity of realizations of linear codes on arbitrary graphs. 4864-4877
  
• Yuval Kochman, Ram Zamir:
  Joint Wyner-Ziv/dirty-paper coding by modulo-lattice modulation. 4878-4889
  
• Margreta Kuijper, Raquel Pinto:
  On minimality of convolutional ring encoders. 4890-4897
  
• Irina Naydenova, Torleiv Kløve:
  Some optimal binary and ternary t-EC-AUED codes. 4898-4904
  
• Chiara Ravazzi, Fabio Fagnani:
  Spectra and minimum distances of repeat multiple-accumulate codes. 4905-4924
  
• Shun-ichi Amari:
  alpha-divergence is unique, belonging to both f-divergence and Bregman divergence classes. 4925-4931
  
• Raúl H. Etkin, Erik Ordentlich:
  The degrees-of-freedom of the K-user Gaussian interference channel is discontinuous at rational channel coefficients. 4932-4946
  
• Masahito Hayashi:
  Information spectrum approach to second-order coding rate in channel coding. 4947-4966
  
• Nathan Levy, Shlomo Shamai:
  Clustered local decoding for Wyner-type cellular models. 4967-4985
  
• Nan Liu, Andrea J. Goldsmith:
  Capacity regions and bounds for a class of Z-interference channels. 4986-4994
  
• Yossef Steinberg:
  Coding and common reconstruction. 4995-5010
  
• Hanan Weingarten, Tie Liu, Shlomo Shamai, Yossef Steinberg, Pramod Viswanath:
  The capacity region of the degraded multiple-input multiple-output compound broadcast channel. 5011-5023
  
• Jay Cheng, Toby Berger:
  On minimal eigenvalues of a class of tridiagonal matrices. 5024-5031
  
• Wei Dai, Youjian Liu, Brian Rider, Vincent K. N. Lau:
  On the information rate of MIMO systems with finite rate channel state feedback using beamforming and power on/off strategy. 5032-5047
  
• Abla Kammoun, Malika Kharouf, Walid Hachem, Jamal Najim:
  A central limit theorem for the SINR at the LMMSE estimator output for large-dimensional signals. 5048-5063
  
• Tùng T. Kim, H. Vincent Poor:
  On the diversity gain of AF and DF relaying with noisy CSI at the source transmitter. 5064-5073
  
• Chris T. K. Ng, Deniz Gündüz, Andrea J. Goldsmith, Elza Erkip:
  Distortion minimization in Gaussian layered broadcast coding with successive refinement. 5074-5086
  
• Gino T. Peeters, Benny Van Houdt:
  On the maximum stable throughput of tree algorithms with free access. 5087-5099
  
• Adnan Raja, Vinod M. Prabhakaran, Pramod Viswanath:
  The two-user compound interference channel. 5100-5120
  
• Shengshan Cui, Alexander M. Haimovich, Oren Somekh, H. Vincent Poor:
  Opportunistic relaying in wireless networks. 5121-5137
  
• Michael Katz, Shlomo Shamai:
  Cooperative schemes for a source and an occasional nearby relay in wireless networks. 5138-5160
  
• Rui Zhang, Shuguang Cui, Ying-Chang Liang:
  On ergodic sum capacity of fading cognitive multiple-access and broadcast channels. 5161-5178
  
• Zvika Ben-Haim, Yonina C. Eldar:
  A lower bound on the Bayesian MSE based on the optimal bias function. 5179-5196
  
• Elias Masry, Prakash Ishwar:
  Field estimation from randomly located binary noisy sensors. 5197-5210
  
• Nicholas Kolokotronis, Konstantinos Limniotis, Nicholas Kalouptsidis:
  Best affine and quadratic approximations of particular classes of Boolean functions. 5211-5222
  
• Kaoru Kurosawa, Kazuhiro Suzuki:
  Truly efficient 2-round perfectly secure message transmission scheme. 5223-5232
  
• Enes Pasalic:
  Probabilistic versus deterministic algebraic cryptanalysis: a performance comparison. 5233-5240
  
• Andrzej K. Brodzik, Robert H. Enders:
  Semigroup structure of singleton Dempster-Shafer evidence accumulation. 5241-5250
  
• Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer:
  Individual sequence prediction using memory-efficient context trees. 5251-5262
  
• Elena Dubrova:
  A transformation from the Fibonacci to the Galois NLFSRs. 5263-5271
  
• Tor Helleseth, Henk D. L. Hollmann, Alexander Kholosha, Zeying Wang, Qing Xiang:
  Proofs of two conjectures on ternary weakly regular bent functions. 5272-5283
  
• Taesup Moon, Tsachy Weissman:
  Discrete denoising with shifts. 5284-5301
  
• Yonina C. Eldar, Moshe Mishali:
  Robust recovery of signals from a structured union of subspaces. 5302-5316
  
• Aditya Mahajan, Demosthenis Teneketzis:
  Optimal design of sequential real-time communication systems. 5317-5338
  
• Jon T. Yard, Igor Devetak:
  Optimal quantum source coding with quantum side information at the encoder and decoder. 5339-5351
  

Volume 55, Number 12, December 2009

• Ehsan Ardestanizadeh, Massimo Franceschetti, Tara Javidi, Young-Han Kim:
  Wiretap channel with secure rate-limited feedback. 5353-5361
  
• Siu-Wai Ho, Raymond W. Yeung:
  On the discontinuity of the Shannon information measures. 5362-5374
  
• Frantisek Matús:
  Divergence from factorizable distributions and matroid representations by partitions. 5375-5381
  
• Neri Merhav:
  Joint source channel coding via statistical mechanics: thermal equilibrium between the source and the channel. 5382-5393
  
• Lalitha Sankar, Narayan B. Mandayam, H. Vincent Poor:
  On the sum-capacity of degraded Gaussian multiple-access relay channels. 5394-5411
  
• Yaming Yu:
  Monotonic convergence in an information-theoretic law of small numbers. 5412-5422
  
• Shahab Oveis Gharan, Alireza Bayesteh, Amir K. Khandani:
  On the diversity: multiplexing tradeoff in multiple-relay network. 5423-5444
  
• Stephen V. Hanly, Lachlan L. H. Andrew, Thaya Thanabalasingham:
  Dynamic allocation of subcarriers and transmit powers in an OFDMA cellular network. 5445-5462
  
• Yalin Evren Sagduyu, Anthony Ephremides:
  On broadcast stability of queue-based dynamic network coding over erasure channels. 5463-5478
  
• Danilo Silva, Frank R. Kschischang:
  On metrics for error correction in network coding. 5479-5490
  
• John MacLaren Walsh, Steven Weber, Ciira Wa Maina:
  Optimal rate: delay tradeoffs and delay mitigating codes for multipath routed and network coded networks. 5491-5510
  
• Shashi Borade, Baris Nakiboglu, Lizhong Zheng:
  Unequal error protection: an information-theoretic perspective. 5511-5539
  
• Narayan Prasad, Xiaodong Wang:
  Outage minimization and rate allocation for the multiuser Gaussian interference channels with successive group decoding. 5540-5557
  
• Osvaldo Simeone, Oren Somekh, H. Vincent Poor, Shlomo Shamai:
  Distributed MIMO systems for nomadic applications over a symmetric interference channel. 5558-5574
  
• Jun Chen, Dake He, Ashish Jagmohan, Luis Alfonso Lastras-Montaño, En-Hui Yang:
  On the linear codebook-level duality between Slepian-Wolf coding and channel coding. 5575-5590
  
• Sorina Dumitrescu, Xiaolin Wu:
  On properties of locally optimal multiple description scalar quantizers with convex cells. 5591-5606
  
• Dake He, Luis Alfonso Lastras-Montaño, En-Hui Yang, Ashish Jagmohan, Jun Chen:
  On the redundancy of Slepian--Wolf coding. 5607-5627
  
• Dinesh Krithivasan, S. Sandeep Pradhan:
  Lattices for distributed source coding: jointly Gaussian sources and reconstruction of a linear function. 5628-5651
  
• Ali Abdi:
  On the utility of Laguerre series for the envelope PDF in multipath fading channels. 5652-5660
  
• Prabir Barooah, João P. Hespanha:
  Error scaling laws for linear optimal estimation from relative measurements. 5661-5673
  
• Holger Boche, Volker Pohl:
  Rate of convergence in approximating the spectral factor of regular stochastic sequences. 5674-5681
  
• Jun Fang, Hongbin Li:
  Hyperplane-based vector quantization for distributed estimation in wireless sensor networks. 5682-5699
  
• Lee K. Jones:
  Local minimax learning of functions with best finite sample estimation error bounds: applications to ridge and lasso regression, boosting, tree learning, kernel machines, and inverse problems. 5700-5727
  
• Martin J. Wainwright:
  Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting. 5728-5741
  
• Yonina C. Eldar:
  Uncertainty relations for shift-invariant analog signals. 5742-5757
  
• Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal:
  Necessary and sufficient conditions for sparsity pattern recovery. 5758-5772
  
• Rachel Ward:
  Compressed sensing with cross validation. 5773-5782
  
• Jin-Ho Chung, Yun Kyoung Han, Kyeongcheol Yang:
  New classes of optimal frequency-hopping sequences by interleaving techniques. 5783-5791
  
• Aina Johansen, Tor Helleseth, Alexander Kholosha:
  Further results on m-sequences with five-valued cross correlation. 5792-5802
  
• Kai-Uwe Schmidt:
  Z4-valued quadratic forms and quaternary sequence families. 5803-5810
  
• Axel Huebner, Jörg Kliewer, Daniel J. Costello Jr.:
  Double serially concatenated convolutional codes with jointly designed S-type permutors. 5811-5821
  
• WeiGuo Zhang, GuoZhen Xiao:
  Constructions of almost optimal resilient Boolean functions on large even number of variables. 5822-5831
  
• Guang Han, Armand M. Makowski:
  One-dimensional geometric random graphs with nonvanishing densities: part I: a strong zero-one law for connectivity. 5832-5839
  
• Marco Tomamichel, Roger Colbeck, Renato Renner:
  A fully quantum asymptotic equipartition property. 5840-5847
  
• Christophe Mouaha:
  Corrections to "on cyclic q-ary images in concatenated form". 5848
  
• Wenyi Zhang, J. Nicholas Laneman:
  Errata for "how good is PSK for peak-imited fading channels in the low-SNR regime? ". 5848