ISIT 2008: Toronto, ON, Canada

• Radha Krishna Ganti, Martin Haenggi:
  Interference in ad hoc networks with general motion-invariant node distributions. 1-5
  
• Philippe Jacquet, Bernard Mans, Georgios Rodolakis:
  Information propagation speed in Delay Tolerant Networks: Analytic upper bounds. 6-10
  
• Rahul Vaze, Robert W. Heath Jr.:
  Maximizing reliability in multi-hop wireless networks. 11-15
  
• Ning Wen, Randall A. Berry:
  Reliability constrained packet-sizing for linear multi-hop wireless networks. 16-20
  
• Zihuai Lin, Branka Vucetic:
  Power and rate adaptation for wireless network coding with opportunistic scheduling. 21-25
  
• Chih-Chun Wang:
  Pruning network coding traffic by network coding - A new max-flow algorithm. 26-30
  
• Randy Cogill, Brooke Shrader, Anthony Ephremides:
  Stability analysis of random linear coding across multicast sessions. 31-35
  
• Jasper Goseling, Jos H. Weber:
  Multi-rate network coding for minimum-cost multicasting. 36-40
  
• Yasutada Oohama:
  Rate distortion region for distributed source coding of correlated Gaussian remote sources. 41-45
  
• Oliver Kosut, Lang Tong:
  The Byzantine CEO Problem. 46-50
  
• Nan Ma, Prakash Ishwar:
  Two-terminal distributed source coding with alternating messages for function computation. 51-55
  
• Dinesh Krithivasan, S. Sandeep Pradhan:
  An achievable rate region for distributed source coding with reconstruction of an arbitrary function of the sources. 56-60
  
• Pierre Moulin:
  A Neyman-Pearson approach to universal erasure and list decoding. 61-65
  
• Ron M. Roth, Pascal O. Vontobel:
  List decoding of burst errors. 66-70
  
• Marat V. Burnashev, Ilya Dumer:
  Error exponents for two soft decision decoding algorithms of Reed-Muller codes. 71-75
  
• Yingquan Wu, Marc P. C. Fossorier:
  Soft-decision decoding using time and memory diversification. 76-80
  
• Graeme Smith:
  Private classical capacity with symmetric assistance. 81-85
  
• Igor Bjelakovic, Holger Boche:
  Classical capacity of averaged quantum channels. 86-90
  
• Saikat Guha, Jeffrey H. Shapiro, Baris I. Erkmen:
  Capacity of the bosonic wiretap channel and the Entropy Photon-Number Inequality. 91-95
  
• Frank Nielsen, Richard Nock:
  Quantum Voronoi diagrams and Holevo channel capacity for 1-qubit quantum states. 96-100
  
• Ehsan Ardestanizadeh, Massimo Franceschetti, Tara Javidi, Young-Han Kim:
  Wiretap channel with rate-limited feedback. 101-105
  
• André Zúquete, João Barros:
  Physical-layer encryption with stream ciphers. 106-110
  
• Deniz Gündüz, Elza Erkip, H. Vincent Poor:
  Lossless compression with security constraints. 111-115
  
• Tie Liu, Vinod M. Prabhakaran, Sriram Vishwanath:
  The secrecy capacity of a class of parallel Gaussian compound wiretap channels. 116-120
  
• Zouheir Rezki, David Haccoun, François Gagnon:
  Capacity of the discrete-time non-coherent memoryless Gaussian channels at low SNR. 121-125
  
• Meik Dörpinghaus, Gerd Ascheid, Heinrich Meyr, Rudolf Mathar:
  Optimal PSK signaling over stationary Rayleigh fading channels. 126-130
  
• Caijun Zhong, Kai-Kit Wong, Shi Jin:
  On the ergodic capacity of MIMO Nakagami-fading channels. 131-135
  
• Oliver M. Collins, Krishnan Padmanabhan, Sundeep Venkatraman:
  Information rates for multiantenna systems with unknown fading. 136-140
  
• Marwan H. Azmi, Jinhong Yuan, Jun Ning, Hieu Q. Huynh:
  Improved bilayer LDPC codes using irregular check node degree distribution. 141-145
  
• Valentin Savin:
  Self-corrected Min-Sum decoding of LDPC codes. 146-150
  
• Yuan-Hua Liu, Xinmei Wang, Yucheng He:
  A feedback belief propagation algorithm for LDPC convolutional codes. 151-155
  
• Alexander Barg, Gilles Zémor:
  Codes on hypergraphs. 156-160
  
• Andrew Mills, Brian Smith, T. Charles Clancy, Emina Soljanin, Sriram Vishwanath:
  On secure communication over wireless erasure networks. 161-165
  
• Raymond W. Yeung, Ning Cai:
  On the optimality of a construction of secure network codes. 166-170
  
• Leah Nutman, Michael Langberg:
  Adversarial models and resilient schemes for network coding. 171-175
  
• Danilo Silva, Frank R. Kschischang:
  Security for wiretap networks via rank-metric codes. 176-180
  
• Urs Niesen, Piyush Gupta, Devavrat Shah:
  Hierarchical cooperation for arbitrary wireless networks. 181-185
  
• Ayfer Özgür, Ramesh Johari, David Tse, Olivier Lévêque:
  Information theoretic operating regimes of large wireless networks. 186-190
  
• Vladimir Mordachev, Sergey Loyka:
  On node density - outage probability tradeoff in wireless networks. 191-195
  
• Lihua Wan, Jie Luo, Anthony Ephremides:
  An iterative framework for optimizing multicast throughput in wireless networks. 196-200
  
• Ahmet B. Keha, Tolga M. Duman:
  A branch and cut algorithm for finding the minimum distance of a linear block code. 201-205
  
• Fredrik Rusek, Edward K. S. Au, John B. Anderson, Wai Ho Mow:
  A minimum distance analysis of a certain class of two dimensional ISI channels. 206-210
  
• Te-Tsung Lin, Shi-Chun Tsai, Wen-Guey Tzeng:
  Efficient encoding and decoding with permutation arrays. 211-214
  
• Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
  Separating erasures from errors for decoding. 215-219
  
• Pierre Moulin:
  Universal fingerprinting: Capacity and random-coding exponents. 220-224
  
• Yangfan Zhong, Yadong Wang, Fady Alajaji, Tamás Linder:
  On the public information embedding capacity region under multiple access attacks. 225-229
  
• Raylin Tso, Xun Yi, Takeshi Okamoto, Eiji Okamoto:
  Efficient convertible Limited Verifier Signatures. 230-234
  
• Aldar C.-F. Chan, Claude Castelluccia:
  On the (Im)possibility of aggregate message authentication codes. 235-239
  
• Daniela Tuninetti, Yang Weng:
  On the Han-Kobayashi achievable region for Gaussian interference channels. 240-244
  
• Xiaohu Shang, Gerhard Kramer, Biao Chen:
  New outer bounds on the capacity region of Gaussian interference channels. 245-249
  
• Abolfazl S. Motahari, Amir K. Khandani:
  Capacity bounds for the Gaussian Interference Channel. 250-254
  
• V. Sreekanth Annapureddy, Venugopal V. Veeravalli:
  Gaussian interference networks: Sum capacity in the low interference regime. 255-259
  
• Amine Mezghani, Josef A. Nossek:
  Analysis of Rayleigh-fading channels with 1-bit quantized output. 260-264
  
• Khoa D. Nguyen, Albert Guillen i Fabregas, Lars K. Rasmussen:
  Power control for block-fading channels with peak-to-average power constraints. 265-269
  
• Manish Agarwal, Dongning Guo, Michael L. Honig:
  Channel State and Receiver State feedback for frequency-selective block fading channels. 270-274
  
• Khoa D. Nguyen, Albert Guillen i Fabregas, Lars K. Rasmussen:
  Asymptotic outage performance of power allocation in block-fading channels. 275-279
  
• Junsheng Han, Paul H. Siegel:
  On ML redundancy of codes. 280-284
  
• Satish Babu Korada, Rüdiger L. Urbanke:
  Exchange of limits: Why iterative decoding works. 285-289
  
• Nandakishore Santhi:
  Sparse representations for codes and the hardness of decoding LDPC codes. 290-294
  
• Masanori Hirotomo, Yoshiho Konishi, Masakatu Morii:
  On the probabilistic computation algorithm for the minimum-size stopping sets of LDPC codes. 295-299
  
• Markus Grassl, Martin Rötteler:
  Quantum Goethals-Preparata codes. 300-304
  
• Pradeep Kiran Sarvepalli, Andreas Klappenecker, Martin Rötteler:
  Asymmetric quantum LDPC codes. 305-309
  
• David Poulin, Jean-Pierre Tillich, Harold Ollivier:
  Quantum serial turbo-codes. 310-314
  
• Michael Langberg, Alex Sprintson:
  On the hardness of approximating the network coding capacity. 315-319
  
• Terence Chan, Alex J. Grant:
  Mission impossible: Computing the network coding capacity region. 320-324
  
• S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Gerhard Kramer:
  Network coding in star networks. 325-329
  
• Sudipta Sengupta, Minghua Chen, Philip A. Chou, Jin Li:
  On optimality of routing for multi-source multicast communication scenarios with node uplink constraints. 330-334
  
• Edwin Soedarmadji, Robert J. McEliece:
  Finding the best path in a binary Block Interference network. 335-338
  
• Brian Smith, Babak Hassibi:
  Wireless erasure networks with feedback. 339-343
  
• Hon-Fah Chong, Mehul Motani:
  The capacity regions of some classes of deterministic relay channels. 344-348
  
• Kamyar Moshksar, Alireza Bayesteh, Amir K. Khandani:
  Coexistence and spectral efficiency in decentralized networks. 349-353
  
• Lóránt Farkas:
  Detecting the normal quantum/Compound Quantum channel with von Neumann measurement. 354-358
  
• Mark M. Wilde, Todd A. Brun:
  Unified quantum convolutional coding. 359-363
  
• Andrew W. Cross, Graeme Smith, John A. Smolin, Bei Zeng:
  Codeword stabilized quantum codes. 364-368
  
