| 1477 | -- | 1497 | Laura Cottatellucci, Ralf R. Müller, Mérouane Debbah. Asynchronous CDMA systems with random spreading-part I: fundamental limits |
| 1498 | -- | 1520 | Laura Cottatellucci, Ralf R. Müller, Mérouane Debbah. Asynchronous CDMA systems with random spreading-part II: design criteria |
| 1521 | -- | 1541 | Alberto Perotti, Alberto Tarable, Sergio Benedetto, Guido Montorsi. Capacity-achieving CPM schemes |
| 1542 | -- | 1559 | Erwin Riegler, Giorgio Taricco. Asymptotic statistics of the mutual information for spatially correlated rician fading MIMO channels with interference |
| 1560 | -- | 1573 | Ram Somaraju, Jochen Trumpf. Degrees of freedom of a communication channel: using DOF singular values |
| 1574 | -- | 1581 | Marc Andre Armand. A note on interleaved Reed-Solomon codes over Galois rings |
| 1582 | -- | 1595 | Yuval Cassuto, Moshe Schwartz, Vasken Bohossian, Jehoshua Bruck. Codes for asymmetric limited-magnitude errors with application to multilevel flash memories |
| 1596 | -- | 1599 | Yeow Meng Chee, Chaoping Xing, Sze-Ling Yeo. New constant-weight codes from propagation rules |
| 1600 | -- | 1611 | Shashi Kiran Chilappagari, Dung Viet Nguyen, Bane V. Vasic, Michael W. Marcellin. On trapping sets and guaranteed error correction capability of LDPC codes and GLDPC codes |
| 1612 | -- | 1617 | Masaaki Harada, Michael Kiermaier, Alfred Wassermann, Radinka Yorgova. New binary singly even self-dual codes |
| 1618 | -- | 1623 | Florian Hug, Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov. A rate R = 5/20 hypergraph-based woven convolutional code with free distance 120 |
| 1624 | -- | 1639 | Erez Louidor, Brian H. Marcus. Improved lower bounds on capacities of symmetric 2D constraints using Rayleigh quotients |
| 1640 | -- | 1650 | Andrew McGregor, Olgica Milenkovic. On the hardness of approximating stopping and trapping sets |
| 1651 | -- | 1672 | Enrico Paolini, Marc P. C. Fossorier, Marco Chiani. Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel |
| 1673 | -- | 1679 | Jos H. Weber, Kees A. Schouhamer Immink. Knuth s balanced codes revisited |
| 1680 | -- | 1684 | Shixin Zhu, Yu Wang, Minjia Shi. Some results on cyclic codes over F2 + UpsilonF2 |
| 1685 | -- | 1693 | Jin-Ho Chung, Kyeongcheol Yang. Optimal frequency-hopping sequences with new parameters |
| 1694 | -- | 1701 | Cunsheng Ding, Xiaohu Tang. The cross-correlation of binary sequences with optimal autocorrelation |
| 1702 | -- | 1713 | Honggang Hu, Guang Gong. New sets of zero or low correlation zone sequences via interleaving techniques |
| 1714 | -- | 1718 | Ming Su, Arne Winterhof. Autocorrelation of Legendre-Sidelnikov sequences |
| 1719 | -- | 1728 | Zhe-xian Wan, Kai Zhou. Strict optimal rational approximants of multisequences |
| 1729 | -- | 1736 | Qi Wang. Optimal sets of frequency hopping sequences with large linear spans |
| 1737 | -- | 1750 | Shirin Jalali, Sergio Verdú, Tsachy Weissman. A universal scheme for Wyner-Ziv coding of discrete sources |
| 1769 | -- | 1781 | Jayanth Nayak, Ertem Tuncel, Deniz Gündüz, Elza Erkip. Successive refinement of vector sources under individual distortion criteria |
| 1782 | -- | 1799 | Jayanth Nayak, Ertem Tuncel, Deniz Gündüz. Wyner-Ziv coding over broadcast channels: digital schemes |
| 1800 | -- | 1807 | Artyom Sharov, Ron M. Roth. Two-dimensional constrained coding based on tiling |
| 1808 | -- | 1824 | En-Hui Yang, Da-ke He. Interactive encoding and decoding for one way learning: near lossless recovery with side information at the decoder |
| 1825 | -- | 1827 | Venkat Anantharam. Counterexamples to a proposed stam inequality on finite groups |
| 1828 | -- | 1851 | Ron Dabora, Andrea J. Goldsmith. The capacity region of the degraded finite-state broadcast channel |
| 1852 | -- | 1864 | Amos Lapidoth, Stephan Tinguely. Sending a bivariate Gaussian source over a Gaussian MAC with feedback |
| 1880 | -- | 1889 | Ivana Maric, Roy D. Yates. Bandwidth and power allocation for cooperative strategies in Gaussian relay networks |
| 1890 | -- | 1908 | Parimal Parag, Jean-François Chamberland. Queueing analysis of a butterfly network for comparing network coding to classical routing |
| 1909 | -- | 1929 | Chih-Chun Wang. Pruning network coding traffic by network coding: a new class of max-flow algorithms |
| 1930 | -- | 1947 | S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Gerhard Kramer, Kelli Carlson, Farzad Farnoud. On the multimessage capacity region for undirected ring networks |
| 1948 | -- | 1960 | Sergey Loyka, Victoria Kostina, François Gagnon. Error rates of the maximum-likelihood detector for arbitrary constellations: convex/concave behavior and applications |
| 1982 | -- | 2001 | Richard G. Baraniuk, Volkan Cevher, Marco F. Duarte, Chinmay Hegde. Model-based compressive sensing |
| 2002 | -- | 2016 | David L. Donoho, Jared Tanner. Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by random sampling |
| 2017 | -- | 2033 | Jüri Lember, Alexey A. Koloydenko. A constructive proof of the existence of Viterbi processes |
| 2034 | -- | 2040 | Gérard Biau, Frédéric Cérou, Arnaud Guyader. Rates of convergence of the functional k-nearest neighbor estimate |
| 2041 | -- | 2050 | Ciamac Cyrus Moallemi, Benjamin Van Roy. Convergence of min-sum message-passing for convex optimization |