| 6 | -- | 17 | Robert G. Gallager, Baris Nakiboglu. Variations on a theme by Schalkwijk and Kailath |
| 18 | -- | 24 | Tyrone E. Duncan. Mutual information for stochastic signals and Lévy processes |
| 25 | -- | 39 | Krishnan Eswaran, Anand D. Sarwate, Anant Sahai, Michael Gastpar. Zero-rate feedback can achieve the empirical capacity |
| 40 | -- | 56 | Raúl Hernán Etkin, Neri Merhav, Erik Ordentlich. Error exponents of optimum decoding for the interference channel |
| 86 | -- | 102 | Adam Kirsch, Eleni Drinea. Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications |
| 103 | -- | 112 | Sarah Spence Adams, Nathaniel Karst, Mathav Kishore Murugan. The final case of the decoding delay problem for maximum rate complex orthogonal designs |
| 113 | -- | 120 | Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan. Subspace polynomials and limits to list decoding of Reed-Solomon codes |
| 121 | -- | 129 | Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov, Victor V. Zyablov. Woven graph codes: asymptotic performances and examples |
| 130 | -- | 139 | Yaotsu Chang, Chong-Dao Lee. Algebraic decoding of a class of binary cyclic codes via Lagrange interpolation formula |
| 152 | -- | 167 | Mao-Ching Chiu. Bandwidth-efficient modulation codes based on nonbinary irregular repeat-accumulate codes |
| 168 | -- | 180 | Ngoc-Dung Dào, Chintha Tellambura. Semiorthogonal space-time block codes |
| 181 | -- | 201 | Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Martin J. Wainwright, Borivoje Nikolic. Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes |
| 202 | -- | 210 | Stefania Fanali, Massimo Giulietti. One-point AG codes on the GK maximal curves |
| 211 | -- | 223 | Paul D. Fiore. Scale-recursive lattice-based multiple-access symbol constellations |
| 224 | -- | 232 | Zhenming Liu, Michael Mitzenmacher. Codes for deletion and insertion channels with segmented errors |
| 233 | -- | 249 | Jin Lu, José M. F. Moura. Linear time encoding of LDPC codes |
| 250 | -- | 265 | Frédérique E. Oggier, Babak Hassibi. Cyclic distributed space-time codes for wireless relay networks with no channel information |
| 266 | -- | 272 | Josep Rifà, Victor A. Zinoviev. New completely regular q-ary codes based on Kronecker products |
| 273 | -- | 295 | Sudharshan Srinivasan, Steven S. Pietrobon. Decoding of high rate convolutional codes using the dual trellis |
| 296 | -- | 315 | Chung-Hsuan Wang, Mao-Ching Chiu, Chi-Chao Chao. On unequal error protection of convolutional codes from an algebraic perspective |
| 316 | -- | 331 | Wei Zhang, Michael Lentmaier, Kamil Sh. Zigangirov, Daniel J. Costello Jr.. Braided convolutional codes: a new class of turbo-like codes |
| 332 | -- | 335 | Kapil Bhattad, Krishna R. Narayanan. A note on the rate of decay of mean-squared error with SNR for the AWGN channel |
| 336 | -- | 349 | Marco Chiani, Moe Z. Win, Hyundong Shin. MIMO networks: the effects of interference |
| 350 | -- | 366 | Anand K. Dhulipala, Christina Fragouli, Alon Orlitsky. Silence-based communication |
| 367 | -- | 395 | Giuseppe Durisi, Ulrich G. Schuster, Helmut Bölcskei, Shlomo Shamai. Noncoherent capacity of underspread fading channels |
| 396 | -- | 410 | Matthew R. McKay, Iain B. Collings, Antonia Maria Tulino. Achievable sum rate of MIMO MMSE receivers: a general analytic framework |
| 411 | -- | 426 | Raghuraman Mudumbai, João Pedro Hespanha, Upamanyu Madhow, Gwen Barriac. Distributed transmit beamforming using feedback control |
| 427 | -- | 437 | Ayfer Özgür, Ramesh Johari, David N. C. Tse, Olivier Lévêque. Information-theoretic operating regimes of large wireless networks |
| 438 | -- | 449 | Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan. The communication complexity of correlation |
| 450 | -- | 454 | Tian Tian, Wen-Feng Qi. 2-adic complexity of binary m-sequences |
| 455 | -- | 461 | Frederik Vercauteren. Optimal pairings |
| 462 | -- | 475 | Aram Wettroth Harrow, Peter W. Shor. Time reversal and exchange symmetries of unitary gate capacities |
| 476 | -- | 491 | Peiyu Tan, Jing Li. Efficient quantum stabilizer codes: LDPC and LDPC-convolutional constructions |
| 492 | -- | 504 | Mehmet Akçakaya, Vahid Tarokh. Shannon-theoretic limits on noisy compressive sampling |
| 505 | -- | 519 | Yonina C. Eldar, Holger Rauhut. Average case analysis of multichannel sparse recovery using convex relaxation |
| 520 | -- | 544 | Joel A. Tropp, Jason N. Laska, Marco F. Duarte, Justin K. Romberg, Richard G. Baraniuk. Beyond Nyquist: efficient sampling of sparse bandlimited signals |
| 545 | -- | 554 | Noga Alon, Simon Litsyn, Alexander Shpunt. Typical peak sidelobe level of binary sequences |
| 555 | -- | 563 | Qun-Xiong Zheng, Wen-Feng Qi. Distribution properties of compressing sequences derived from primitive sequences over Z/(p:::e:::) |
| 564 | -- | 581 | Saurabha Tavildar, Pramod Viswanath, Aaron B. Wagner. The Gaussian many-help-one distributed source coding problem |
| 582 | -- | 596 | Qasim M. Chaudhari, Erchin Serpedin, Jang-Sub Kim. Energy-efficient estimation of clock offset for inactive nodes in wireless sensor networks |
| 614 | -- | 633 | Carlo Bardaro, Paul L. Butzer, Rudolf L. Stens, Gianluca Vinti. Prediction by samples from the past with error estimates covering discontinuous signals |
| 634 | -- | 647 | Kyomin Jung, Devavrat Shah, Jinwoo Shin. Distributed averaging via lifted Markov chains |