• Salah A. Aly, Andreas Klappenecker:
  Subsystem code constructions. 369-373
  
• Roy D. Yates, David Tse, Zang Li:
  Secret communication on interference channels. 374-378
  
• Zang Li, Roy D. Yates, Wade Trappe:
  Secrecy capacity region of a class of one-sided interference channel. 379-383
  
• Onur Ozan Koyluoglu, Hesham El Gamal, Lifeng Lai, H. Vincent Poor:
  On the secure degrees of freedom in the K-user Gaussian interference channel. 384-388
  
• Xiaojun Tang, Ruoheng Liu, Predrag Spasojevic, H. Vincent Poor:
  The Gaussian wiretap channel with a helping interferer. 389-393
  
• Haim H. Permuter, Tsachy Weissman, Jun Chen:
  New bounds for the capacity region of the Finite-State Multiple Access Channel. 394-398
  
• Vaneet Aggarwal, Ashutosh Sabharwal:
  On multiple access channels with asymmetric feedback. 399-403
  
• Vaneet Aggarwal, Ashutosh Sabharwal:
  Diversity order gain with noisy feedback in multiple access channels. 404-408
  
• Ravi Narasimhan:
  Delay-limited throughput of cooperative multiple access channels with hybrid-ARQ. 409-413
  
• Benjamin G. Kelly, Aaron B. Wagner, Aggelos Vamvatsikos:
  Error exponents and test channel optimization for the Gaussian Wyner-Ziv problem. 414-418
  
• En-Hui Yang, Da-ke He:
  On interactive encoding and decoding for lossless source coding with decoder only side information. 419-423
  
• Jun Muramatsu, Shigeki Miyake:
  Hash property and Wyner-Ziv source coding by using sparse matrices and maximum-likelihood coding. 424-428
  
• Jun Chen, Aaron B. Wagner:
  A semicontinuity theorem and its application to network source coding. 429-433
  
• Shashi Kiran Chilappagari, Dung Viet Nguyen, Bane V. Vasic, Michael W. Marcellin:
  On the guaranteed error correction capability of LDPC codes. 434-438
  
• Hua Xiao, Amir H. Banihashemi:
  Error rate estimation of finite-length low-density parity-check codes decoded by soft-decision iterative algorithms. 439-443
  
• Pamela Lee, Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Borivoje Nikolic, Martin J. Wainwright:
  Error floors in LDPC codes: Fast simulation, bounds and hardware emulation. 444-448
  
• Ryuhei Mori, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa:
  Asymptotic bit error probability of LDPC codes for the binary erasure channel with finite number of iterations. 449-453
  
• Lars P. B. Christensen:
  A generalized turbo principle for approximate detection and decoding. 454-458
  
• Hao Chen, Pramod K. Varshney:
  Nonparametric one-bit quantizers for distributed estimation. 459-463
  
• Adnan Prlja, John B. Anderson, Fredrik Rusek:
  Receivers for Faster-than-Nyquist signaling with and without turbo equalization. 464-468
  
• Junyoung Nam, Seong Rag Kim, Jeongseok Ha:
  A modified turbo principle for iterative detection and decoding. 469-473
  
• Amir Salman Avestimehr, Suhas N. Diggavi, David Tse:
  Approximate capacity of Gaussian relay networks. 474-478
  
• Ninoslav Marina, Aleksandar Kavcic, N. Thomas Gaarder:
  Capacity theorems for relay channels with ISI. 479-483
  
• Toshifumi Sakai, Tomohiko Uyematsu:
  Universal coding theorem for relay channels. 484-488
  
• Jonathan Ponniah, Liang-Liang Xie:
  An achievable rate region for the two-way two-relay channel. 489-493
  
• Suchitra Shrestha, KyungHi Chang:
  Analysis of outage capacity performance for cooperative DF and AF relaying in dissimilar Rayleigh fading channels. 494-498
  
• Neri Merhav:
  An identity of Chernoff bounds with an interpretation in statistical physics and applications in information theory. 499-503
  
• Neri Merhav:
  Relations between random coding exponents and the statistical physics of random codes. 504-508
  
• Florent Cousseau, Kazushi Mimura, Masato Okada:
  Statistical mechanics of lossy compression for non-monotonic multilayer perceptrons. 509-513
  
• Keigo Takeuchi, Mikko Vehkaperä, Toshiyuki Tanaka, Ralf R. Müller:
  Replica analysis of general multiuser detection in MIMO DS-CDMA channels with imperfect CSI. 514-518
  
• Kazutaka Nakamura, Toshiyuki Tanaka:
  Microscopic analysis for decoupling principle of linear vector channel. 519-523
  
• Frédérique E. Oggier, Babak Hassibi:
  The secrecy capacity of the MIMO wiretap channel. 524-528
  
• Kumar Ramani Gowtham, Andrew Thangaraj:
  Computation of secrecy capacity for more-capable channel pairs. 529-533
  
• Parvathinathan Venkitasubramaniam, Parvathinathan Anantharam:
  On the anonymity of Chaum mixes. 534-538
  
• Martin Haenggi:
  The secrecy graph and some of its properties. 539-543
  
• Osman Yagan, Armand M. Makowski:
  On the random graph induced by a random key predistribution scheme under full visibility. 544-548
  
• Sriram Sridharan, Sriram Vishwanath, Syed Ali Jafar, Shlomo Shamai:
  On the capacity of cognitive relay assisted Gaussian interference channel. 549-553
  
• Ivana Maric, Ron Dabora, Andrea Goldsmith:
  On the capacity of the interference channel with a relay. 554-558
  
• Minqi Shen, Anders Høst-Madsen, Josep Vidal:
  An improved interference alignment scheme for frequency selective channels. 559-563
  
• Nan Liu, Andrea Goldsmith:
  Superposition encoding and partial decoding is optimal for a class of Z-interference channels. 564-568
  
• Adnan Raja, Vinod M. Prabhakaran, Pramod Viswanath:
  The two user Gaussian compound interference channel. 569-573
  
• Tingting Liu, Jian-Kang Zhang, Kon Max Wong:
  Optimal precoder design for correlated MIMO systems using decision feedback receivers. 574-578
  
• Chih-Cheng Kuo, Wern-Ho Sheen, Chang Lung Hsiao:
  MMSE channel factorization for near maximum-likelihood detection of MIMO signals. 579-583
  
• Rafael F. Wyrembelski, Tobias J. Oechtering, Igor Bjelakovic, Clemens Schnurr, Holger Boche:
  Capacity of Gaussian MIMO bidirectional broadcast channels. 584-588
  
• Daniele Angelosante, Ezio Biglieri, Marco Lops:
  Sequential estimation of time-varying multipath channel for MIMO-OFDM systems. 589-593
  
• Antonio De Maio, Marco Lops, Luca Venturino:
  Diversity-integration trade-offs in MIMO detection. 594-598
  
• Mustafa Cenk Gursoy:
  On the energy efficiency of orthogonal signaling. 599-603
  
• Juyul Lee, Nihar Jindal:
  Energy-efficient scheduling of delay constrained traffic over fading channels. 604-608
  
• Gajanana Krishna, Srikrishna Bhashyam, Ashutosh Sabharwal:
  Decentralized power control with two-way training for multiple access. 609-613
  
• Jian Cao, Edmund M. Yeh:
  Power-delay tradeoff analysis for communication over fading channels with feedback. 614-618
  
• Kaushik Chakraborty, Massimo Franceschetti, Subhrakanti Dey:
  Service outage based power and rate control for Poisson fading channels. 619-623
  
• Dan C. Popescu:
  The algebraic degree of 1-perfect binary codes and a relation with the code characters. 624-628
  
• Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto:
  Improved bounds on binary identifying codes. 629-633
  
• Mathieu Cluzeau, Jean-Pierre Tillich:
  On the code reverse engineering problem. 634-638
  
• Jens Zumbrägel, Gérard Maze, Joachim Rosenthal:
  Efficient recovering of operation tables of black box groups and rings. 639-643
  
• Wen-Ku Su, Chong-Dao Lee, Tsung-Ching Lin, Trieu-Kien Truong, Yaotsu Chang:
  On determination of the weight distribution of binary (168, 84, 24) extended quadratic residue code. 644-646
  
• Sudeep Kamath, D. Manjunath:
  On distributed function computation in structure-free random networks. 647-651
  
• Ola Ayaso, Devavrat Shah, Munther A. Dahleh:
  Counting bits for distributed function computation. 652-656
  
• Effrosini Kokiopoulou, Pascal Frossard, Dimitra Gkorou:
  Optimal polynomial filtering for accelerating distributed consensus. 657-661
  
• Animashree Anandkumar, Lang Tong, Ananthram Swami, Anthony Ephremides:
  Cost-performance tradeoff in multi-hop aggregation for statistical inference. 662-666
  
• Hazer Inaltekin, Mung Chiang, H. Vincent Poor:
  Expected message delivery time for small-world networks in the continuum limit. 667-671
  
• Parimal Parag, Jean-François Chamberland:
  Queueing analysis of a butterfly network. 672-676
  
• Zheng Wang, Hamid R. Sadjadpour, Jose Joaquin Garcia-Luna-Aceves:
  Capacity-delay tradeoff for information dissemination modalities in wireless networks. 677-681
  
• John MacLaren Walsh, Steven Weber, Ciira Wa Maina:
  Optimal rate delay tradeoffs for multipath routed and network coded networks. 682-686
  
• Yasutada Oohama:
  Multiterminal source coding problem with several side informations at the decoder. 687-691
  
• Ramji Venkataramanan, S. Sandeep Pradhan:
  Multiple descriptions with feed-forward: A single-letter achievable rate region. 692-696
  
• Soumya Jana, Richard E. Blahut:
  Canonical description for multiterminal source coding. 697-701
  
• Sirin Nitinawarat:
  Secret key generation for correlated Gaussian sources. 702-706
  
• Lei Zhao, Haim H. Permuter:
  Zero-error capacity for finite state channels with feedback and channel state information. 707-711
  
• Baris Nakiboglu, Lizhong Zheng:
  Errors-and-erasures decoding for block codes with feedback. 712-716
  
• Anant Sahai, Stark C. Draper:
  The "hallucination" bound for the BSC. 717-721
  
• Sekhar Tatikonda:
  The structure of encoders for channels with feedback. 722-726
  
• Masashi Naito, Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
  Secret key agreement by reliability information of signals in Gaussian Maurer's Model. 727-731
  
• Shimpei Yasukawa, Hisato Iwai, Hideichi Sasaoka:
  A secret key agreement scheme with multi-level quantization and parity check using fluctuation of radio channel property. 732-736
  
• Motohiko Isaka, Yuki Shimizu:
  Cryptographic primitives based on discrete-input AWGN channels. 737-741
  
• Amin Aminzadeh Gohari, Venkat Anantharam:
  New bounds on the information-theoretic key agreement of multiple terminals. 742-746
  
• Alireza Bayesteh, Kamyar Moshksar, Amir K. Khandani:
  On the capacity of MIMO Rician broadcast channels. 747-751
  
• Alireza Bayesteh, Mehdi Ansari Sadrabadi, Amir K. Khandani:
  Is it possible to achieve the optimum throughput and fairness simultaneously in a MIMO Broadcast Channel? 752-756
  
• Stephanie Pereira, Aydin Sezgin, Arogyaswami Paulraj, George Papanicolaou:
  Interference limited broadcast: Role of interferer geometry. 757-761
  
• Viveck R. Cadambe, Syed Ali Jafar:
  Duality and stability regions of multi-rate broadcast and multiple access networks. 762-766
  
• Yuval Kochman, Anatoly Khina, Uri Erez, Ram Zamir:
  Rematch and forward for parallel relay networks. 767-771
  
• Bobak Nazer, Michael Gastpar:
  Compute-and-forward: Harnessing interference with structured codes. 772-776
  
• Kenneth W. Shum, Chi Wan Sung:
  Transmitter cooperation by recycling dirty paper. 777-781
  
• Nir Weinberger, Meir Feder:
  Universal decoding for linear Gaussian fading channels in the competitive minimax sense. 782-786
  
• Joseph Jean Boutros, Gilles Zémor, Albert Guillen i Fabregas, Ezio Biglieri:
  Generalized low-density codes with BCH constituents for full-diversity near-outage performance. 787-791
  
• Christine A. Kelley, Judy L. Walker:
  LDPC codes from voltage graphs. 792-796
  
• Hamid Saeedi, Amir H. Banihashemi:
  New sequences of capacity achieving LDPC code ensembles over the binary erasure channel. 797-801
  
• Ali Sanaei, Mahdi Ramezani, Masoud Ardakani:
  On the design of universal LDPC codes. 802-806
  
• Hossein Bahramgiri, Farshad Lahouti:
  Block network error control codes and syndrome-based maximum likelihood decoding. 807-811
  
• Shenghao Yang, Raymond W. Yeung, Zhen Zhang:
  Characterization of error correction and detection in a general transmission system. 812-816
  
• Mahdi Jafari Siavoshani, Christina Fragouli, Suhas N. Diggavi:
  Noncoherent multisource network coding. 817-821
  
• Jingyu Kang, Bo Zhou, Zhi Ding, Shu Lin:
  LDPC coding schemes for error control in a multicast network. 822-826
  
• Sudharsan Ganesan, Zhiguo Ding, Tharmalingam Ratnarajah, Mathini Sellathurai:
  Distributed STBC for single carrier relay-assisted transmissions over frequency-selective channels. 827-831
  
• Hsiao-feng Lu:
  Constructions of fully-diverse high-rate space-frequency codes for asynchronous cooperative relay networks. 832-836
  
• A. Roger Hammons Jr., Mohamed Oussama Damen:
  Delay-tolerant STBC for both amplify-and-forward and decode-and-forward cooperative networks. 837-841
  
• Ioannis Krikidis, John S. Thompson, Steve McLaughlin, Norbert Goertz:
  Non-orthogonal Amplify-and-Forward for block-fading channels. 842-846
  
• Ankit Gupta, Sergio Verdú, Tsachy Weissman:
  Rate-distortion in near-linear time. 847-851
  
• Shirin Jalali, Tsachy Weissman:
  Rate-distortion via Markov chain Monte Carlo. 852-856
  
• Hari Palaiyanur, Anant Sahai:
  On the uniform continuity of the rate-distortion function. 857-861
  
• Jacob Binia:
  Rate distortion function with a proportional mean-square error distortion measure. 862-866
  
• Ernst M. Gabidulin, Martin Bossert:
  Codes for network coding. 867-870
  
• Tuvi Etzion, Alexander Vardy:
  Error-correcting codes in projective space. 871-875
  
• Maximilien Gadouleau, Zhiyuan Yan:
  Constant-rank codes. 876-880
  
• Felice Manganiello, Elisa Gorla, Joachim Rosenthal:
  Spread codes and spread decoding in network coding. 881-885
  
• Marat V. Burnashev, Hirosuke Yamamoto:
  On BSC, noisy feedback and three messages. 886-889
  
• Mark Johnson, Michael Mitzenmacher, Kannan Ramchandran:
  Distributed beamforming with binary signaling. 890-894
  
• Shunsuke Ihara:
  Probability of error in information transmission over continuous-time white Gaussian channel with feedback. 895-899
  
• Ofer Shayevitz, Meir Feder:
  The posterior matching feedback scheme: Capacity achieving and error analysis. 900-904
  
• Ekine Akuiyibo, Olivier Lévêque, Christophe Vignat:
  High SNR analysis of the MIMO interference channel. 905-909
  
• Osvaldo Simeone, Oren Somekh, H. Vincent Poor, Shlomo Shamai:
  Distributed MIMO systems with oblivious antennas. 910-914
  
• Pedro Coronel, Markus Gärtner, Helmut Bölcskei:
  Diversity-multiplexing tradeoff in selective-fading multiple-access MIMO channels. 915-919
  
• Xiao Li, Shi Jin, Xiqi Gao, Matthew R. McKay:
  Transmitter optimization and power allocation in double-scattering MIMO multiple access channels. 920-924
  
• Anand D. Sarwate, Michael Gastpar:
  Arbitrarily dirty paper coding and applications. 925-929
  
• Wenyi Zhang, Satish Vedantam, Urbashi Mitra:
  A constrained channel coding approach to joint communication and channel estimation. 930-934
  
• Yossef Steinberg:
  Simultaneous transmission of data and state with common knowledge. 935-939
  
• Mariam E. Haroutunian, Smbat Tonoyan, Oleksiy J. Koval, Sviatoslav Voloshynovskiy:
  On reversible information hiding system. 940-944
  
• Vishwambhar Rathi:
  Conditional entropy of non-binary LDPC codes over the BEC. 945-949
  
• Daniele Capirone, Giacomo Como, Fabio Fagnani, Federica Garin:
  Non-binary decoding of structured LDPC codes: Density evolution. 950-954
  
• Adrian Voicila, David Declercq, François Verdier, Marc P. C. Fossorier, Pascal Urard:
  Split non-binary LDPC codes. 955-959
  
• Valentin Savin:
  Min-Max decoding for non binary LDPC codes. 960-964
  
• Lara Dolecek, Venkat Anantharam:
  Prefixing method for correcting repetition errors. 965-969
  
• Sam Dolinar, Kenneth Andrews, Fabrizio Pollara, Dariush Divsalar:
  The limits of coding with joint constraints on detected and undetected error rates. 970-974
  
• Kenji Yasunaga, Toru Fujiwara:
  Uncorrectable errors of weight half the minimum distance for binary linear codes. 975-979
  
• Luca G. Tallini, Bella Bose:
  On a new class of error control codes and symmetric functions. 980-984
  
• Danny Dubé, Vincent Beaudoin:
  Improving LZ77 bit recycling using all matches. 985-989
  
• Tsutomu Kawabata:
  Enumerative implementation of Lempel-Ziv 77 algorithm. 990-994
  
• Gil I. Shamir, Tjalling J. Tjalkens, Frans M. J. Willems:
  Low-complexity sequential probability estimation and universal compression for binary sequences with constrained distributions. 995-999
  
• Giovanni Motta, Erik Ordentlich, Marcelo J. Weinberger:
  Defect list compression. 1000-1004
  
• Ashish Khisti, Suhas N. Diggavi, Gregory W. Wornell:
  Secret-key generation with correlated sources and noisy channels. 1005-1009
  
• Vinod M. Prabhakaran, Krishnan Eswaran, Kannan Ramchandran:
  Secrecy via sources and channels - A secret key - Secret message rate tradeoff region. 1010-1014
  
• Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
  Secret key generation for a pairwise independent network model. 1015-1019
  
• Anthony Leverrier, Romain Alleaume, Joseph Boutros, Gilles Zémor, Philippe Grangier:
  Multidimensional reconciliation for continuous-variable quantum key distribution. 1020-1024
  
• Irina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson, Victor V. Zyablov:
  Asymptotic performances of woven graph codes. 1025-1029
  
• David G. M. Mitchell, Ali Emre Pusane, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
  Asymptotically good LDPC convolutional codes based on protographs. 1030-1034
  
• Marcos B. S. Tavares, Michael Lentmaier, Kamil Sh. Zigangirov, Gerhard Fettweis:
  LDPC convolutional codes based on braided convolutional codes. 1035-1039
  
• Chi-Jen Wu, Yi-Chun Chou, Chung-Hsuan Wang, Chi-Chao Chao:
  New construction of LDPC convolutional codes. 1040-1044
  
• Tadashi Wadayama:
  On undetected error probability of binary matrix ensembles. 1045-1049
  
• Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen:
  Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures. 1050-1052
  
• Shervan Fashandi, Shahab Oveis Gharan, Amir K. Khandani:
  Coding over an erasure channel with a large alphabet size. 1053-1057
  
• Ali Al-Shaikhi, Jacek Ilow:
  Packet loss recovery codes based on Vandermonde matrices and shift operators. 1058-1062
  
• Uri Perlmutter, Uri Erez:
  Multi-layer SISO coding for MIMO channels. 1063-1067
  
• Jimmy Chui, A. Robert Calderbank:
  Multilevel diversity-embedded space-time codes for video broadcasting over WiMAX. 1068-1072
  
• Jean Creignou, Hervé Diet:
  Linear programming bounds for unitary space time codes. 1073-1077
  
• Yiyue Wu, A. Robert Calderbank:
  Code diversity in multiple antenna wireless communication. 1078-1082
  
• Dongning Guo, Shlomo Shamai, Sergio Verdú:
  Estimation of non-Gaussian random variables in Gaussian noise: Properties of the MMSE. 1083-1087
  
• Miquel Payaró, Daniel P. Palomar:
  A multivariate generalization of Costa's entropy power inequality. 1088-1092
  
• Fredrik Rusek, Dzevdan Kapetanovic, John B. Anderson:
  The effect of symbol rate on constrained capacity for linear modulation. 1093-1097
  
• Emmanuel Abbe, Lizhong Zheng:
  Linear universal decoding for compound channels: an Euclidean Geometric Approach. 1098-1102
  
• Santosh Srivastava, Maya R. Gupta:
  Bayesian estimation of the entropy of the multivariate Gaussian. 1103-1107
  
• Tony Jacob, Rakesh K. Bansal:
  Sequential change detection based on universal compression algorithms. 1108-1112
  
• Hans-Andrea Loeliger, Mehdi Molkaraie:
  Simulation-based estimation of the partition function and the information rate of two-dimensional models. 1113-1117
  
• Won-Yong Shin, Sang-Woon Jeon, Natasha Devroye, Mai H. Vu, Sae-Young Chung, Yong Hoon Lee, Vahid Tarokh:
  Improved throughput scaling in wireless ad hoc networks with infrastructure. 1118-1122
  
• Massimo Franceschetti, Marco Donald Migliore, Paolo Minero:
  Outer bound to the capacity scaling of three dimensional wireless networks. 1123-1127
  
• Si-Hyeon Lee, Sae-Young Chung:
  Effect of channel correlation on the capacity scaling in wireless networks. 1128-1132
  
• Ohad Barak, Uri Erez, David Burshtein:
  Bounds on rates of LDPC codes for BEC with varying erasure rate. 1133-1137
  
• Tsuyoshi Nakasendo, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa:
  Two-edge type LDPC code ensembles with exponentially few codewords with linear small weight. 1138-1142
  
• Gokul Sridharan, Abishek Kumarasubramanian, Andrew Thangaraj, Srikrishna Bhashyam:
  Optimizing burst erasure correction of LDPC codes by interleaving. 1143-1147
  
• Noam Presman, Eran Sharon, Simon Litsyn:
  Efficient layers-based schedules for iterative decoding of LDPC codes. 1148-1152
  
• Ragnar Thobaben, Laurent Schmalen, Peter Vary:
  Joint source-channel coding with inner irregular codes. 1153-1157
  
• Bo Zhou, Li Zhang, Jingyu Kang, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
  Array dispersions of matrices and constructions of quasi-cyclic LDPC codes over non-binary fields. 1158-1162
  
• Joseph Jean Boutros, Emanuele Viterbo, Gerard Cohen:
  Convolutional Tanner structures for non-ergodic wireless channels. 1163-1167
  
• Yige Wang, Chung-Li Wang, Marc P. C. Fossorier:
  Ensemble weight enumerators for protograph-based doubly generalized LDPC codes. 1168-1172
  
• Erdal Arikan:
  Channel polarization: A method for constructing capacity-achieving codes. 1173-1177
  
• Pulkit Grover, Anant Sahai:
  Green codes: Energy-efficient short-range communication. 1178-1182
  
• Amir Ingber, Itai Leibowitz, Ram Zamir, Meir Feder:
  Distortion lower bounds for finite dimensional joint source-channel coding. 1183-1187
  
• Jiantao Zhou, Oscar C. Au, Xiaopeng Fan, Peter Hon-Wah Wong:
  Error recovery of variable length codes over BSC with arbitrary crossover probability. 1188-1192
  
• Shigeki Miyake, Jun Muramatsu:
  A construction of channel code, joint source-channel code, and universal code for arbitrary stationary memoryless channels using sparse matrices. 1193-1197
  
• Shraga I. Bross, Amos Lapidoth, Stephan Tinguely:
  Broadcasting correlated Gaussians. 1198-1202
  
• Jagadeesh Harshan, B. Sundar Rajan:
  Finite signal-set capacity of two-user Gaussian Multiple Access Channel. 1203-1207
  
• Jochen Sommerfeld, Igor Bjelakovic, Holger Boche:
  On the boundedness of the support of optimal input measures for Rayleigh fading channels. 1208-1212
  
• Aslan Tchamkerten, Venkat Chandar, Gregory W. Wornell:
  On the capacity region of asynchronous channels. 1213-1217
  
• Jaspreet Singh, Onkar Dabeer, Upamanyu Madhow:
  Capacity of the discrete-time AWGN channel under output quantization. 1218-1222
  
• Jun Chen, Haim H. Permuter, Tsachy Weissman:
  On the capacity of finite-state channels. 1223-1227
  
• Jun Hu, Tolga M. Duman, M. Fatih Erden:
  Information rates for insertion/deletion channels with intersymbol interference. 1228-1232
  
• Feifei Gao, Tao Cui, Arumugam Nallanathan:
  Maximum likelihood channel estimation in decode-and-forward relay networks. 1233-1237
  
• Yiannis Socratous, Charalambos D. Charalambous, Costas N. Georghiades:
  Robust estimation with applications to phase and envelope estimation in frequency selective wireless fading channels. 1238-1242
  
• Gilad Bukai, Neri Merhav:
  Channel estimation using feedback. 1243-1247
  
• Hidetoshi Saito, Masayuki Hayashi, Ryuji Kohno:
  Cointegrated vector autoregressive models for multitrack systems in digital magnetic recording. 1248-1252
  
• K. Sreeram, S. Birenjith, P. Vijay Kumar:
  Diversity and degrees of freedom of cooperative wireless networks. 1253-1257
  
• Michele A. Wigger, Michael Gastpar:
  The pre-log of Gaussian broadcast with feedback can be two. 1258-1262
  
• Viveck R. Cadambe, Syed Ali Jafar:
  Can feedback, cooperation, relays and full duplex operation increase the degrees of freedom of wireless networks? 1263-1267
  
• Viveck R. Cadambe, Syed Ali Jafar:
  Degrees of freedom of wireless X networks. 1268-1272
  
• Sanket Dusad, Suhas N. Diggavi:
  Successive refinement of diversity for fading ISI MISO channels. 1273-1277
  
• Xiaoyong Guo, Xiang-Gen Xia:
  On full diversity linear dispersion codes with partial interference cancellation group decoding. 1278-1282
  
• Manav R. Bhatnagar, Are Hjørungnes, Ranjan Bose:
  Precoded DDOSTBC with non-unitary constellations over correlated Rayleigh channels with carrier offsets. 1283-1287
  
• Frans M. J. Willems:
  Rotated and scaled alamouti coding. 1288-1292
  
• Giuseppe Caire, Tareq Y. Al-Naffouri, Anand K. Narayanan:
  Impulse noise cancellation in OFDM: an application of compressed sensing. 1293-1297
  
• Paschalis Tsiaflakis, Chee Wei Tan, Yung Yi, Mung Chiang, Marc Moonen:
  Optimality certificate of dynamic spectrum management in multi-carrier interference channels. 1298-1302
  
• Robert F. H. Fischer, Christian Siegl:
  OFDM peak-to-average power ratio reduction based on the simplex code. 1303-1307
  
• Clemens Stierstorfer, Robert F. H. Fischer:
  Rate loading in OFDM based on bit-level capacities. 1308-1312
  
• Jesús Gómez-Vilardebó, Ana I. Pérez-Neira:
  Duplexing and synchronism for energy efficient communication over a relay channel. 1313-1317
  
• Shashank V. Maiya, Thomas E. Fuja:
  Routing and spectral efficiency in a wireless network with two parallel relays. 1318-1322
  
• Shengshan Cui, Alexander M. Haimovich, Oren Somekh, H. Vincent Poor:
  Decentralized two-hop opportunistic relaying with limited channel state information. 1323-1327
  
• Leila Ghabeli, Mohammad Reza Aref:
  A new achievable rate for relay networks based on parallel relaying. 1328-1332
  
• Narayan Prasad, Xiaodong Wang:
  Outage minimization and fair rate allocation for the multiple access relay channel. 1333-1337
  
• Wenyi Zhang, Urbashi Mitra:
  A spectrum-shaping perspective on cognitive radio: Uncoded primary transmission case. 1338-1342
  
• Sriram N. Kizhakkemadam, Dinesh Rajan:
  Random message arrivals in a gaussian cognitive radio. 1343-1347
  
• Chiachi Huang, Syed Ali Jafar:
  Degrees of freedom of the MIMO interference channel with cooperation and cognition. 1348-1352
  
• Anelia Somekh-Baruch, Shlomo Shamai, Sergio Verdú:
  Cognitive interference channels with state information. 1353-1357
  
• Hossein Charmchi, Masoumeh Nasiri-Kenari:
  Achievable rates for two interfering broadcast channels with a cognitive transmitter. 1358-1362
  
• Yutaka Jitsumatsu, Tohru Kohda:
  Prolate spheroidal wave functions induce Gaussian chip waveforms. 1363-1367
  
• Yi Hong, Shlomo Shlomo, Emanuele Viterbo:
  Algebraic-phase scrambling sequences for code-spread code-division multiple-access. 1368-1372
  
• Koichiro Kitagawa, Toshiyuki Tanaka:
  Optimal spreading sequences in large CDMA systems: A statistical mechanics approach. 1373-1377
  
• Pedram Pad, Farokh Marvasti, Kasra Alishahi, Saieed Akbari:
  Errorless codes for over-loaded synchronous CDMA systems and evaluation of channel capacity bounds. 1378-1382
  
• Hiroshi Fujisaki:
  Large deviations analysis of SSMA communication systems with spreading sequences of Markov chains. 1383-1387
  
• Daniel Wilhelm, Jehoshua Bruck:
  Stochastic switching circuit synthesis. 1388-1392
  
• Paul Cuff:
  Communication requirements for generating correlated random variables. 1393-1397
  
• Krishnan Eswaran, Michael Gastpar:
  Achievable rates for conferencing multiway channels. 1398-1402
  
• Haim H. Permuter, Young-Han Kim, Tsachy Weissman:
  On directed information and gambling. 1403-1407
  
• Ami Tavory, Meir Feder:
  Finite memory universal portfolios. 1408-1412
  
• Chao Tian, Soheil Mohajer, Suhas N. Diggavi:
  Approximating the Gaussian multiple description rate region under symmetric distortion constraints. 1413-1417
  
• Chao Tian, Jun Chen:
  A novel coding scheme for symmetric multiple description coding. 1418-1422
  
• Sagar Shenvi, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg:
  "Real" Slepian-Wolf codes. 1423-1427
  
• Jun Chen, Da-ke He, Ashish Jagmohan:
  Slepian-Wolf coding with a mismatched decoder. 1428-1432
  
• Satish Babu Korada, Shrinivas Kudekar, Nicolas Macris:
  Concentration of magnetization for linear block codes. 1433-1437
  
• Takayuki Nozaki, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa:
  Detailed evolution of degree distributions in residual graphs with joint degree distributions. 1438-1442
  
• Jeremie Ezri, Andrea Montanari, Sewoong Oh, Rüdiger L. Urbanke:
  The slope scaling parameter for general channels, decoders, and ensembles. 1443-1447
  
• Jeremie Ezri, Rüdiger L. Urbanke, Andrea Montanari, Sewoong Oh:
  Computing the threshold shift for general channels. 1448-1452
  
• Akiko Manada, Navin Kashyap:
  On the period of a periodic-finite-type shift. 1453-1457
  
• Erez Louidor, Tze-Lei Poo, Panu Chaichanavong, Brian H. Marcus:
  Maximum insertion rate and capacity of multidimensional constraints. 1458-1462
  
• Ido Tal, Ron M. Roth:
  Bounds on the rate of 2-D bit-stuffing encoders. 1463-1467
  
• Artyom Sharov, Ron M. Roth:
  Two-dimensional constrained coding based on tiling. 1468-1472
  
• Jinhui Chen, Dirk T. M. Slock:
  Orthogonal space-time block codes for analog channel feedback. 1473-1477
  
• Shahab Sanayei:
  Tight performance bounds for space-time coded systems with antenna selection. 1478-1482
  
• Smarajit Das, B. Sundar Rajan:
  Low-delay, high-rate, non-square STBCs from scaled complex orthogonal designs. 1483-1487
  
• Camilla Hollanti, Hsiao-feng Lu:
  Constructing asymmetric space-time codes with the Smart Puncturing Method. 1488-1492
  
• Tadashi Wadayama:
  Interior point decoding for linear vector channels based on convex optimization. 1493-1497
  
• David Burshtein:
  Iterative approximate linear programming decoding of LDPC codes with linear complexity. 1498-1502
  
• Mark F. Flanagan:
  Codeword-independent performance of nonbinary linear codes under linear-programming and sum-product decoding. 1503-1507
  
• Vitaly Skachek, Mark F. Flanagan, Eimear Byrne, Marcus Greferath:
  Polytope representations for linear-programming decoding of non-binary linear codes. 1508-1512
  
• Ali Nazari, S. Sandeep Pradhan, Achilleas Anastasopoulos:
  A new sphere-packing bound for maximal error exponent for multiple-access channels. 1513-1517
  
• Yonatan Kaspi, Neri Merhav:
  Error exponents for degraded broadcast channels with degraded message sets. 1518-1522
  
• Raúl H. Etkin, Neri Merhav, Erik Ordentlich:
  Error exponents of optimum decoding for the interference channel. 1523-1527
  
• Cheng Chang, Anant Sahai:
  Trade-off of lossless source coding error exponents. 1528-1532
  
• Jayanth Nayak, Ertem Tuncel:
  Successive improvement of capacity with power constraints. 1533-1537
  
• Hamid Behroozi, Fady Alajaji, Tamás Linder:
  On the optimal power-distortion region for asymmetric Gaussian sensor networks with fading. 1538-1542
  
• Deniz Gündüz, Jayanth Nayak, Ertem Tuncel:
  Wyner-Ziv coding over broadcast channels using hybrid digital/analog transmission. 1543-1547
  
• Chao Tian, Shlomo Shamai:
  A unified coding scheme for hybrid transmission of Gaussian source over Gaussian channel. 1548-1552
  
• Kees A. Schouhamer Immink, Kui Cai:
  Simple classes of constrained systems with unconstrained positions that outperform the maxentropic bound. 1553-1556
  
• Filip Paluncic, Hendrik C. Ferreira, Willem A. Clarke:
  A variable length moment balancing template. 1557-1561
  
• Emma Frontana, Craig Jamieson, Ivan J. Fair:
  Improved spectral performance of Knuth Codes. 1562-1566
  
• Jos H. Weber, Kees A. Schouhamer Immink:
  Knuth's balancing of codewords revisited. 1567-1571
  
• Tobias Koch, Amos Lapidoth:
  On multipath fading channels at high SNR. 1572-1576
  
• Antonia Maria Tulino, Sergio Verdú, Giuseppe Caire, Shlomo Shamai:
  Intersymbol interference with flat fading: Channel capacity. 1577-1581
  
• Ulrich G. Schuster, Giuseppe Durisi, Helmut Bölcskei, H. Vincent Poor:
  Capacity bounds for peak-constrained multiantenna wideband channels. 1582-1586
  
• Ada S. Y. Poon, David N. C. Tse:
  Polarization degrees of freedom. 1587-1591
  
• Youngchul Sung, Heejung Yu, H. Vincent Poor:
  Information, energy and density for Ad Hoc sensor networks over correlated random fields: Large deviations analysis. 1592-1596
  
• Sriram Venkateswaran, Upamanyu Madhow:
  Distributed detection with a minimalistic signal model: A framework for exploiting correlated sensing. 1597-1601
  
• Raghuraman Mudumbai, Upamanyu Madhow:
  Information theoretic bounds for sensor network localization. 1602-1606
  
• Shan-Yuan Ho:
  Data fusion in a relay network. 1607-1611
  
• Lav R. Varshney:
  Transporting information and energy simultaneously. 1612-1616
  
• Frans M. J. Willems, Ton Kalker:
  Semantic coding: Partial transmission. 1617-1621
  
• Siu-Wai Ho, Sergio Verdú:
  Conditional entropy and error probability. 1622-1626
  
• Flemming Topsøe:
  Intrinsic methods for optimization problems. 1627-1630
  
• Cédric Lauradoux, Marion Videau:
  Matriochka symmetric Boolean functions. 1631-1635
  
• Nicholas Kolokotronis:
  On symplectic matrices of cubic Boolean forms and connections with second order nonlinearity. 1636-1640
  
• Serdar Boztas:
  Fast computation of Boolean influences. 1641-1645
  
• Aditya Ramamoorthy:
  Communicating the sum of sources over a network. 1646-1650
  
• Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard:
  ARQ for network coding. 1651-1655
  
• Satish Babu Korada, Dinkar Vasudevan:
  Broadcast and slepian-wolf multicast over Aref networks. 1656-1660
  
• Mayank Bakshi, Michelle Effros:
  On achievable rates for multicast in the presence of side information. 1661-1665
  
• Fernando Pérez-Cruz:
  Kullback-Leibler divergence estimation of continuous distributions. 1666-1670
  
• Soosan Beheshti:
  Kullback-Leibler distance in linear parametric modeling. 1671-1675
  
• Steeve Zozor, Mariela Portesi:
  Some entropic extensions of the uncertainty principle. 1676-1680
  
• Bela A. Frigyik, Santosh Srivastava, Maya R. Gupta:
  Functional Bregman divergence. 1681-1685
  
• Rajiv Agarwal, Rath Vannithamby, John M. Cioffi:
  Optimal allocation of feedback bits for downlink OFDMA systems. 1686-1690
  
• Xin Wang, Georgios B. Giannakis:
  Ergodic capacity and average rate-guaranteed scheduling for wireless multiuser OFDM systems. 1691-1695
  
• Tolga Girici, Anthony Ephremides:
  Asymptotic analysis of an OFDMA scheme with random packet arrivals. 1696-1700
  
• Hsiao-feng Lu:
  Diversity-multiplexing tradeoff optimal codes for OFDM-based asynchronous cooperative networks. 1701-1705
  
• Chandra Nair, Abbas El Gamal:
  The capacity region of a class of 3-receiver broadcast channels with degraded message sets. 1706-1710
  
• Wei Kang, Gerhard Kramer:
  Broadcast channel with degraded source random variables and receiver side information. 1711-1715
  
• Ron Dabora, Andrea Goldsmith:
  Capacity theorems for the finite-state broadcast channel with feedback. 1716-1720
  
• Eduard Calvo, Daniel Pérez Palomar, Javier Rodríguez Fonollosa, Josep Vidal:
  The computation of the capacity region of the discrete degraded BC is a nonconvex DC problem. 1721-1725
  
• Yuval Cassuto, Jehoshua Bruck:
  Array codes for clustered column erasures. 1726-1730
  
• Anxiao Jiang, Robert Mateescu, Moshe Schwartz, Jehoshua Bruck:
  Rank modulation for flash memories. 1731-1735
  
• Anxiao Jiang, Moshe Schwartz, Jehoshua Bruck:
  Error-correcting codes for rank modulation. 1736-1740
  
• Anxiao Jiang, Jehoshua Bruck:
  Joint coding for flash memory storage. 1741-1745
  
• Ana Salagean:
  An algorithm for computing minimal bidirectional linear recurrence relations. 1746-1750
  
• Li-Ping Wang, Quan-Long Wang, Kun-Peng Wang:
  A lattice-based linear shift register synthesis for multisequences of varying length. 1751-1754
  
• Simon Litsyn, Alexander Shpunt:
  Typical peak sidelobe level of binary sequences. 1755-1757
  
• Pascale Charpin, Guang Gong:
  Hyperbent functions, Kloosterman sums and Dickson polynomials. 1758-1762
  
• Yury Polyanskiy, H. Vincent Poor, Sergio Verdú:
  New channel coding achievability bounds. 1763-1767
  
• Venkat Anantharam, François Baccelli:
  A Palm theory approach to error exponents. 1768-1772
  
• Yaniv Akirav, Neri Merhav:
  Exact characterization of the minimax loss in error exponents of universal decoders. 1773-1777
  
• Erez Sabbag, Neri Merhav:
  Achievable error exponents for channel with side information - erasure and list decoding. 1778-1782
  
• K. D. Prathapasinghe Dharmawansa, Matthew R. McKay:
  Distribution of the diagonal of a 3 × 3 complex non-central Wishart matrix. 1783-1787
  
• Fangfang Niu, Haochuan Zhang, Hongwen Yang, Dacheng Yang:
  Distribution of the smallest eigenvalue of complex central semi-correlated Wishart matrices. 1788-1792
  
• Ezio Biglieri, Emanuele Grossi, Marco Lops, Adrià Tauste Campo:
  Large-system analysis of a CDMA dynamic channel under a Markovian input process. 1793-1797
  
• Nathan Levy, Oren Somekh, Shlomo Shamai, Ofer Zeitouni:
  On certain large random Hermitian Jacobi matrices with applications to wireless communications. 1798-1802
  
• Martin Bossert, Sergey Bezzateev:
  Decoding of interleaved RS codes with the Euclidean algorithm. 1803-1807
  
• Christian Senger, Vladimir Sidorenko, Martin Bossert, Victor V. Zyablov:
  Decoding generalized concatenated codes using Interleaved Reed-Solomon codes. 1808-1812
  
• Fabian Lim, Marc P. C. Fossorier, Aleksandar Kavcic:
  Notes on the automorphism groups of Reed Solomon binary images. 1813-1817
  
• Mario Blaum, Jorge Campello de Souza, Ksenija Lakovic, Bruce A. Wilson, Shaohua Yang:
  Optimal interleaving for burst errors in Generalized Concatenated codes. 1818-1822
  
• Salim Y. El Rouayheb, Alex Sprintson, Costas N. Georghiades:
  On the relation between the Index Coding and the Network Coding problems. 1823-1827
  
• Ali Al-Bashabsheh, Abbas Yongaçoglu:
  On the k-pairs problem. 1828-1832
  
• Qifu Tyler Sun, Siu-Ting Ho, Shuo-Yen Robert Li:
  On network matroids and linear network codes. 1833-1837
  
• Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
  Linear network codes and systems of polynomial equations. 1838-1842
  
• Juliano B. Lima, Ricardo M. Campello de Souza, Daniel Panario:
  Security of public-key cryptosystems based on Chebyshev polynomials over prime finite fields. 1843-1847
  
• Carlos Aguilar Melchor, Philippe Gaborit:
  A fast private information retrieval protocol. 1848-1852
  
• Aldar C.-F. Chan:
  On compression of cryptographic keys. 1853-1857
  
• Carlos Aguilar Melchor, Guilhem Castagnos, Philippe Gaborit:
  Lattice-based homomorphic encryption of vector spaces. 1858-1862
  
• Ori Shental, Paul H. Siegel, Jack K. Wolf, Danny Bickson, Danny Dolev:
  Gaussian belief propagation solver for systems of linear equations. 1863-1867
  
• Emanuele Grossi, Marco Lops:
  Asymptotic optimality of the SPRT for the detection of Markov signals. 1868-1872
  
• Foroohar Foroozan, Amir Asif:
  N-ary maximum likelihood target detection with time reversal. 1873-1877
  
• Danny Bickson, Danny Dolev, Ori Shental, Paul H. Siegel, Jack K. Wolf:
  Gaussian belief propagation based multiuser detection. 1878-1882
  
• Frédéric Lehmann:
  Blind carrier phase estimation and data detection in turbo coded transmissions. 1883-1887
  
• Christian Koller, Jörg Kliewer, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
  Minimum distance bounds for multiple-serially concatenated code ensembles. 1888-1892
  
• Iryna Andriyanova:
  Finite-length scaling of parallel turbo codes on the BEC. 1893-1897
  
• Igal Sason, Gil Wiechman:
  Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channel. 1898-1902
  
• Shi Jin, Matthew R. McKay, Caijun Zhong, Kai-Kit Wong:
  Ergodic capacity analysis of amplify-and-forward MIMO dual-hop systems. 1903-1907
  
• Ramy Tannious, Aria Nosratinia:
  The interference channel with MIMO relay: Degrees of freedom. 1908-1912
  
• Jörg Wagner, Armin Wittneben:
  Capacity scaling of (long) non-regenerative MIMO multi-hop channels. 1913-1917
  
• Mohammad Ali Khojastepour, Xiaodong Wang:
  Capacity bounds for MIMO shared relay channel with half-duplex constraint. 1918-1922
  
• Young-Sik Kim, Jung-Soo Chung, Sung-Tai Choi, Jong-Seon No, Habong Chung:
  New construction of M-ary sequence family from Sidel'nikov sequences. 1923-1926
  
• Jung-Soo Chung, Jong-Seon No, Young-Sik Kim, Ji-Woong Jang, Habong Chung:
  Generalized extending method for construction of q-ary low correlation zone sequence sets. 1927-1930
  
• Chenggao Han, Takeshi Hashimoto, Naoki Suehiro:
  A novel construction method of zero-correlation zone sequences based on complete complementary codes. 1931-1934
  
• Gagan Garg, P. Vijay Kumar, C. E. Veni Madhavan:
  Low correlation interleaved QAM sequences. 1935-1939
  
• Hirakendu Das, Alon Orlitsky, Narayana P. Santhanam, Junan Zhang:
  Further results on relative redundancy. 1940-1943
  
• Michael B. Baer:
  Tight bounds on minimum maximum pointwise redundancy. 1944-1948
  
• Matthew Klimesh:
  Redundancy and optimality of codes for infinite-entropy sources. 1949-1953
  
• Markus Grassl, T. Aaron Gulliver:
  On self-dual MDS codes. 1954-1957
  
• A. J. Han Vinck, Yuan Luo:
  Optimum distance profiles of linear block codes. 1958-1962
  
• David Declercq, Marc P. C. Fossorier:
  Improved impulse method to evaluate the low weight profile of sparse binary linear codes. 1963-1967
  
• Venkatesan Guruswami, Widad Machmouchi:
  Explicit interleavers for a Repeat Accumulate Accumulate (RAA) code construction. 1968-1972
  
• Vladimir Blinovsky:
  About convexity of one function from coding theory. 1973-1976
  
• Hari Palaiyanur, Cheng Chang, Anant Sahai:
  Lossy compression of active sources. 1977-1981
  
• Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal:
  On subspace structure in source and channel coding. 1982-1986
  
• Wei Sun, En-Hui Yang:
  On achievable distortion regions of analog Gaussian watermarking. 1987-1991
  
• Soheil Mohajer, Chao Tian, Suhas N. Diggavi:
  Asymmetric Gaussian multiple descriptions and asymmetric multilevel diversity coding. 1992-1996
  
• Ivana Radulovic, Pascal Frossard:
  Balanced multiple description scalar quantization. 1997-2001
  
• Dominik Seethaler, Helmut Bölcskei:
  Infinity-norm sphere-decoding. 2002-2006
  
• Christoph Studer, Helmut Bölcskei:
  Soft-input soft-output sphere decoding. 2007-2011
  
• Saif K. Mohammed, Ananthanarayanan Chockalingam, B. Sundar Rajan:
  A Low-complexity near-ML performance achieving algorithm for large MIMO detection. 2012-2016
  
• Weiyu Xu, Mihailo Stojnic, Babak Hassibi:
  ON exact maximum-likelihood detection for non-coherent MIMO wireless systems: A branch-estimate-bound optimization framework. 2017-2021
  
• Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu:
  Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels. 2022-2025
  
• Hazer Inaltekin, Mung Chiang, H. Vincent Poor, Stephen B. Wicker:
  On the asymptotic behavior of selfish transmitters sharing a common channel. 2026-2030
  
• Cong Shen, Michael P. Fitz:
  A utility maximization approach to the design of unequal error protection with multilevel codes. 2031-2035
  
• Daeyoung Park, Giuseppe Caire:
  Hard fairness versus proportional fairness in wireless communications: The Multiple-Cell Case. 2036-2040
  
• Rudolf Mathar, Anke Schmeink:
  Game equilibria for discrete channels. 2041-2045
  
• Slawomir Stanczak, Angela Feistel, Holger Boche:
  QoS support with utility-based power control. 2046-2050
  
• Salah A. Aly, Zhenning Kong, Emina Soljanin:
  Raptor codes based distributed storage algorithms for wireless sensor networks. 2051-2055
  
• Dohyung Park, Sae-Young Chung:
  Performance - complexity tradeoffs of rateless codes. 2056-2060
  
• Alberto Tarable, Sergio Benedetto:
  Graph-based LT and raptor codes. 2061-2065
  
• Ming Xiao, Tor Aulin, Muriel Médard:
  Systematic binary deterministic rateless codes. 2066-2070
  
• Shirish S. Karande, Kiran Misra, Sohraab Soltani, Hayder Radha:
  Design and analysis of Generalized LT-codes using colored ripples. 2071-2075
  
• K. Sreeram, S. Birenjith, P. Vijay Kumar:
  DMT of multi-hop cooperative networks-Part I: K-Parallel-Path networks. 2076-2080
  
• K. Sreeram, S. Birenjith, P. Vijay Kumar:
  DMT of multi-hop cooperative networks-Part II: Layered and multi-antenna networks. 2081-2085
  
• Oren Somekh, Osvaldo Simeone, H. Vincent Poor, Shlomo Shamai:
  Cellular systems with full-duplex compress-and-forward relaying and cooperative base stations. 2086-2090
  
• Aitor del Coso, Sébastien Simoens:
  Uplink rate region of a coordinated cellular network with distributed compression. 2091-2095
  
• Deniz Gündüz, Elza Erkip, Andrea J. Goldsmith, H. Vincent Poor:
  Lossy source transmission over the relay channel. 2096-2100
  
• Imre Csiszár, Frantisek Matús:
  On minimization of entropy functionals under moment constraints. 2101-2105
  
• Damianos Karakos, Sanjeev Khudanpur, Carey E. Priebe:
  Computation of Csiszár's mutual Information of order α. 2106-2110
  
• Kohtaro Kohtaro:
  The Tsallis entropy and the Shannon entropy of a universal probability. 2111-2115
  
• Weidong Xu, Jia Wang, Jun Sun:
  A projection method for derivation of non-Shannon-type information inequalities. 2116-2120
  
• Laurent Guille, Terence H. Chan, Alex J. Grant:
  The minimal set of Ingleton inequalities. 2121-2125
  
• Waleed Mohamed, Ying Zhang, Abdessamad Ben Hamza, Nizar Bouguila:
  Stochastic optimization approach for entropic image alignment. 2126-2130
  
• Razvan Cristescu:
  Cardinality-constrained feature selection for classification. 2131-2135
  
• Narayana P. Santhanam, Martin J. Wainwright:
  Information-theoretic limits of graphical model selection in high dimensions. 2136-2140
  
• Yongwook Choi, Wojciech Szpankowski:
  Large deviations for constrained pattern matching. 2141-2145
  
• Won S. Yoon:
  Streaming transmission of poisson traffic. 2146-2150
  
• Dilip V. Sarwate:
  Buffering and interleaving in coded communication systems. 2151-2155
  
• Claudio Weidmann:
  Coding for the q-ary symmetric channel with moderate q. 2156-2159
  
• Yingquan Wu:
  A class of constant-weight cyclic codes. 2160-2161
  
• WeiHsin Gut, Soumya Jana, Michelle Effrost:
  On approximating the rate regions for lossy source coding with coded and uncoded side information. 2162-2166
  
• Maxim Raginsky:
  Universal Wyner-Ziv coding of discrete memoryless sources with known side information statistics. 2167-2171
  
• Shraga I. Bross, Tsachy Weissman:
  On successive refinement for the Wyner-Ziv problem with partially cooperating decoders. 2172-2176
  
• Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu:
  Universal coding for lossy complementary delivery problem. 2177-2181
  
• Mihailo Stojnic, Weiyu Xu, Babak Hassibi:
  Compressed sensing of approximately sparse signals. 2182-2186
  
• Galen Reeves, Michael Gastpar:
  Sampling bounds for sparse support recovery in the presence of noise. 2187-2191
  
• Dapo Omidiran, Martin J. Wainwright:
  High-dimensional subset recovery in noise: Sparse measurements and statistical efficiency. 2192-2196
  
• Wei Wang, Martin J. Wainwright, Kannan Ramchandran:
  Information-theoretic limits on sparse support recovery: Dense versus sparse measurements. 2197-2201
  
• Ruoheng Liu, H. Vincent Poor:
  Multi-antenna Gaussian broadcast channels with confidential messages. 2202-2206
  
• Yi Cao, Biao Chen:
  An achievable rate region for discrete memoryless broadcast channels with confidential messages. 2207-2211
  
• Xiang He, Aylin Yener:
  The role of an untrusted relay in secret communication. 2212-2216
  
• Ersen Ekrem, Sennur Ulukus:
  Secrecy in cooperative relay broadcast channels. 2217-2221
  
• Shashi Borade, Baris Nakiboglu, Lizhong Zheng:
  some fundamental limits of unequal error protection. 2222-2226
  
• Alban Goupil, David Declercq:
  UEP non-binary LDPC codes: A promising framework based on group codes. 2227-2231
  
• Chung-Hsuan Wang, Chi-Chao Chao:
  Canonical convolutional encoders for unequal error protection. 2232-2236
  
• Neele von Deetzen, Werner Henkel:
  Unequal error protection multilevel codes and hierarchical modulation for multimedia transmission. 2237-2241
  
• Bertrand Ndzana Ndzana, Andrew W. Eckford, Amin Shokrollahi, Gil I. Shamir:
  Fountain codes for piecewise stationary channels. 2242-2246
  
• Maryam Modir Shanechi, Uri Erez, Kevin P. Boyle, Gregory W. Wornell:
  Time-invariant rateless codes for MIMO channels. 2247-2251
  
• Yijia Fan, Lifeng Lai, Elza Erkip, H. Vincent Poor:
  Rateless coding for MIMO block fading channels. 2252-2256
  
• Auguste Venkiah, Pablo Piantanida, Charly Poulliat, Pierre Duhamel, David Declercq:
  Rateless coding for quasi-static fading channels using channel estimation accuracy. 2257-2261
  
• Lei Xiao, Thomas E. Fuja, Daniel J. Costello Jr.:
  An analysis of mobile relaying for coverage extension. 2262-2266
  
• Huiming Wang, Xiang-Gen Xia, Qinye Yin, Wenjie Wang:
  Computationally efficient MMSE and MMSE-DFE equalizations for asynchronous cooperative communications with multiple frequency offsets. 2267-2271
  
• Wessam Mesbah, Timothy N. Davidson:
  Power and resource allocation for orthogonal multiple access relay systems. 2272-2276
  
• Avi Steiner, Amichai Sanderovich, Shlomo Shamai:
  The multi-session multi-layer broadcast approach for two cooperating receivers. 2277-2281
  
• Janis Dingel, Olgica Milenkovic:
  A list-decoding approach for inferring the dynamics of gene regulatory networks. 2282-2286
  
• Marcel Nassar, Rami Abdallah, Hady Ali Zeineddine, Elias Yaacoub, Zaher Dawy:
  A new multitask learning method for multiorganism gene network estimation. 2287-2291
  
• Arkadii G. D'yachkov, Anthony J. Macula, Thomas E. Renz, Vyacheslav V. Rykov:
  Random Coding Bounds for DNA codes based on Fibonacci ensembles of DNA sequences. 2292-2296
  
• Yagiz Sutcu, Shantanu Rane, Jonathan S. Yedidia, Stark C. Draper, Anthony Vetro:
  Feature extraction for a Slepian-Wolf biometric system using LDPC codes. 2297-2301
  
• Brian P. Dunn, J. Nicholas Laneman:
  Basic limits on protocol information in slotted communication networks. 2302-2306
  
• Roy Timo, Alex J. Grant, Terence Chan, Gerhard Kramer:
  Source coding for a simple network with receiver side information. 2307-2311
  
• Shizheng Li, Aditya Ramamoorthy:
  Rate and power allocation under the pairwise distributed source coding constraint. 2312-2316
  
• Krishnamurthy Viswanathan, Ram Swaminathan:
  Framework and algorithms for collaborative compression. 2317-2321
  
• Alfonso artinez:
  Coding and modulation for the additive exponential noise channel. 2322-2326
  
• Ahmed A. Farid, Steve Hranilovic:
  Design of non-uniform capacity-approaching signaling for optical wireless intensity channels. 2327-2331
  
• Sundeep Venkatraman, Oliver M. Collins:
  The performance of BICM with a single decision feedback for the AWGN channel. 2332-2336
  
• Alfonso Martinez, Albert Guillen i Fabregas, Giuseppe Caire, Frans M. J. Willems:
  Bit-interleaved coded modulation revisited: A mismatched decoding perspective. 2337-2341
  
• Eric Rachlin, John E. Savage:
  A framework for coded computation. 2342-2346
  
• Steffen Schober, Martin Bossert:
  Boolean functions with noisy inputs. 2347-2350
  
• Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin:
  Embeddings of local automata. 2351-2355
  
• Neal G. Anderson:
  An information-theoretic measure for the computational fidelity of physical processes. 2356-2360
  
• Lina Mroueh, Stéphanie Rouquette-Léveil, Ghaya Rekaya-Ben Othman, Jean-Claude Belfiore:
  DMT of weighted parallel channels: Application to broadcast channels. 2361-2365
  
• Patrick Mitran:
  The diversity-multiplexing tradeoff for independent parallel MIMO channels. 2366-2370
  
• Hsiao-feng Lu, Camilla Hollanti:
  On the construction of DMT-Optimal AST codes with transmit antenna selection. 2371-2374
  
• Paul Lusina, Robert Schober, Lutz Lampe:
  Diversity-multiplexing trade-off of the hybrid non-orthogonal amplify-decode and forward protocol. 2375-2379
  
• K. Raj Kumar, Giuseppe Caire:
  Coding and decoding for the Dynamic Decode and Forward relay protocol. 2380-2384
  
• Tobias Lutz, Christoph Hausl, Ralf Koetter:
  Coding strategies for noise-free relay cascades with half-duplex constraint. 2385-2389
  
• Chao Wang, Yijia Fan, Ioannis Krikidis, John S. Thompson, H. Vincent Poor:
  Superposition-coded concurrent decode-and-forward relaying. 2390-2394
  
• Zhixin Liu, Momin Uppal, Vladimir Stankovic, Zixiang Xiong:
  Compress-forward coding with BPSK modulation for the half-duplex Gaussian relay channel. 2395-2399
  
• Tuvi Etzion, Nicholas Kalouptsidis, Nicholas Kolokotronis, Konstantinos Limniotis, Kenneth G. Paterson:
  On the error linear complexity profiles of binary sequences of period 2ⁿ. 2400-2404
  
• Young-Joon Kim, Hong-Yeop Song:
  Linear complexity of prime n-square sequences. 2405-2408
  
• Honggang Hu, Guang Gong, Dengguo Feng:
  New results on periodic sequences with large k-error linear complexity. 2409-2413
  
• Alexandra Alecu, Ana Salagean:
  An approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transform. 2414-2418
  
• Amos Lapidoth, Stefan M. Moser, Michele A. Wigger:
  On the capacity of free-space optical intensity channels. 2419-2423
  
• Gautham Hariharan, Vasanthan Raghavan, Akbar M. Sayeed:
  Capacity of sparsewideband channels with limited feedback. 2424-2428
  
• Michael B. Pursley, Thomas C. Royster IV:
  Shannon bounds on the throughput for Gaussian, bi-level, block interference channels. 2429-2433
  
• Sirikiat Lek Ariyavisitakul, Jun Zheng, Eric Ojard, Joonsuk Kim:
  Subspace beamforming with capacity-balancing channel decomposition. 2434-2438
  
• Holger Boche, Ullrich J. Mönich:
  General behavior of sampling-based signal and system representation. 2439-2443
  
• Yuzhe Jin, Bhaskar D. Rao:
  Performance limits of matching pursuit algorithms. 2444-2448
  
• George N. Karystinos, Athanasios P. Liavas:
  Quadratic form maximization over the binary field with polynomial complexity. 2449-2453
  
• Arash A. Amini, Martin J. Wainwright:
  High-dimensional analysis of semidefinite relaxations for sparse principal components. 2454-2458
  
• Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger:
  Enumerative coding for tree sources. 2459-2463
  
• Michael B. Baer:
  Prefix codes for power laws. 2464-2468
  
• Michael B. Baer:
  Reserved-length prefix coding. 2469-2473
  
• Andrea Montanari, Elchanan Mossel:
  Smooth compression, Gallager bound and nonlinear sparse-graph codes. 2474-2478
  
• Ihn-Jung Baik, Sae-Young Chung:
  Irregular low-density parity-check lattices. 2479-2483
  
• Daniele Micciancio, Antonio Nicolosi:
  Efficient bounded distance decoders for Barnes-Wall lattices. 2484-2488
  
• Brian M. Kurkoski, Justin Dauwels:
  Message-passing decoding of lattices using Gaussian mixtures. 2489-2493
  
• Carmen Martínez, Esteban Stafford, Ramón Beivide, Cristobal Camarero, Fernando Vallejo, Ernst M. Gabidulin:
  Graph-based metrics over QAM constellations. 2494-2498
  
• Axel Heim, Vladimir Sidorenko, Ulrich Sorger:
  Computation of Moments in the Trellis. 2499-2503
  
• Mehdi Molkaraie, Payam Pakzad:
  On properties of the minimum entropy sub-tree to compute lower bounds on the partition function. 2504-2507
  
• Narayanaswamy Balakrishnan, Rohit Negi, Pradeep K. Khosla:
  An analysis of the computational complexity of sequential decoding of specific tree codes over Gaussian channels. 2508-2512
  
• Marcin Sikora, Daniel J. Costello Jr.:
  Heuristic survivor selection for reduced complexity BCJR-type algorithms. 2513-2517
  
• Randall Berry, David Tse:
  Information theoretic games on interference channels. 2518-2522
  
• Vojislav Gajic, Bixio Rimoldi:
  Game theoretic considerations for the Gaussian Multiple Access Channel. 2523-2527
  
• Mokshay M. Madiman:
  Playing games: A fresh look at rate and capacity regions. 2528-2532
  
• Cho Yiu Ng, Tat-Ming Lok, Tan F. Wong:
  Pricing game for selfish link cooperation. 2533-2537
  
• Dheeraj Sreedhar, Ananthanarayanan Chockalingam, B. Sundar Rajan:
  High-rate, single-symbol decodable distributed STBCs for partially-coherent cooperative networks. 2538-2542
  
• Maya Badr, Jean-Claude Belfiore:
  Distributed space time codes for the Amplify-and-Forward Multiple-Access Relay channel. 2543-2547
  
• Frédérique E. Oggier, Emmanuel Lequeu:
  Differential distributed space-time coding based on Cayley codes. 2548-2552
  
• Maya Badr, Jean-Claude Belfiore:
  Distributed space-time block codes for the MIMO Multiple Access Channel. 2553-2557
  
• Jin-Hee Lee, Young-Chai Ko:
  Performance improvement of transmit beamforming MISO system using optimum codebook indexing over feedback error channel. 2558-2562
  
• Hui-Ping Li, Tingting Liu, Jian-Kang Zhang, Kon Max Wong:
  Robust downlink power control using worst-case performance optimization. 2563-2567
  
• Manav Garg, Mahesh K. Varanasi:
  The parallel channel with ordered gains: A high snr analysis. 2568-2572
  
• Hong Wan, Rong-Rong Chen, Yingbin Liang:
  Optimality of beamforming in MIMO multi-access channels via virtual representation. 2573-2577
  
• Sergey Loyka, Charalambos D. Charalambous:
  On the capacity of a class of MIMO channels subject to normed uncertainty. 2578-2582
  
• Lingjia Liu, Jean-François Chamberland:
  On the effective capacities of multiple-antenna Gaussian channels. 2583-2587
  
• Krishnan Padmanabhan, Sundeep Venkatraman, Oliver M. Collins:
  Tight upper and lower bounds on the constrained capacity of non-coherent multi-antenna channels. 2588-2592
  
• Yun Kyoung Han, Kyeongcheol Yang:
  New near-optimal frequency-Hopping sequences of length pq. 2593-2597
  
• Tor Helleseth, Alexander Kholosha, Aina Johansen:
  m-sequences of different lengths with four-valued cross correlation. 2598-2602
  
• Seok-Yong Jin, Hong-Yeop Song:
  Note on a pair of binary sequences with ideal two-level crosscorrelation. 2603-2607
  
• Pascale Charpin, Tor Helleseth, Victor Zinoviev:
  Divisibility properties of Kloosterman sums over finite fields of characteristic two. 2608-2612
  
• David G. Farmer, Kathy J. Horadam:
  Presemifield bundles over GF(p³). 2613-2616
  
• Michael Kiermaier, Alfred Wassermann:
  On the minimum Lee distance of quadratic residue codes over ℤ44. 2617-2619
  
• Daniel Augot, Alexander Zeh:
  On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm. 2620-2624
  
• Jean-François Bercher, Christophe Vignat:
  An entropic view of Pickands' theorem. 2625-2628
  
• Guangyue Han, Brian H. Marcus:
  Asymptotics of entropy rate of hidden Markov chains at weak Black Holes. 2629-2633
  
• Babak Hassibi, Sormeh Shadbakht:
  The entropy region for three Gaussian random variables. 2634-2638
  
• Peter Harremoës, Igor Vajda:
  Efficiency of entropy testing. 2639-2643
  
• Peter Harremoës, Oliver Johnson, Ioannis Kontoyiannis:
  Thinning and information projections. 2644-2648
  
• Nick Letzepis, Albert Guillen i Fabregas:
  Outage probability of the MIMO Gaussian free-space optical channel with PPM. 2649-2653
  
• Vasanthan Raghavan, Akbar M. Sayeed, Venugopal V. Veeravalli:
  Structured statistical precoding for correlated MIMO channels. 2654-2658
  
• Georgios K. Psaltopoulos, Armin Wittneben:
  Achievable rates of nonlinear MIMO systems with noisy channel state information. 2659-2662
  
• Mari Kobayashi, Giuseppe Caire, Nihar Jindal:
  How much training and feedback are needed in MIMO broadcast channels? 2663-2667
  
• Zhendong Luo, Dawei Huang:
  Integrated MAP detector for V-BLAST systems. 2668-2672
  
• Sibi Raj Bhaskaran:
  Forward decoding over a relay channel. 2673-2677
  
• Kyu-Sung Hwang, Young-Chai Ko, Mohamed-Slim Alouini:
  Performance analysis of incremental relaying with relay selection and adaptive modulation over non-identically distributed cooperative paths. 2678-2682
  
• Mohammad Hossein Yassaee, Mohammad Reza Aref:
  Generalized compress-and-forward strategy for relay networks. 2683-2687
  
• Clemens Schnurr, Slawomir Stanczak, Tobias J. Oechtering:
  Coding theorems for the restricted half-duplex two-way relay channel with joint decoding. 2688-2692
  
• Liang-Liang Xie:
  Omnidirectional relay in wireless networks. 2693-2697
  
• Arun Padakandla, Rajesh Sundaresan:
  Complexity of scheduling for minimum power on a GMAC. 2698-2701
  
• Shraga I. Bross, Amos Lapidoth, Michele A. Wigger:
  The Gaussian MAC with conferencing encoders. 2702-2706
  
• Ramachandran Rajesh, Virendra K. Varshneya, Vinod Sharma:
  Distributed joint source channel coding on a multiple access channel with side information. 2707-2711
  
• Lalitha Sankar, Elza Erkip, H. Vincent Poor:
  Sum-capacity of ergodic fading interference and compound multiaccess channels. 2712-2716
  
• Tal Gariby, Uri Erez:
  On general lattice quantization noise. 2717-2721
  
• Xiaolin Wu, Xiaohan Wang, Guangming Shi:
  Trellis quantization for L∞-constrained compression with integer wavelets. 2722-2726
  
• Xiang Yu, Haiquan Wang, En-Hui Yang:
  Optimal quantization for noisy channels with random index assignment. 2727-2731
  
• Jayanth Nayak, Ertem Tuncel:
  Low-delay quantization for source coding with side information. 2732-2736
  
• Victoria Yee, David L. Neuhoff:
  The role of Nitadori's sequence in scalar quantization of general exponential sources. 2737-2741
  
• Alan Barbieri, Dario Fertonani, Giulio Colavolpe:
  Improving the spectral efficiency of linear modulations through time-frequency packing. 2742-2746
  
• Alan Barbieri, Dario Fertonani, Giulio Colavolpe:
  Spectrally-efficient continuous phase modulations. 2747-2751
  
• Zarko B. Krusevac, Predrag B. Rapajic, Rodney A. Kennedy:
  Mutual information performance of differential MPSK detection over time-varying channels. 2752-2756
  
• Jui-Yang Chang, Wei-De Wu, Chi-Chao Chao:
  An analytical framework for ultra-wideband communications over IEEE 802.15.4a channels. 2757-2761
  
• Kai-Uwe Schmidt:
  ℤ4-valued quadratic forms and exponential sums. 2762-2766
  
• Ji-Woong Jang, Jung-Soo Chung, Jong-Seon No:
  Quaternary low correlation zone sequence set with flexible parameters. 2767-2771
  
• Heekwan Lee, Solomon W. Golomb:
  A new construction of 16-QAM near complementary sequences. 2772-2776