Program for 2011 IEEE International Symposium on Information Theory Proceedings [ISIT2011]

09:50 List Decoding of Polar Codes: Ido Tal (University of California, San Diego, USA); Alexander Vardy (University of California, San Diego, USA)
10:10 Polar Codes with Mixed Kernels: Noam Presman (Tel Aviv University, Israel); Ofer Shapira (Tel Aviv University, Israel); Simon Litsyn (Tel Aviv University, Israel)
10:30 On the Construction of Polar Codes: Ramtin Pedarsani (EPFL, Switzerland); S. Hamed Hassani (EPFL, Switzerland); Ido Tal (University of California, San Diego, USA); Emre Telatar (EPFL, Switzerland)
10:50 A Practical Approach to Polar Codes: Ali Eslami (University of Massachusetts Amherst, USA); Hossein Pishro-Nik (University of Massachusetts, Amherst, USA)

09:50 Universal Quantum State Merging: Igor Bjelakovi? (Berlin University of Technology, Germany); Holger Boche (Technical University Munich, Germany); Gisbert Jan?en (Technische Universit?t M?nchen, Germany)
10:10 Zero-Error Subspaces of Quantum Channels: Samuel Braunstein (University of York, United Kingdom); David W. Kribs (University of Guelph, Canada); Manas Patra (University of York, United Kingdom)
10:30 Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols: Hirotada Kobayashi (National Institute of Informatics / ERATO-SORST, Japan); Francois Le Gall (The University of Tokyo, Japan); Harumichi Nishimura (Osaka Prefecture University, Japan); Martin R?tteler (NEC Laboratories America, Inc., USA)
10:50 The Free Space Optical Interference Channel: Saikat Guha (Raytheon BBN Technologies, USA); Ivan Savov (McGill University, Canada); Mark Wilde (Mc Gill University, Canada)

09:50 On the Role of Diversity in Sparsity Estimation: Galen Reeves (University of California, Berkeley, USA); Michael Gastpar (University of California, Berkeley, USA)
10:10 Minimum Variance Estimation for the Sparse Signal in Noise Model: Sebastian Schmutzhard (University of Vienna, Austria); Alexander Jung (Vienna University of Technology & Institute of Telecommunications, Austria); Franz Hlawatsch (Vienna University of Technology, Austria)
10:30 Compressed Sensing Over \ell^p-Balls: Minimax Mean Square Error: David Donoho (Stanford University, USA); Iain Johnstone (Stanford University, USA); Arian Maleki (Rice University, USA); Andrea Montanari (Stanford University, USA)
10:50 Least Favorable Compressed Sensing Problems for First-Order Methods: Arian Maleki (Rice University, USA); Richard Baraniuk (Rice University, USA)

09:50 To Feed or Not to Feed Back: Himanshu Asnani (Stanford University, USA); Haim H Permuter (Ben-Gurion University, Israel); Tsachy Weissman (Stanford University, USA)
10:10 Equivalence Between Reliable Feedback Communication and Nonlinear Filter Stability: Siva Gorantla (University of Illinois, USA); Todd P Coleman (University of California, San Diego, USA)
10:30 Bounds on the Achievable Rate of Noisy Feedback Gaussian Channels under Linear Feedback Coding Scheme: Chong Li (Iowa State University, USA); Nicola Elia (Iowa State University, USA)
10:50 The Information Theoretic Characterization of the Capacity of Channels with Noisy Feedback: Chong Li (Iowa State University, USA); Nicola Elia (Iowa State University, USA)

09:50 Network Simplification: The Gaussian Diamond Network with Multiple Antennas: Caner Nazaroglu (METU, Turkey); Javad Ebrahimi (EPFL, Switzerland); Ayfer ?zg?r (EPFL, Switzerland); Christina Fragouli (EPFL, Switzerland)
10:10 On Achievable Rate Regions of the Asymmetric AWGN Two-Way Relay Channel: Lawrence Ong (The University of Newcastle, Australia); Christopher Kellett (University of Newcastle, Australia); Sarah Johnson (University of Newcastle, Australia)
10:30 Approximate Capacity of the General Gaussian Parallel Relay Network: Nicolas Schrammar (Royal Institute of Technology (KTH), Sweden); Mattias Andersson (Royal Institute of Technology, Sweden); Mikael Skoglund (Royal Institute of Technology, Sweden)
10:50 An Achievable Rate Region for Imperfectly-Known Two-Way Relay Fading Channels: Junwei Zhang (University of Nebraska-Lincoln, USA); M. Cenk Gursoy (University of Nebraska-Lincoln, USA)

09:50 LP Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices: Tadashi Wadayama (Nagoya Institute of Technology, Japan); Manabu Hagiwara (Advanced Industrial Science and Technology, Japan)
10:10 Sidon Sequences and Doubly Periodic Two-Dimensional Synchronization Patterns: Tuvi Etzion (Technion-Israel Institute of Technology, Israel)
10:30 Low Complexity Two-Dimensional Weight-Constrained Codes: Erik Ordentlich (Hewlett-Packard Laboratories, USA); Ron M. Roth (Technion, Israel)
10:50 Asymptotic Enumeration of Binary Matrices with Bounded Row and Column Weights: Erik Ordentlich (Hewlett-Packard Laboratories, USA); Farzad Parvaresh (Hewlett-Packard, USA); Ron M. Roth (Technion, Israel)

09:50 About the Reliability Function of Symmetric Channel Under List Decoding: Vladimir M. Blinovsky (Institute for Information Transmission Problems, Russia)
10:10 Zero-Error Communication Via Quantum Channels and a Quantum Lovasz Theta-Function: Runyao Duan (University of Technology, Australia); Simone Severini (University College London, United Kingdom); Andreas Winter (University of Bristol, United Kingdom)
10:30 Bounds for Threshold and Majority Group Testing: Rudolf Ahlswede (University of Bielefeld, Germany); Christian Deppe (University of Bielefeld, Germany); Vladimir Lebedev (Russian Academy of Sciences, Russia)
10:50 Analog Network Coding in the Generalized High-SNR Regime: Binyue Liu (Xidian University, P.R. China); Ning Cai (Xidian University, P.R. China)

09:50 Fixed-Length Lossy Compression in the Finite Blocklength Regime: Discrete Memoryless Sources: Victoria Kostina (Princeton University, USA); Sergio Verd? (Princeton University, USA)
10:10 On Distortion Bounds for Dependent Sources Over Wireless Networks: Shirin Jalali (California Institute of Technology, USA); Michelle Effros (California Institute of Technology, USA)
10:30 Covering Point Patterns: Amos Lapidoth (ETHZ, Switzerland); Andreas Mal?r (ETH Zurich, Switzerland); Ligong Wang (MIT, USA)
10:50 Characterization of a Part of the Rate Distortion Region for the Gaussian Distributed Source Coding: Yasutada Oohama (University of Electro-Communications, Japan)

09:50 Interference Alignment and Degrees of Freedom Region of Cellular Sigma Channel: Huarui Yin (University of Science and Technology of China, P.R. China); Lei Ke (Iowa State University, USA); Zhengdao Wang (Iowa State University, USA)
10:10 Interference Alignment in Multi-Carrier Interference Networks: Changxin Shi (Northwestern University, USA); Randall Berry (Northwestern University, USA); Michael Honig (Northwestern University, USA)
10:30 When is n-Pairs Information a Multicommodity Flow?: Girish N. Nair (University of Melbourne, Australia)
10:50 Degrees of Freedom Region for an Interference Network with General Message Demands: Lei Ke (Iowa State University, USA); Aditya Ramamoorthy (Iowa State University, USA); Zhengdao Wang (Iowa State University, USA); Huarui Yin (University of Science and Technology of China, P.R. China)

11:30 Binary Polar Code Kernels from Code Decompositions: Noam Presman (Tel Aviv University, Israel); Ofer Shapira (Tel Aviv University, Israel); Simon Litsyn (Tel Aviv University, Israel)
11:50 Polarization and Randomness Extraction: Emmanuel Abbe (EPFL, Switzerland)
12:10 Polarization in the Presence of Memory: Eren Sasoglu (Ecole Polytechnique Federale de Lausanne, Switzerland)
12:30 Polar Coding Schemes for the AWGN Channel: Emmanuel Abbe (EPFL, Switzerland); Andrew R Barron (Yale University, USA)

11:30 On Quantum Limit of Optical Communications: Concatenated Codes and Joint-Detection Receivers: Saikat Guha (Raytheon BBN Technologies, USA); Zachary Dutton (Senior Scientist, Raytheon BBN Technologies, USA); Jeffrey H. Shapiro (Massachusetts Institute of Technology, USA)
11:50 Adaptively Correcting Quantum Errors with Entanglement: Yuichiro Fujiwara (Michigan Technological University, USA); Min-Hsiu Hsieh (Statistical Laboratory, University of Cambridge, United Kingdom)
12:10 On Capacity of Optical Channels with Coherent Detection: Hye Won Chung (Massachusetts Institute of Technology, USA); Saikat Guha (Raytheon BBN Technologies, USA); Lizhong Zheng (Massachustts Institute of Technology, USA)
12:30 The Entropy Gain of Quantum Channels: Alexander Holevo (Steklov Mathematical Institute, Russia)

11:30 Equivalence Between Minimal Generative Model Graphs and Directed Information Graphs: Christopher Quinn (University of Illinois at Urbana-Champaign, USA); Negar Kiyavash (University of Illinois at Urbana-Champaign, USA); Todd P Coleman (University of California, San Diego, USA)
11:50 Deinterleaving Markov Processes: The Finite-Memory Switch Case: Gadiel Seroussi (Hewlett-Packard Laboratories, USA); Wojciech Szpankowski (Purdue University, USA); Marcelo Weinberger (Hewlett-Packard Laboratories, USA)
12:10 Necessary Conditions for Consistent Set-Based Graphical Model Selection: Divyanshu Vats (Carnegie Mellon University, USA); Jose Moura (Carnegie Mellon University, USA)
12:30 Generating Probability Distributions Using Multivalued Stochastic Relay Circuits: David Lee (Stanford University, USA); Jehoshua Bruck (California Institute of Technology, USA)

11:30 On the Capacity of a Channel with Action-Dependent State and Reversible Input: Kittipong Kittichokechai (Royal Institute of Technology, Sweden); Tobias J. Oechtering (Royal Institute of Technology & School of Electrical Engineering, EE, Sweden); Mikael Skoglund (Royal Institute of Technology, Sweden)
11:50 On the Optimal Power Allocation for Additive Color Noise Parallel Channels with Limited Access Constraint: Shih-Wei Wang (National Chiao Tung University, Taiwan); Po-Ning Chen (National Chiao Tung University, Taiwan); Chung-Hsuan Wang (National Chiao Tung University, Taiwan); Wen-Chieh Chang (National Chiao Tung University, Taiwan)
12:10 On the Capacity of Multiplicative Finite-Field Matrix Channels: Roberto W. Nobrega (Federal University of Santa Catarina & GPqCom, Brazil); Bartolomeu F. Uch?a-Filho (Federal University of Santa Catarina & Communications Research Group, Brazil); Danilo Silva (Federal University of Santa Catarina, Brazil)
12:30 Achievable Rates for Channels with Deletions and Insertions: Ramji Venkataramanan (Yale University, USA); Sekhar Tatikonda (Yale University, USA); Kannan Ramchandran (University of California at Berkeley, USA)

11:30 Worst-Case Linear Transmit Strategies with Limited Relay Information in Gaussian Relay Networks: Steven Corroy (RWTH Aachen University, Germany); Rudolf Mathar (RWTH Aachen University, Germany)
11:50 The Approximate Capacity of the Gaussian N-Relay Diamond Network: Urs Niesen (Bell Labs, Alcatel-Lucent, USA); Suhas Diggavi (University of California Los Angeles, USA)
12:10 Relay-Aided Interference Neutralization for the Multiuser Uplink-Downlink Asymmetric Setting: Jinyuan Chen (Eurecom, France); Petros Elia (EURECOM, France); Raymond Knopp (Institut Eurecom, France)
12:30 Channel Capacities of Parallel and Serial Modulo-Sum Relay Networks: Youvaraj Sagar (Wichita State University, USA); Jie Yang (Wichita State University, USA); Hyuck Kwon (Wichita State University, USA)

11:30 High-Rate Maximum Runlength Constrained Coding Schemes Using Nibble Replacement: Kornelis A. Schouhamer Immink (Turing Machines Inc. & Institute for Experimental Mathematics, The Netherlands)
11:50 Balanced Runlength Limited Codes Using Knuth's Algorithm: Kornelis A. Schouhamer Immink (Turing Machines Inc. & Institute for Experimental Mathematics, The Netherlands); Jos H. Weber (Delft University of Technology, The Netherlands); Hendrik C Ferreira (University of Johannesburg, South Africa)
12:10 Constant Weight Codes: An Approach Based on Knuth's Balancing Method: Vitaly Skachek (University of Illinois at Urbana-Champaign, USA); Kornelis A. Schouhamer Immink (Turing Machines Inc. & Institute for Experimental Mathematics, The Netherlands)
12:30 Majority Group Testing with Density Tests: Rudolf Ahlswede (University of Bielefeld, Germany); Christian Deppe (University of Bielefeld, Germany); Vladimir Lebedev (Russian Academy of Sciences, Russia)

11:30 Network Flows for Functions: Virag Shah (University of Texas at Austin, USA); Bikash K Dey (Indian Institute of Technology Bombay, India); D. Manjunath (IIT Bombay, India)
11:50 Proactive Multicasting with Predictable Demands: John Tadrous (Ohio State University, USA); Atilla Eryilmaz (Ohio State University, USA); Hesham El Gamal (Ohio State University, USA)
12:10 On the Complementary Index Coding Problem: Mohammad Asad Rehman Chaudhry (Texas A&M University, USA); Zakia Asad (Texas A&M University, USA); Alex Sprintson (Texas A&M University, USA); Michael Langberg (Open University of Israel, Israel)
12:30 On File Sharing Over a Wireless Social Network: Yi-Ting Chen (The University of Taxas at Austin, USA); Constantine Caramanis (The University of Texas at Austin, USA); Sanjay Shakkottai (The University of Texas at Austin, USA)

11:30 Prediction of Priors for Communication Over Arbitrarily Varying Channels: Yuval Lomnitz (Tel Aviv University, Israel); Meir Feder (Tel-Aviv University, Israel)
11:50 Finite-Memory Least Squares Universal Prediction of Individual Continuous Sequences: Ronen Dar (Tel-Aviv University, Israel); Meir Feder (Tel-Aviv University, Israel)
12:10 Universal Communication Over Modulo-Additive Individual Noise Sequence Channels: Yuval Lomnitz (Tel Aviv University, Israel); Meir Feder (Tel-Aviv University, Israel)

11:30 The Degrees of Freedom Region of the Two-User MIMO Broadcast Channel with Delayed CSIT: Chinmay Vaze (University of Colorado at Boulder, USA); Mahesh Kumar Varanasi (University of Colorado, USA)
11:50 On the Degrees of Freedom of the Cognitive Broadcast Channel: Mohammad Shahmohammadi (Ohio State University, USA); Onur Ozan Koyluoglu (The University of Texas at Austin, USA); Tamer Khattab (Qatar University, Qatar); Hesham El Gamal (Ohio State University, USA)
12:10 On the Degrees of Freedom of Three-User MIMO Broadcast Channel with Delayed CSIT: Mohammad Javad Abdoli (University of Waterloo, Canada); Akbar Ghasemi (U-Waterloo, Canada); Amir K. Khandani (University of Waterloo, Canada)
12:30 Sum Degrees-of-Freedom of Two-Unicast Wireless Networks: Ilan Shomorony (Cornell University, USA); Amir S. Avestimehr (Cornell University, USA)

14:20 Asymptotic Estimation of Error Fraction Corrected by Binary LDPC Code: Pavel Rybin (IITP RAS, Russia); Victor V. Zyablov (Institute for Information Transmission Problems (IITP) RAS, Russia)
14:40 Near Concavity of the Growth Rate for Coupled LDPC Chains: S. Hamed Hassani (EPFL, Switzerland); Nicolas Macris (EPFL, Switzerland); Ryuhei Mori (Kyoto University, Japan)
15:00 A Reliability-Based Computation Method for the Weight Distribution of LDPC Codes Using the Probabilistic Algorithm: Masanori Hirotomo (Kobe University, Japan); Masami Mohri (Gifu University, Japan); Masakatu Morii (Kobe University, Japan)
15:20 A Transform Approach for Computing the Ranks of Parity-Check Matrices of Quasi-Cyclic LDPC Codes: Qiuju Diao (Xidian University, P.R. China); Qin Huang (University of California, Davis, USA); Shu Lin (UC Davis, USA); Khaled Abdel-Ghaffar (University of California, USA)

14:20 Entanglement Boosts Quantum Turbo Codes: Mark Wilde (Mc Gill University, Canada); Min-Hsiu Hsieh (Statistical Laboratory, University of Cambridge, United Kingdom)
14:40 Examples of Minimal-Memory, Non-Catastrophic Quantum Convolutional Encoders: Mark Wilde (Mc Gill University, Canada); Monireh Houshmand (Ferdowsi University of Mashhad, Iran); Saied Hosseini-Khayat (Ferdowsi University of Mashhad, Iran)
15:00 Quantum Gilbert-Varshamov Bound Through Symplectic Self-Orthogonal Codes: Lingfei Jin (Nanyang Technological University, Singapore); Chaoping Xing (Nanyang Technological University, Singapore)

14:20 Optimal Quantization for Compressive Sensing Under Message Passing Reconstruction: Ulugbek S. Kamilov (EPFL, Switzerland); Vivek K Goyal (Massachusetts Institute of Technology, USA); Sundeep Rangan (Polytechnic University of New York University, USA)
14:40 A Game Theoretic Approach to Expander-Based Compressive Sensing: Sina Jafarpour (Computer Science, Princeton University, USA); Volkan Cevher (Ecole Polytechnique Federale de Lausanne, Switzerland); Robert Schapire (Princeton University, USA)
15:00 Explicit Matrices for Sparse Approximation: Amin Khajehnejad (Caltech, USA); Arash Saber Tehrani (University of Southern California, USA); Alex Dimakis (University of Southern California, USA); Babak Hassibi (California Institute of Technology, USA)
15:20 Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressed Sensing: Yaser Eftekhari (Carleton University, Canada); Anoosheh Heidarzadeh (Carleton University, Canada); Amir Banihashemi (Carleton University, Canada); Ioannis Lambadaris (Carleton University, Canada)

14:20 A New Bound on the Capacity of the Binary Deletion Channel with High Deletion Probabilities: Marco Dalai (University of Brescia, Italy)
14:40 On the Equivalence of Shannon Capacity and Stable Capacity in Networks with Memoryless Channels: Hongyi Yao (California Institute of Technology, USA); Tracey Ho (California Institute of Technology, USA); Michelle Effros (California Institute of Technology, USA)
15:00 Channel Coding Theorem for the Number of Guesses in Decoding: Hirosuke Yamamoto (The University of Tokyo, Japan); Keishi Okudera (Mitsui Life Insurance Co. Ltd., Japan)
15:20 Capacity of Gaussian Channels with Duty Cycle and Power Constraints: Lei Zhang (Northwestern University, USA); Dongning Guo (Northwestern University, USA)

14:20 Rate-Limited Transmitter-Cooperation in Wyner's Asymmetric Interference Network: Shlomo Shamai (The Technion, Israel); Michele A Wigger (Telecom ParisTech, France)
14:40 Interference, Cooperation and Connectivity - a Degrees of Freedom Perspective: Chenwei Wang (University of California, Irvine, USA); Syed Ali Jafar (University of California Irvine, USA); Shlomo Shamai (The Technion, Israel); Michele A Wigger (Telecom ParisTech, France)
15:00 Interference Networks with Point-to-Point Codes: Francois Baccelli (INRIA-ENS, France); Abbas El Gamal (Stanford University, USA); David Tse (University of California at Berkeley, USA)
15:20 On Completing the Degrees of Freedom Characterization of MIMO Interference Networks with No CSIT: Chinmay Vaze (University of Colorado at Boulder, USA); Mahesh Kumar Varanasi (University of Colorado, USA)

14:20 Analysis of Alternative Metrics for the PAPR Problem in OFDM Transmission: Gerhard Wunder (Heinrich-Hertz-Institut, Germany)
14:40 On the EVM of Sequences: Igal Kotzer (Tel Aviv University, Israel); Smadar Har-Nevo (Tel Aviv University, Israel); Sasha Sodin (IAS, Princeton, USA); Simon Litsyn (Tel Aviv University, Israel)
15:00 Improved Lower Bound for Quasi-Complementary Sequence Set: Zi Long Liu (Nanyang Technological University, Singapore); Yong Liang Guan (Nanyang Technological University, Singapore); Wai Ho Mow (Hong Kong University of Science and Technology & HKUST, Hong Kong)
15:20 On the Relative Abundance of Nonbinary Sequences with Perfect Autocorrelations: Serdar Boztas (RMIT University, Australia); Parampalli Udaya (University of Melbourne, Australia)

14:20 A Graph Theoretical Approach for Network Coding in Wireless Body Area Networks: Eimear Byrne (University College Dublin, Ireland); Akiko Manada (University College Dublin, Ireland); Stevan Marinkovic (University College Cork, Ireland); Emanuel M. Popovici (University College Cork, Ireland)
14:40 Deterministic Algorithm for the Cooperative Data Exchange Problem: Nebojsa Milosavljevic (University of California at Berkeley, USA); Sameer Pawar (University of California, Berkeley, USA); Salim El Rouayheb (University of California, Berkeley, USA); Michael Gastpar (University of California, Berkeley, USA); Kannan Ramchandran (University of California at Berkeley, USA)
15:00 Inverse Compute-and-Forward: Extracting Messages from Simultaneously Transmitted Equations: Yiwei Song (University of Illinois at Chicago, USA); Natasha Devroye (University of Illinois at Chicago, USA); Bobak Nazer (Boston University, USA)
15:20 Joint Source-Network Coding for Large-Scale Sensor Networks: Susana Cruz (University of Porto, Portugal); Gerhard Maierbacher (University of Porto, Portugal); Joao Barros (University of Porto & Instituto de Telecomunica??es, Portugal)

14:20 Bounds on Rate Distortion with Feed Forward for Stationary and Ergodic Sources: Iddo Naiss (Ben Gurion University, Israel); Haim H Permuter (Ben-Gurion University, Israel)
14:40 Stochastic Interpretation of Universal Portfolio and Generalized Target Classes: Mariko Tsurusaki (Kyushu University, Japan); Jun'ichi Takeuchi (Kyushu University, Japan)
15:00 A Strong Converse in Source Coding for Super-Source Networks: WeiHsin Gu (Oracle, USA); Michelle Effros (California Institute of Technology, USA)
15:20 Algebraic Computation of Pattern Maximum Likelihood: Jayadev Acharya (University of California, San Diego, USA); Hirakendu Das (University of California San Diego, USA); Alon Orlitsky (University of California, San Diego, USA); Shengjun Pan (University of California, San Diego, USA)

14:20 Joint Pilot and Precoder Design for Optimal Throughput: Adriano Pastore (Universitat Polit?cnica de Catalunya, Spain); Michael Joham (Technische Universit?t M?nchen, Germany); Javier R. Fonollosa (Universitat Polit?cnica de Catalunya - Barcelona Tech (UPC), Spain)
14:40 Interference Focusing for Simplified Optical Fiber Models with Dispersion: Hassan Ghozlan (University of Southern California, USA); Gerhard Kramer (Technische Universit?t M?nchen, Germany)
15:00 Modeling and Information Rates for Synchronization Error Channels: Aravind R. Iyengar (University of California, San Diego, USA); Paul H. Siegel (University of California, San Diego, USA); Jack Wolf (UCSD, USA)

16:00 Array-Code Ensembles -Or- Two-Dimensional LDPC Codes: Yuval Cassuto (EPFL, Switzerland); Amin Shokrollahi (EPFL, Switzerland)
16:20 Linear Growing Minimum Distance of Ultra-Sparse Non-Binary Cluster-LDPC Codes: Valentin Savin (CEA LETI, France); David Declercq (ETIS lab. ENSEA/Cergy University/CNRS UMR, France)
16:40 Partially-Regular LDPC Codes with Linear Encoding Complexity and Improved Thresholds: Dmitri Zigangirov (Institute for information transmission problems, Russia); Kamil Zigangirov (Institute for Problems of Information Transmission, Moscow & Lund University, Sweden); Daniel J. Costello (University of Notre Dame, USA)
17:00 Block-Triangularization of Parity Check Matrices for Efficient Encoding of Linear Codes: Tomoharu Shibuya (Sophia University & Faculty of Science and Technology, Japan)

16:00 Spatially Coupled Quasi-Cyclic Quantum LDPC Codes: Manabu Hagiwara (Advanced Industrial Science and Technology, Japan); Kenta Kasai (Tokyo Institute of Technology, Japan); Hideki Imai (Chuo University, Japan); Kohichi Sakaniwa (Tokyo Institute of Technology, Japan)
16:20 A Construction of Quantum LDPC Codes from Cayley Graphs: Alain Couvreur (Universite Bordeaux 1, France); Nicolas Delfosse (Universite Bordeaux I, France); Gilles Z?mor (Universit? Bordeaux 1, France)
16:40 Quantum Cyclic Code of Length Dividing P^t+1: Sagarmoy Dutta (Indian Institute of Technology, Kanpur, India); Piyush P Kurur (IIT Kanpur, India)
17:00 Non-Binary Quasi-Cyclic Quantum LDPC Codes: Kenta Kasai (Tokyo Institute of Technology, Japan); Manabu Hagiwara (Advanced Industrial Science and Technology, Japan); Hideki Imai (Chuo University, Japan); Kohichi Sakaniwa (Tokyo Institute of Technology, Japan)

16:00 Compressive MUSIC with Optimized Partial Support for Joint Sparse Recovery: Jongmin Kim (KAIST, Korea); Okkyun Lee (KAIST, Korea); Jong Chul Ye (KAIST, Korea)
16:20 Frame Coherence and Sparse Signal Processing: Dustin G. Mixon (Princeton University, USA); Waheed U. Bajwa (Duke University, USA); Robert Calderbank (Duke University, USA)
16:40 Support-Predicted Modified-CS for Recursive Robust Principal Components' Pursuit: Chenlu Qiu (Iowa State University, USA); Namrata Vaswani (Iowa State University, USA)
17:00 Sparse Principal Component of a Rank-Deficient Matrix: Megasthenis Asteris (University of Southern California, USA); Dimitris Papailiopoulos (University of Southern California, USA); George N. Karystinos (Technical University of Crete, Greece)
17:20 General Constructions of Deterministic (S)RIP Matrices for Compressive Sampling: Arya Mazumdar (University of Maryland, College Park, USA); Alexander Barg (University of Maryland, USA)

16:00 Mutual Information, Relative Entropy, and Estimation in the Poisson Channel: Rami Atar (Technion - Israel Insistute of Technology, Israel); Tsachy Weissman (Stanford University, USA)
16:20 A Memoryless Channel Coding Methodology for Infinite-Memory Queuing Timing Channels: Christopher Li (Stanford University, USA); Tong Cheng (Unviersity of Illinois, USA); Todd P Coleman (University of California, San Diego, USA)
16:40 An Additive Exponential Noise Channel with a Transmission Deadline: Yilin Tsai (Rutgers, The State University of New Jersey, USA); Christopher Rose (WINLAB at Rutgers University, USA); Ruochen Song (WINLAB at Rutger University, USA); I. Saira Mian (LBNL, USA)
17:00 Capacity of Discrete Molecular Diffusion Channels: Arash Einolghozati (Georgia Tech, USA); Mohsen Sardari (Georgia Institute of Technology, USA); Ahmad Beirami (Georgia Institute of Technology, USA); Faramarz Fekri (Georgia Institute of Technology, USA)
17:20 Gaussian Multiple Access Channel with Compact Antenna Arrays: Michel Ivrla? (Munich University of Technology, Germany); Josef A. Nossek (Munich University of Technology, Germany)

16:00 Construction of Strongly Secure Wiretap Channel Code Based on Hash Property: Jun Muramatsu (NTT Corporation, Japan); Shigeki Miyake (NTT, Japan)
16:20 Secrecy When the Eavesdropper Controls Its Channel States: Xiang He (Pennsylvania State University, USA); Aylin Yener (Pennsylvania State University, USA)
16:40 The Secrecy Capacity Region of a Special Class of Multiple Access Channels: Nan Liu (Southeast University, P.R. China); Wei Kang (Southeast University, P.R. China)
17:00 Wiretap Channels: Roles of Rate Splitting and Channel Prefixing: Omur Ozel (University of Maryland, College Park, USA); Sennur Ulukus (University of Maryland, USA)
17:20 Achieving Secrecy: Capacity Vs. Resolvability: Matthieu Bloch (Georgia Institute of Technology & Georgia Tech Lorraine, France)

16:00 Evaluation of Cross-Correlation Values of $p$-ary M-Sequence and Its Decimated Sequence by $\frac{p^n+1}{p+1}+\frac{p^n-1}{2}$: Sung-Tai Choi (Seoul National University, Korea); Taehyung Lim (Seoul National University, Korea); Jong-Seon No (Seoul National University, Korea); Habong Chung (Hong-Ik University, Korea)
16:20 Linear Complexity for Sequences with Characteristic Polynomial $F^v$: Alex Burrage (Loughborough University, United Kingdom); Ana S?l?gean (Loughborough, United Kingdom); Raphael C.-W. Phan (Loughborough University, United Kingdom)
16:40 Constructions of Bent Functions on the Minimal Distance from the Quadratic Bent Function: Nikolay Kolomeec (Novosibirsk State University, Russia)
17:00 16-QAM Golay Complementary Sequences with New Sequence Lengths: Yen-Wen Huang (Yuan Ze University, Taiwan); Ying Li (Yuan Ze University, Taiwan)
17:20 On the Dual of the Bent Functions with 2^r Niho Exponents: Claude Carlet (University of Paris 8, France); Tor Helleseth (University of Bergen, Norway); Alexander Kholosha (University of Bergen, Norway); Sihem Mesnager (University of Paris VIII and University of Paris XIII & LAGA, France)

16:00 Computing Bounds on Network Capacity Regions as a Polytope Reconstruction Problem: Anthony Kim (Oracle America, Inc., USA); Muriel M?dard (MIT, USA)
16:20 A Dispersion Theorem for Communication Networks Based on Term Sets: Soren Riis (Queen Mary, University of London, United Kingdom); Maximilien Gadouleau (Queen Mary, University of London, United Kingdom)
16:40 Beyond the Cut Set Bound: Uncertainty Computations in Network Coding with Correlated Sources: Amin Aminzadeh Gohari (Sharif University of Technology, Iran); Shenghao Yang (The Chinese University of Hong Kong, Hong Kong); Sidharth Jaggi (Chinese University of Hong Kong, Hong Kong)
17:00 Max-Flow Min-Cut Theorem for R?nyi Entropy in Communication Networks: Maximilien Gadouleau (Queen Mary, University of London, United Kingdom); Soren Riis (Queen Mary, University of London, United Kingdom)
17:20 Algebraic Mincut-Maxflow Theorem: Se Yong Park (University of California, Berkeley, USA); Anant Sahai (UC Berkeley, USA)

16:00 Multi-User Privacy: The Gray-Wyner System and Generalized Common Information: Ravi Tandon (Princeton University, USA); Lalitha Sankar (Princeton University, USA); H. Vincent Poor (Princeton University, USA)
16:20 Malleable Coding with Fixed Segment Reuse: Julius Kusuma (Schlumberger-Doll Research, USA); Lav R. Varshney (IBM Thomas J. Watson Research Center, USA); Vivek K Goyal (Massachusetts Institute of Technology, USA)
16:40 Secure Lossy Transmission of Vector Gaussian Sources: Ersen Ekrem (University of Maryland, USA); Sennur Ulukus (University of Maryland, USA)
17:00 Minimal Public Communication for Maximum Rate Secret Key Generation: Himanshu Tyagi (University of Maryland, College Park, USA)
17:20 Efficient File Synchronization: A Distributed Source Coding Approach: Nan Ma (University of California at Berkeley, USA); Kannan Ramchandran (University of California at Berkeley, USA); David Tse (University of California at Berkeley, USA)

16:00 Mismatched CSI Outage Exponents of Block-Fading Channels: Taufiq Asyhari (University of Cambridge, United Kingdom); Albert Guill?n i F?bregas (University of Cambridge, United Kingdom)
16:20 MIMO Performance Under Covariance Matrix Feedback: Rajesh Krishnamachari (University of Colorado, USA); Mahesh Kumar Varanasi (University of Colorado, USA)
16:40 Distortion Exponent in Fading MIMO Channels with Time-Varying Side Information: I?aki Estella Aguerri (Centre Tecnol?gic de la Comunicaci? de Catalunya (CTTC), Spain); Deniz Gunduz (CTTC & Princeton University, Spain)
17:00 On Imperfect CSI for the Downlink of a Two-Tier Network: Salam Akoum (The University of Texas at Austin, USA); Marios Kountouris (Sup?lec, France); Robert Heath (The University of Texas at Austin, USA)
17:20 The Multiplexing Gain of a Two-cell MIMO Channel with Unequal CSI: Paul de Kerret (EURECOM, France); David Gesbert (Eurecom, France)

09:50 Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth: Irina Bocharova (St. Petersburg University of Information Technologies, Mechanics and Optics, Russia); Florian Hug (Lund University, Sweden); Rolf Johannesson (Lund University, Sweden); Boris Kudryashov (St. Petersburg University of Information Technology, Mechanics and Optics, Russia); Roman Satyukov (, Russia)
10:10 A Simple Method to Construct LDPC Codes Based on Projective Planes: Sergei Kovalev (State University on Aerospace Instrumentation, Russia); Victor Krachkovsky (LSI Corporation, USA)
10:30 Interleaved LDPC Codes, Reduced-Complexity Inner Decoder and an Iterative Decoder for the Davey-MacKay Construction: Xiaopeng Jiao (National University of Singapore, Singapore); Marc Armand (National University of Singapore, Singapore)
10:50 Spatially-Coupled MacKay-Neal Codes and Hsu-Anastasopoulos Codes: Kenta Kasai (Tokyo Institute of Technology, Japan); Kohichi Sakaniwa (Tokyo Institute of Technology, Japan)

09:50 Erasure-Only List Decoding of Reed-Solomon and BCH Codes with Applications to Their Product Codes: Yingquan Wu (Link-A-Media Devices Corp., USA)
10:10 On the Decoding Complexity of Cyclic Codes Up to the BCH Bound: Davide Schipani (University of Zurich, Switzerland); Michele Elia (Politecnico di Torino, Italy); Joachim Rosenthal (University of Zurich, Switzerland)
10:30 Minimal List Decoding of Reed-Solomon Codes Using a Parameterization of Gr?bner Bases: Mortuza Ali (University of Melbourne, Australia); Margreta Kuijper (University of Melbourne, Australia)
10:50 Optimal Threshold-Based Multi-Trial Error/Erasure Decoding with the Guruswami-Sudan Algorithm: Christian Senger (Ulm University, Germany); Vladimir Sidorenko (University of Ulm, Germany); Martin Bossert (University of Ulm, Germany); Victor V. Zyablov (Institute for Information Transmission Problems (IITP) RAS, Russia)

09:50 Neural Pre-Coding Increases the Pattern Retrieval Capacity of Hopfield and Bidirectional Associative Memories: Amir Hesam Salavati (Ecole Polytechnique F?d?rale de Lausanne, Switzerland); K. Raj Kumar (Ecole Polytechnique F?d?rale de Lausanne, Switzerland); Amin Shokrollahi (EPFL, Switzerland); Wulfram Gerstner (Ecole Polytechnique F?d?rale de Lausanne, Switzerland)
10:10 Information Theoretic Limits on Learning Stochastic Differential Equations: Jose Bento (Stanford University, USA); Morteza Ibrahimi (Stanford University, USA); Andrea Montanari (Stanford University, USA)
10:30 Radial Basis Function Networks with Optimal Kernels: Adam Krzyzak (Concordia University, Canada)
10:50 Combined Waveform-Cepstral Representation for Robust Speech Recognition: Matthew Ager (King's College London, United Kingdom); Zoran Cvetkovi? (King's College London, United Kingdom); Peter Sollich (King's College London, United Kingdom)

09:50 An Improvement to the Haroutunian Bound for Anytime Coding Systems: Hari Palaiyanur (University of California, Berkeley, USA); Anant Sahai (UC Berkeley, USA)
10:10 On R?nyi Measures and Hypothesis Testing: Ofer Shayevitz (UCSD, USA)
10:30 Random-Coding Joint Source-Channel Bounds: Adri? Tauste (University of Cambridge, United Kingdom); Gonzalo Vazquez-Vilar (University of Vigo, Spain); Albert Guill?n i F?bregas (University of Cambridge, United Kingdom); Alfonso Martinez (University of Cambridge, United Kingdom)
10:50 Maximization of the Information Divergence from an Exponential Family and Criticality: Frantisek Mat?? (Academy of Sciences of the Czech Republic & Institute of Information Theory and Automation, Czech Republic); Johannes Rauh (Max Planck Institute for Mathematics in the Sciences, Germany)

09:50 Accessible Capacity of Secondary Users Over the Gaussian Interference Channel: Xiujie Huang (Sun Yat-sen Universtiy, P.R. China); Xiao Ma (Sun Yat-sen University, P.R. China); Lei Lin (Sun Yat-sen University, P.R. China); Bao-Ming Bai (Xidian University, P.R. China)
10:10 Cooperation in Multiple Access Channels in the Presence of Partial State Information: Haim H Permuter (Ben-Gurion University, Israel); Shlomo Shamai (The Technion, Israel); Anelia Somekh-Baruch (Bar-Ilan University, USA)
10:30 On Throughput and Delay Scaling with Cooperative Spectrum Sharing: Yang Han (Nanyang Technological University, Singapore); See Ho Ting (Nanyang Technological University, Singapore); Mehul Motani (National University of Singapore, Singapore); Ashish Pandharipande (Philips Research Laboratories, The Netherlands)
10:50 Cooperative Computation in Wireless Networks: Matthew Nokleby (Rice University, USA); Behnaam Aazhang (Rice University, USA)

09:50 Constructions of Rank Modulation Codes: Arya Mazumdar (University of Maryland, College Park, USA); Alexander Barg (University of Maryland, USA); Gilles Z?mor (Universit? Bordeaux 1, France)
10:10 Generalized Gray Codes for Local Rank Modulation: Eyal En Gad (California Institute of Technology, USA); Michael Langberg (Open University of Israel, Israel); Moshe Schwartz (Ben-Gurion University of the Negev, Israel); Jehoshua Bruck (California Institute of Technology, USA)
10:30 On the Labeling Problem of Permutation Group Codes Under the Infinity Metric: Itzhak Tamo (Electrical Engineering Department, California Institute of Technology & Electrical and Computer Engineering, Ben-Gurion University, USA); Moshe Schwartz (Ben-Gurion University of the Negev, Israel)
10:50 Compressed Encoding for Rank Modulation: Eyal En Gad (California Institute of Technology, USA); Anxiao Andrew Jiang (Texas A&M University, USA); Jehoshua Bruck (California Institute of Technology, USA)

09:50 Opportunities for Network Coding: To Wait or Not to Wait: Yu-Pin Hsu (Texas A&M University, USA); Navid Abedini (Texas A&M University, USA); Solairaja Ramasamy (Texas A&M University, USA); Natarajan Gautam (Texas A&M University, USA); Alex Sprintson (Texas A&M University, USA); Srinivas Shakkottai (Texas A&M University, USA)
10:10 Energy-Delay Considerations in Coded Packet Flows: Daniel E. Lucani (University of Porto - School of Engineering & Institute of Telecommunications, Portugal); Joerg Kliewer (New Mexico State University, USA)
10:30 Analysis of Overlapped Chunked Codes with Small Chunks Over Line Networks: Anoosheh Heidarzadeh (Carleton University, Canada); Amir Banihashemi (Carleton University, Canada)
10:50 Index Coding with Outerplanar Side Information: Yossi Berliner (Open University of Israel, Israel); Michael Langberg (Open University of Israel, Israel)

09:50 Bounds for Joint Source-Channel Coding At High SNR: Sergey Tridenski (Tel Aviv University, Israel); Ram Zamir (Tel Aviv University, Israel)
10:10 An Achievable Rate Region for Distributed Source Coding and Dispersive Information Routing: Kumar Viswanatha (UCSB, USA); Emrah Akyol (UCSB, USA); Kenneth Rose (University of California, Santa Barbara, USA)
10:30 Joint Source-Channel Coding Via Hybrid Coding: Paolo Minero (University of Notre Dame, USA); Sung Hoon Lim (KAIST, Korea); Young-Han Kim (UCSD, USA)
10:50 Communicating Remote Gaussian Sources Over Gaussian Multiple Access Channels: Amos Lapidoth (ETHZ, Switzerland); I-Hsiang Wang (University of California at Berkeley, USA)

09:50 Wideband Slope in Interference Channels with Imperfect CSI At Transmitters: Minqi Shen (University of Hawaii, USA); Anders H?st-Madsen (University of Hawaii, USA)
10:10 On the Generalized Degrees of Freedom Region of the MIMO Interference Channel with No CSIT: Chinmay Vaze (University of Colorado at Boulder, USA); Sanjay Karmakar (University Of Colorado at Boulder, USA); Mahesh Kumar Varanasi (University of Colorado, USA)
10:30 On the Throughput of Wireless Interference Networks with Limited Feedback: Hamed Farhadi (Royal Institute of Technology (KTH), Sweden); Chao Wang (Royal Institute of Technology (KTH), Sweden); Mikael Skoglund (Royal Institute of Technology, Sweden)
10:50 On the Degrees of Freedom of X Channel with Delayed CSIT: Akbar Ghasemi (U-Waterloo, Canada); Abolfazl Motahari (University of Waterloo, Canada); Amir K. Khandani (University of Waterloo, Canada)

11:30 Design of Irregular Quasi-Cyclic Protograph Codes with Low Error Floors: Reza Asvadi (K. N. Toosi University of Technology, Iran); Amir Banihashemi (Carleton University, Canada); Mahmoud Ahmadian (K.N. Toosi University of Technology, Iran)
11:50 Enumerators for Protograph-Based Ensembles of Nonbinary LDPC Codes: Dariush Divsalar (Jet Propulsion Laboratory, USA); Lara Dolecek (UCLA, USA)
12:10 Protograph Design with Multiple Edges for Regular QC LDPC Codes Having Large Girth: Hosung Park (Seoul National University, Korea); Seokbeom Hong (Seoul National University, Korea); Jong-Seon No (Seoul National University, Korea); Dong-Joon Shin (Hanyang University, Korea)
12:30 Double-Hamming Based QC LDPC Codes with Large Minimum Distances: Irina Bocharova (St. Petersburg University of Information Technologies, Mechanics and Optics, Russia); Florian Hug (Lund University, Sweden); Rolf Johannesson (Lund University, Sweden); Boris Kudryashov (St. Petersburg University of Information Technology, Mechanics and Optics, Russia)

11:30 Solving the Key Equation for Hermitian Codes with a Division Algorithm: Sabine Kampf (Ulm University, Germany); Martin Bossert (University of Ulm, Germany); Irene Bouw (Ulm University, Germany)
11:50 A Concatenated Coding Scheme Based on Folded Reed-Solomon Codes: Peter Trifonov (Saint-Petersburg State Polytechnic University, Russia); Moon Ho Lee (Chonbuk National University, Korea)
12:10 Efficient Decoding of Some Classes of Binary Cyclic Codes Beyond the Hartmann-Tzeng Bound: Alexander Zeh (University of Ulm, Germany); Antonia Wachter (Ulm University, Germany); Sergey Bezzateev (Saint-Petersburg Aerospace Instrumentation University, Russia)
12:30 On a Fast Decoding of Multipoint Codes from Algebraic Curves: Masaya Fujisawa (Tokyo University of Science, Japan); Shojiro Sakata (University of Electro-Communications, Japan)

11:30 Mixture Density Estimation Via Hilbert Space Embedding of Measures: Bharath Sriperumbudur (Gatsby Computational Neuroscience Unit, University College London, United Kingdom)
11:50 Efficient Computation of Normalized Maximum Likelihood Coding for Gaussian Mixtures with Its Applications to Optimal Clustering: So Hirai (The University of Tokyo, Japan); Kenji Yamanishi (The University of Tokyo, Japan)
12:10 Selecting the Rank of Truncated SVD by Maximum Approximation Capacity: Mario Frank (ETH Zurich, Switzerland); Joachim Buhmann (ETH Zurich, Switzerland)
12:30 Discrete Denoising of Heterogeneous Two-Dimensional Data: Taesup Moon (Yahoo! Labs, USA); Tsachy Weissman (Stanford University, USA); Jae-Young Kim (Stanford University, USA)

11:30 On Reliability of Content Identification from Databases Based on Noisy Queries: Gautam Dasarathy (University of Wisconsin - Madison, USA); Stark C Draper (University of Wisconsin, USA)
11:50 Error Exponents in Asynchronous Communication: Da Wang (Massachusetts Institute of Technology, USA); Venkat Chandar (MIT, USA); Sae-Young Chung (KAIST, Korea); Gregory Wornell (Massachusetts Institute of Technology, USA)
12:10 Constrained Wyner-Ziv Coding: Amos Lapidoth (ETHZ, Switzerland); Andreas Mal?r (ETH Zurich, Switzerland); Michele A Wigger (Telecom ParisTech, France)
12:30 The Degrees of Freedom of Compute-and-Forward: Urs Niesen (Bell Labs, Alcatel-Lucent, USA); Phil Whiting (Bell Labs, Lucent Technologies, USA)

11:30 Coding Theorems for Random Access Communication Over Compound Channel: Zheng Wang (Colorado State University, USA); Jie Luo (Colorado State University, USA)
11:50 The Arbitrarily Varying Multiple-Access Channel with Conferencing Encoders: Moritz Wiese (Technische Universit?t M?nchen, Germany); Holger Boche (Technical University Munich, Germany)
12:10 Implicit Communication in Multiple-Access Settings: Gireeja Ranade (University of California, Berkeley, USA); Anant Sahai (UC Berkeley, USA)
12:30 Improving the MAC Error Exponent Using Distributed Structure: Eli Haim (Tel-Aviv University, Israel); Yuval Kochman (Massachusetts Institute of Technology, USA); Uri Erez (Tel Aviv University, Israel)

11:30 Nonuniform Codes for Correcting Asymmetric Errors: Hongchao Zhou (California Institute of Technology, USA); Anxiao Andrew Jiang (Texas A&M University, USA); Jehoshua Bruck (California Institute of Technology, USA)
11:50 Reed-Muller Codes, Elementary Symmetric Functions and Asymmetric Error Correction: Luca G. Tallini (Universit? di Teramo, Italy); Bella Bose (Oregon State University, USA)
12:10 On Codes That Correct Asymmetric Errors with Graded Magnitude Distribution: Eitan Yaakobi (University of California, San Diego, USA); Paul H. Siegel (University of California, San Diego, USA); Alexander Vardy (University of California, San Diego, USA); Jack Wolf (UCSD, USA)
12:30 On L1-Distance Error Control Codes: Luca G. Tallini (Universit? di Teramo, Italy); Bella Bose (Oregon State University, USA)

11:30 The Capacity Region of a Class of 3-Receiver Broadcast Channels with Two Eavesdroppers: Sadaf Salehkalaibar (Sharif University of Technology, Iran); Mohammad Reza Aref (Sharif University of Tech., Iran)
11:50 On Equivalence for Networks of Noisy Channels Under Byzantine Attacks: Mayank Bakshi (California Institute of Technology, USA); Michelle Effros (California Institute of Technology, USA); Tracey Ho (California Institute of Technology, USA)
12:10 The Hidden Flow of Information: Chung Chan (The Chinese University of Hong Kong, Hong Kong)
12:30 On Secure Index Coding with Side Information: Hoang Dau (Nanyang Technological University, Singapore); Vitaly Skachek (University of Illinois at Urbana-Champaign, USA); Yeow Meng Chee (Nanyang Technological University, Singapore)

11:30 Cliff Effect Suppression Through Multiple-Descriptions with Split Personality: Silvija Kokalj-Filipovi? (Bell Labs, Alcatel-Lucent, USA); Emina Soljanin (Bell Labs, Alcatel - Lucent, USA); Yang Gao (University of California, Riverside, USA)
11:50 Compression with Graphical Constraints: An Interactive Browser: Amin Karbasi (EPFL, Switzerland); Morteza Zadimoghaddam (Massachusett Institute of Technology, USA)
12:10 Energy-Optimized Lossless Compression: Rate-Variability Tradeoff: Yihong Wu (Princeton University, USA); Erik Ordentlich (Hewlett-Packard Laboratories, USA); Marcelo Weinberger (Hewlett-Packard Laboratories, USA)
12:30 Delay-Optimal Scheduling for Cooperative Networks: Ying Cui (HKUST, Hong Kong); Vincent Lau (The university of science and Technology, Hong Kong); Edmund Yeh (Yale University, USA)

11:30 Efficient Beamforming Algorithms for MIMO Multicast with Application-Layer Coding: Michal Kaliszan (Technische Universit?t Berlin, Germany); Emmanuel Pollakis (Fraunhofer Heinrich Hertz Institute, Germany); Slawomir Sta?czak (Fraunhofer Heinrich Hertz Institute, Germany)
11:50 Coordination Limits in MIMO Networks: Ali Tajer (Princeton University, USA); Xiaodong Wang (Columbia University, USA); H. Vincent Poor (Princeton University, USA)
12:10 SINR Distribution of MIMO MMSE Receiver: Aris Moustakas (University of Athens, Greece)
12:30 Encoding of Multivariate Stimuli with MIMO Neural Circuits: Aurel A. Lazar (Columbia University, USA); Eftychios A. Pnevmatikakis (Columbia University, USA)

15:00 Trapping Sets of Structured LDPC Codes: Qin Huang (University of California, Davis, USA); Qiuju Diao (Xidian University, P.R. China); Shu Lin (UC Davis, USA); Khaled Abdel-Ghaffar (University of California, USA)
15:20 An Efficient Algorithm for Finding Dominant Trapping Sets of Irregular LDPC Codes: Mehdi Karimi (Carleton University, Canada); Amir Banihashemi (Carleton University, Canada)
15:40 Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes: David Mitchell (University of Notre Dame, USA); Ali E. Pusane (Bogazici University, Turkey); Michael Lentmaier (Dresden University of Technology, Germany); Daniel J. Costello (University of Notre Dame, USA)
16:00 Analysis of Stopping Constellation Distribution for Irregular Non-Binary LDPC Code Ensemble: Takayuki Nozaki (Tokyo Institute of Technology, Japan); Kenta Kasai (Tokyo Institute of Technology, Japan); Kohichi Sakaniwa (Tokyo Institute of Technology, Japan)

15:00 Use of Gray Codes for Optimizing the Search of (Shortened) Cyclic Single Burst-Correcting Codes: Javier Garc?a Villalba (Universidad Complutense de Madrid, Spain); Jose Fuentes (Universidad Complutense of Madrid, Spain); Ana Lucila Sandoval Orozco (Universidad Complutense de Madrid, Spain); Mario Blaum (IBM Almaden Research Center, USA)
15:20 On Irreducible Polynomial Remainder Codes: Jiun-Hung Yu (ETH Zurich, Switzerland); Hans-Andrea Loeliger (ETH Zurich, Switzerland)
15:40 Rank Minimization Over Finite Fields: Vincent Tan (University of Wisconsin-Madison, USA); Laura Balzano (University of Wisconsin-Madison, USA); Stark C Draper (University of Wisconsin, USA)
16:00 The Discrete Fourier Transform Over a Finite Field with Reduced Multiplicative Complexity: Sergei V. Fedorenko (St. Petersburg State University of Aerospace Instrumentation, Russia)

15:00 k-Nearest Neighbor Estimation of Entropies with Confidence: Kumar Sricharan (University of Michigan, Ann Arbor, USA); Raviv Raich (Oregon State University, USA); Alfred Hero iii (University of Michigan, USA)
15:20 Statistical Decision by Using Quantized Observations: R?mi Cogranne (University of Technology of Troyes & Educational, France); Cathel Zitzmann (UTT, France); Lionel Fillatre (Universit? de Technologie de Troyes, France); Florent Retraint (UTT, France); Igor Nikiforov (Universit? de Technologie de Troyes, UTT/STMR/LM2S & UMR CNRS 6279, France); Philippe Cornu (ICD - LM2S - UTT UMR STMR CNRS, France)
15:40 A New Method for Variable Elimination in Systems of Inequations: Farhad Shirani Chaharsooghi (Sharif University of Technology Iran, Iran); Mohammad Javad Emadi (Sharif University of Technology, Iran); Mahdi Zamanighomi (Sharif University of Technology Iran, Iran); Mohammad Reza Aref (Sharif University of Tech., Iran)
16:00 Shannon Meets Blackwell and Le Cam: Channels, Codes, and Statistical Experiments: Maxim Raginsky (Duke University, USA)

15:00 Secrecy Games on the One-Sided Interference Channel: Jianwei Xie (University of Maryland, USA); Sennur Ulukus (University of Maryland, USA)
15:20 A Potential Function View of Information Theoretic Interference Games: Suvarup Saha (Northwestern University, USA); Randall Berry (Northwestern University, USA)
15:40 Information Theoretic Analysis of Side Channel Information Leakage in FCFS Schedulers: Xun Gong (University of Illinois at Urbana-Champaign, USA); Negar Kiyavash (University of Illinois at Urbana-Champaign, USA); Parv Venkitasubramaniam (Lehigh University, USA)
16:00 A Non-Linear Model of Limit Order Book Dynamics: Nikita Vvedenskaya (IITP, Russia); Yuri Suhov (University of Cambridge & Universidade de Sao Paulo, United Kingdom); Vladimir Belitsky (University of Sao Paulo, Brazil)

15:00 K-User Interference Channels: General Outer Bound and Sum-Capacity for Certain Gaussian Channels: Daniela Tuninetti (University of Illinois at Chicago, USA)
15:20 On the Capacity of the $k$-User Cyclic Gaussian Interference Channel: Lei Zhou (University of Toronto, Canada); Wei Yu (University of Toronto, Canada)
15:40 An Alternative to Decoding Interference or Treating Interference as Gaussian Noise: Kamyar Moshksar (University of Waterloo, Canada); Akbar Ghasemi (U-Waterloo, Canada); Amir K. Khandani (University of Waterloo, Canada)
16:00 The Capacity Region of the Symmetric Gaussian Interference Channel with Common Information to within a Constant Gap: Chinmay Vaze (University of Colorado at Boulder, USA); Mahesh Kumar Varanasi (University of Colorado, USA)

15:00 Permutation Code: Optimal Exact-Repair of a Single Failed Node in MDS Code Based Distributed Storage Systems: Viveck R Cadambe (University of California, Irvine, USA); Cheng Huang (Microsoft Research, USA); Jin Li (Microsoft Research, USA)
15:20 Distributed Storage Codes Through Hadamard Designs: Dimitris Papailiopoulos (University of Southern California, USA); Alex Dimakis (University of Southern California, USA)
15:40 Enabling Node Repair in Any Erasure Code for Distributed Storage: K. V. Rashmi (Indian Institute of Science, India); Nihar B Shah (Indian Institute of Science, India); P Vijay Kumar (Indian Institute of Science & University of Southern California, India)
16:00 MDS Array Codes with Optimal Rebuilding: Itzhak Tamo (Electrical Engineering Department, California Institute of Technology & Electrical and Computer Engineering, Ben-Gurion University, USA); Zhiying Wang (California Institute of Technology, USA); Jehoshua Bruck (California Institute of Technology, USA)

15:00 Network Localized Error Correction: For Non-Coherent Coding: Ning Cai (Xidian University, P.R. China)
15:20 One Packet Suffices - Highly Efficient Packetized Network Coding with Finite Memory: Bernhard Haeupler (MIT, USA); Muriel M?dard (MIT, USA)
15:40 Localized Dimension Growth in Random Network Coding: A Convolutional Approach: Wangmei Guo (Xidian University, P.R. China); Ning Cai (Xidian University, P.R. China); Xiaomeng Shi (MIT, USA); Muriel M?dard (MIT, USA)
16:00 Generation of Innovative and Sparse Encoding Vectors for Broadcast Systems with Feedback: Ho Yuet Kwan (City University of Hong Kong, Hong Kong); Kenneth W. Shum (Institute of Network Coding, Hong Kong); Chi Wan Sung (City University of Hong Kong, Hong Kong)

15:00 Data Compression in Multiterminal Statistical Inference: Shun-ichi Amari (RIKEN Brain Science Institute, Japan)
15:20 Lossless Coding with Generalized Criteria: Themistoklis Charalambous (University of Cyprus, Cyprus); Charalambos D Charalambous (University of Cyprus, Cyprus); Farzad Rezaei (Unemployed, Canada)
15:40 Joint Source-Channel Coding with Correlated Interference: Yu-Chih Huang (Texas A&M University, USA); Krishna Narayanan (Texas A&M University, USA)
16:00 Secure Lossy Source-Channel Wiretapping with Side Information At the Receiving Terminals: Joffrey Villard (SUPELEC, France); Pablo Piantanida (SUPELEC, France); Shlomo Shamai (The Technion, Israel)

15:00 Decoding by Embedding: Correct Decoding Radius and DMT Optimality: Cong Ling (Imperial College London, United Kingdom); Shuiyin Liu (Imperial College London, United Kingdom); Laura Luzzi (Sup?lec, France); Damien Stehl? (CNRS/ENS Lyon Laboratoire LIP, France)
15:20 Streaming Data Over Fading Wireless Channels: The Diversity-Multiplexing Tradeoff: Ashish Khisti (University of Toronto, Canada); Stark C Draper (University of Wisconsin, USA)
15:40 Improving the DMT Performances of MIMO Linear Receivers: Ti-wen Tang (National Chiao Tung University, Taiwan); Min-Kun Chen (National Chiao Tung University, Taiwan); Hsiao-feng Francis Lu (National Chiao Tung University, Taiwan)
16:00 The Diversity of MMSE Receiver Over Frequency-Selective MIMO Channel: Ahmed Hesham Mehana (University of Texas at Dallas, USA); Aria Nosratinia (University of Texas, Dallas, USA)

16:40 Efficient Methods for Bounding the Fractional Distance of LDPC Codes and Obtaining Fundamental Polytopes of Nonbinary and Generalized Codes: David Burshtein (Tel Aviv University, Israel); Idan Goldenberg (Tel Aviv University, Israel)
17:00 On Concentration of Measures for LDPC Code Ensembles: Igal Sason (Technion - Israel Institute of Technology, Israel); Ronen Eshel (Technion - Israel Institute of Technology, Israel)
17:20 List Decoding of Product Codes by the MinSum Algorithm: Alexander Barg (University of Maryland, USA); Gilles Z?mor (Universit? Bordeaux 1, France)
17:40 The Approximate Maximum-Likelihood Certificate: Idan Goldenberg (Tel Aviv University, Israel); David Burshtein (Tel Aviv University, Israel)
18:00 On Error Correction Capability of Bit-Flipping Algorithm for LDPC Codes: Wen-Yao Chen (National Tsing Hua University, Taiwan); Chung-Chin Lu (National Tsing Hua University, Taiwan)

16:40 Average Error Exponent of Undetected Error Probability of Binary Matrix Ensembles: Kazushi Mimura (Hiroshima city university, Japan); Tadashi Wadayama (Nagoya Institute of Technology, Japan); Toshiyuki Tanaka (Kyoto University, Japan); Yoshiyuki Kabashima (Tokyo Institute of Technology, Japan)
17:00 Beating the Gilbert-Varshamov Bound for Online Channels: Ishay Haviv (Tel Aviv University, Israel); Michael Langberg (Open University of Israel, Israel)
17:20 Upper and Lower Bounds on the Minimum Distance of Expander Codes: Alexey A. Frolov (IITP RAS, Russia); Victor V. Zyablov (Institute for Information Transmission Problems (IITP) RAS, Russia)
17:40 Is Unequal Error Protection Useful?: Ozgun Bursalioglu (University of Southern California, USA); Giuseppe Caire (University of Southern California, USA)
18:00 The Dispersion of Infinite Constellations: Amir Ingber (Tel Aviv University, Israel); Ram Zamir (Tel Aviv University, Israel); Meir Feder (Tel-Aviv University, Israel)

16:40 Compressive Identification of Linear Operators: Reinhard Heckel (ETH Z?rich, Switzerland); Helmut B?lcskei (ETH Zurich, Switzerland)
17:00 MultiPass Lasso Algorithms for Sparse Signal Recovery: Yuzhe Jin (UCSD, USA); Bhaskar Rao (University of California, San Diego, USA)
17:20 Sparse Signal Recovery From Sparsely Corrupted Measurements: Christoph Studer (Rice University, USA); Patrick Kuppinger (ETH Zurich, Switzerland); Graeme Pope (ETH Zurich, Switzerland); Helmut B?lcskei (ETH Zurich, Switzerland)
17:40 Summary Based Structures with Improved Sublinear Recovery for Compressed Sensing: Amin Khajehnejad (Caltech, USA); Juhwan Yoo (California Institute of Technology, USA); Animashree Anandkumar (University of California Irvine, USA); Babak Hassibi (California Institute of Technology, USA)
18:00 Generating Functional Analysis of Iterative Algorithms for Compressed Sensing: Kazushi Mimura (Hiroshima city university, Japan)

16:40 Special Session on Information Theory and Neuroscience At ISIT 2011: Todd P Coleman (University of California, San Diego, USA); Aurel A. Lazar (Columbia University, USA)

16:40 Degrees of Freedom of the Interference Channel: a General Formula: Yihong Wu (Princeton University, USA); Shlomo Shamai (The Technion, Israel); Sergio Verd? (Princeton University, USA)
17:00 On the Degrees of Freedom of Rank Deficient Interference Channels: Sung Ho Chae (KAIST, Korea); Sae-Young Chung (KAIST, Korea)
17:20 (n,K)-user Interference Channels: Degrees of Freedom: Ali Tajer (Princeton University, USA); Xiaodong Wang (Columbia University, USA)
17:40 Degrees of Freedom of Cooperative Interference Networks: Sreekanth Annapureddy (UIUC, USA); Aly El Gamal (University of Illinois at Urbana-Champaign, USA); Venugopal Veeravalli (University of Illinois at Urbana-Champaign, USA)
18:00 On the Sum Capacity of K-user Cascade Gaussian Z-Interference Channel: Yuanpeng Liu (Polytechnic Institute of New York University, USA); Elza Erkip (Polytechnic Institute of NYU, USA)

16:40 Optimal-Cost Repair in Multi-Hop Distributed Storage Systems: Majid Gerami (KTH (The Royal Institute of Technology), Sweden); Ming Xiao (Royal Institute of Technology, Sweden); Mikael Skoglund (Royal Institute of Technology, Sweden)
17:00 Exact Minimum-Repair-Bandwidth Cooperative Regenerating Codes for Distributed Storage Systems: Kenneth W. Shum (Institute of Network Coding, Hong Kong); Yuchong Hu (Institute of Network Coding, Hong Kong)
17:20 Distributed Storage Allocations for Optimal Delay: Derek Leong (California Institute of Technology, USA); Alex Dimakis (University of Southern California, USA); Tracey Ho (California Institute of Technology, USA)
17:40 Securing Dynamic Distributed Storage Systems from Malicious Nodes: Sameer Pawar (University of California, Berkeley, USA); Salim El Rouayheb (University of California, Berkeley, USA); Kannan Ramchandran (University of California at Berkeley, USA)
18:00 Update Efficient Codes for Distributed Storage: Ankit Singh Rawat (The University of Texas at Austin, USA); Sriram Vishwanath (University of Texas at Austin, USA); Abhishek Bhowmick (The University of Texas at Austin, USA); Emina Soljanin (Bell Labs, Alcatel - Lucent, USA)

16:40 On the Capacity of 2-User 1-Hop Relay Erasure Networks � the Union of Feedback, Scheduling, Opportunistic Routing, and Network Coding: Wei-Cheng Kuo (Purdue University, USA); Chih-Chun Wang (Purdue University, USA)
17:00 On Computing the Capacity of Relay Networks in Polynomial Time: Farzad Parvaresh (Hewlett-Packard, USA); Raul Etkin (Hewlett-Packard Laboratories, USA)
17:20 On the Capacity of the Noncausal Relay Channel: Lele Wang (UCSD, USA); Mohammad Naghshvar (University of California, San Diego, USA)
17:40 On the Transmission of Correlated Sources Over Relay Channels: Sadaf Salehkalaibar (Sharif University of Technology, Iran); Mohammad Reza Aref (Sharif University of Tech., Iran)
18:00 Hash-and-Forward Relaying for Two-Way Relay Channel: Erhan Yilmaz (Institute Eurecom, France); Raymond Knopp (Institut Eurecom, France)

16:40 Combinatorial Message Sharing for a Refined Multiple Descriptions Achievable Region: Kumar Viswanatha (UCSB, USA); Emrah Akyol (UCSB, USA); Kenneth Rose (University of California, Santa Barbara, USA)
17:00 Analysis of a Block Arithmetic Coding: Discrete Divide and Conquer Recurrence: Michael Drmota (Insistute for Discrete Mathematics and Geometry, Austria); Wojciech Szpankowski (Purdue University, USA)
17:20 Codes for Unordered Sets of Words: Yuriy A. Reznik (QUALCOMM Incorporated, USA)
17:40 Coding Theorems on the Worst-Case Redundancy of Fixed-Length Coding for a General Source: Hiroki Koga (University of Tsukuba, Japan); Mitsuharu Arimura (Shonan Institute of Technology, Japan); Ken-ichi Iwata (University of Fukui, Japan)
18:00 Training Over Sparse Multipath Channels in the Low SNR Regime: Elchanan Zwecher (The Hebrew University, Israel); Dana Porrat (The Hebrew University, Israel)

16:40 Tradeoff Analysis of Delay-Power-CSIT Quality of Generalized Dynamic BackPressure Algorithm for Energy Efficient OFDM Systems: Vincent Lau (The university of science and Technology, Hong Kong); Chung Ha Koh (Hong Kong University of Science and Technology, Hong Kong)
17:00 Vector Broadcast Channels: Optimality of Threshold Feedback Policies: Tharaka Samarasinghe (University of Melbourne, Australia); Hazer Inaltekin (The University of Melbourne, Australia); Jamie Evans (University of Melbourne, Australia)
17:20 Space-Time Linear Precoding and Iterative LMMSE Detection for MIMO Channels Without CSIT: Xiaojun Yuan (City University of Hong Kong, Hong Kong); Li Ping (City University of Hong Kong, Hong Kong)
17:40 Performance of Hybrid Codebook Techniques for MISO Downlink Channels with Limited Feedback: Sungkyu Jung (Seoul National University, Korea); Kyeongjun Ko (Seoul National University, Korea); Jungwoo Lee (Seoul National University, Korea)
18:00 Asymptotic Analysis of Downlink Multi-Cell Systems with Partial CSIT: Subhash Lakshminarayana (SUPELEC, France); M?rouane Debbah (Supelec, France); Mohamad Assaad (Supelec, France)

11:10 Bilayer LDPC Convolutional Codes for Half-Duplex Relay Channels: Zhongwei Si (Royal Institute of Technology, Sweden); Ragnar Thobaben (Royal Institute of Technology, KTH, Sweden); Mikael Skoglund (Royal Institute of Technology, Sweden)
11:30 Block-Markov LDPC Scheme for Half- and Full-Duplex Erasure Relay Channel: Marina Ivashkina (ENSEA/UCP/CNRS, France); Iryna Andriyanova (ENSEA/UCP/CNRS, France); Pablo Piantanida (SUPELEC, France); Charly Poulliat (University Cergy-Pontoise, France)
11:50 Spatially Coupled LDPC Codes for Decode-and-Forward in Erasure Relay Channel: Hironori Uchikawa (Tokyo Institute of Technology, Japan); Kenta Kasai (Tokyo Institute of Technology, Japan); Kohichi Sakaniwa (Tokyo Institute of Technology, Japan)
12:10 Soft Decode-and-Forward Using LDPC Coding in Half-Duplex Relay Channels: Marwan Hadri Azmi (University of New South Wales, Australia); Jun Li (University of New South Wales, Australia); Jinhong Yuan (University of New South Wales, Australia); Robert Malaney (University of New South Wales, Australia)

11:10 DNA Codes for Generalized Stem Similarity: Arkadii Dyachkov (Moscow State University, Russia); Julia Volkova (Moscow State University, Russia); Nikita Polyanskii (Moscow State University, Russia)
11:30 New Construction of DNA Codes with Constant-GC Contents from Binary Sequences with Ideal Autocorrelation: Young-Sik Kim (Chosun University, Korea); Sang-Hyo Kim (Sungkyunkwan University, Korea)
11:50 Outfix-free and Intercode Constraints for DNA Sequences: Hiroshi Kamabe (Gifu University, Japan)
12:10 Codebook and Marker Sequence Design for Synchronization-Correcting Codes: Victor Buttigieg (University of Malta, Malta); Johann A. Briffa (University of Surrey, United Kingdom)

11:10 Localization from Incomplete Noisy Distance Measurements: Adel Javanmard (Stanford University, USA); Andrea Montanari (Stanford University, USA)
11:30 Universal Manifold Embedding for Geometric Deformations Estimation: Rami Hagege (Ben Gurion University, Israel); Joseph M. Francos (Ben Gurion University, Israel)
11:50 Estimating a Gaussian Random Walk First-Passage Time from Noisy or Delayed Observations: Marat V Burnashev (Institute for Information Transmission Problems, Russian Academy of Sciences, Russia); Aslan Tchamkerten (Telecom ParisTech, France)
12:10 Model-Fitting in the Presence of Outliers: Jayakrishnan Unnikrishnan (EPFL, Switzerland)

11:10 The Capacity Per Unit Energy of Large Wireless Networks: Sudeep Kamath (U.C. Berkeley, USA); Urs Niesen (Bell Labs, Alcatel-Lucent, USA); Piyush Gupta (Bell Labs, Alcatel-Lucent, USA)
11:30 Cooperative Strategies for Interference-Limited Wireless Networks: Andr?s Altieri (University of Buenos Aires, Argentina); Leonardo Rey Vega (University of Buenos Aires, Facultad de Ingenier?a, Argentina); Cecilia G. Galarza (University of Buenos Aires, Argentina); Pablo Piantanida (SUPELEC, France)
11:50 On the Geometry of Wireless Network Multicast in 2-D: Mohit Thakur (Technische Universit?t M?nchen, Germany); Nadia Fawaz (MIT, USA); Muriel M?dard (MIT, USA)
12:10 Local Phy + Global Flow: A Layering Principle for Wireless Networks: Sreeram Kannan (University of Illinois, Urbana-Champaign, USA); Adnan Raja (University of Illinois, Urbana-Champaign, USA); Pramod Viswanath (University of Illinois, Urbana-Champaign, USA)

11:10 The Capacity Region for Two Classes of Product Broadcast Channels: Yanlin Geng (Chinese University of Hong Kong, Hong Kong); Amin Aminzadeh Gohari (Sharif University of Technology, Iran); Chandra Nair (Chinese University of Hong Kong, Hong Kong); Yuanming Yu (Chinese University of Hong Kong, Hong Kong)
11:30 Capacity-Achieving Encoding for the Broadcast Erasure Channel with Multiple Users: Marios Gatzianas (Center for Research and Technology Hellas, Telematics and Informatics Institute, Greece); Leonidas Georgiadis (Aristotle University of Thessaloniki, Greece); Leandros Tassiulas (University of Thessaly, Greece)
11:50 Nested Linear Codes Achieve Marton's Inner Bound for General Broadcast Channels: Arun Padakandla (University of Michigan, USA); Sandeep Pradhan (University Michigan, USA)
12:10 Capacity Region of a Class of Deterministic K-Receiver Broadcast Channels with Degraded Message Sets: Hon Fah Chong (Institute for Infocomm Research, Singapore); Ying-Chang Liang (Institute for Infocomm Research, Singapore)

11:10 Almost-Perfect Secret Sharing: Tarik Kaced (Universit? de Provence, France)
11:30 Toward Optimal Trade-Off Between Identification and Secrecy-Key Binding Using Linear Codes: Po-Hsiang Lai (Washington University in Saint Louis, USA); Joseph A. O'Sullivan (Washington University in St.Louis, USA)
11:50 Error-Free Perfect-Secrecy Systems: Siu-Wai Ho (University of South Australia, Australia); Terence H. Chan (University of South Australia, Australia); Chinthani Uduwerelle (University of South Australia, Australia)

11:10 On the Asymptotic Error Probability of Composite Relay Channels: Arash Behboodi (Sup?lec, France); Pablo Piantanida (SUPELEC, France)
11:30 Capacity of Less Noisy Relay Channels: Si-Hyeon Lee (KAIST, Korea); Sae-Young Chung (KAIST, Korea)
11:50 On the Maximum Achievable Rates in the Decode-Forward Diamond Channel: Mahdi Zamani (University of Waterloo, Canada); Amir K. Khandani (University of Waterloo, Canada)
12:10 Interference Mitigation in Femto-Macro Coexistence with Two-Way Relay Channel: Kiran T Gowda (EURECOM, France); David Gesbert (Eurecom, France); Erhan Yilmaz (Institute Eurecom, France)

11:10 Results on the Redundancy of Universal Compression for Finite-Length Sequences: Ahmad Beirami (Georgia Institute of Technology, USA); Faramarz Fekri (Georgia Institute of Technology, USA)
11:30 Limiting Distribution of Lempel Ziv'78 Redundancy: Philippe Jacquet (INRIA, France); Wojciech Szpankowski (Purdue University, USA)
11:50 On Instability of the Ergodic Limit Theorems with Respect to Small Violations of Algorithmic Randomness: Vladimir Vyugin (IITP RAS, Russia)
12:10 The Universality and Linearity of Compression by Substring: Danny Dub? (Universit? Laval, Canada); Hidetoshi Yokoo (Gunma University, Japan)

11:10 Partial Group Decoding for Interference Channels: Ali Tajer (Princeton University, USA); H. Vincent Poor (Princeton University, USA); Xiaodong Wang (Columbia University, USA)
11:30 Improvement of BP-Based CDMA Multiuser Detection by Spatial Coupling: Keigo Takeuchi (The University of Electro-Communications, Japan); Toshiyuki Tanaka (Kyoto University, Japan); Tsutomu Kawabata (University of Electro-Communications, Japan)
11:50 On the Sum-Capacity with Successive Decoding in Interference Channels: Yue Zhao (UCLA, USA); Chee Wei Tan (City University of Hong Kong, Hong Kong); Amir S. Avestimehr (Cornell University, USA); Suhas Diggavi (University of California Los Angeles, USA); Gregory Pottie (University of California at Los Angeles, USA)
12:10 The Gaussian Multiple Access Diamond Channel: Wei Kang (Southeast University, P.R. China); Nan Liu (Southeast University, P.R. China)

09:50 Adaptive Cut Generation for Improved Linear Programming Decoding of Binary Linear Codes: Xiaojie Zhang (University of California, San Diego, USA); Paul H. Siegel (University of California, San Diego, USA)
10:10 Pseudocodewords of Linear Programming Decoding of 3-Dimensional Turbo Codes: Eirik Rosnes (University of Bergen, Norway); Michael Helmling (University of Kaiserslautern, Germany); Alexandre Graell i Amat (Chalmers University of Technology, Sweden)
10:30 Polytope of Correct (Linear Programming) Decoding and Low-Weight Pseudo-Codewords: Michael Chertkov (Los Alamos National Laboratory, USA); Mikhail Stepanov (University of Arizona, USA)
10:50 Trellis-Based Check Node Processing for Low-Complexity Nonbinary LP Decoding: Mayur Punekar (University College Dublin, Ireland); Mark F. Flanagan (University College Dublin, Ireland)

09:50 Linear Extractors for Extracting Randomness from Noisy Sources: Hongchao Zhou (California Institute of Technology, USA); Jehoshua Bruck (California Institute of Technology, USA)
10:10 On the Capacity of Abelian Group Codes Over Discrete Memoryless Channels: Aria Ghasemian Sahebi (University of Michigan, USA); Sandeep Pradhan (University Michigan, USA)
10:30 Linear Error Correcting Codes with Anytime Reliability: Ravi Teja Sukhavasi (California Institute of Technology, USA); Babak Hassibi (California Institute of Technology, USA)
10:50 Channels with Intermittent Errors: Arya Mazumdar (University of Maryland, College Park, USA); Alexander Barg (University of Maryland, USA)

09:50 On the St. Petersburg Paradox: Thomas M. Cover (Stanford University, USA)
10:10 A Lattice of Gambles: Paul Cuff (Princeton University, USA); Thomas M. Cover (Stanford University, USA); Gowtham Kumar (Stanford University, USA); Lei Zhao (Stanford University, USA)
10:30 On the Detrimental Effect of Assuming a Linear Model for Non-Linear AWGN Channels: Jihad Fahs (American University of Beirut, Lebanon); Ibrahim Abou-Faycal (American University of Beirut, Lebanon)
10:50 Analysis of Fast Sparse Superposition Codes: Andrew R Barron (Yale University, USA); Antony Joseph (Yale University, USA)

09:50 The Stability Region of Random Multiple Access Under Stochastic Energy Harvesting: Jeongho Jeon (University of Maryland, College Park, USA); Anthony Ephremides (University of Maryland at College Park, USA)
10:10 On the Stability Region of Multi-Queue Multi-Server Queueing Systems with Stationary Channel Distribution: Hassan Halabian (Carleton University, Canada); Ioannis Lambadaris (Carleton University, Canada); Chung-Horng Lung (Carleton University, Canada)
10:30 Queueing Behavior of the Gilbert-Elliott Channel: BCH Codes and Poisson Arrivals: Fatemeh Hamidi-Sepehr (Texas A&M University, USA); Yi Cai (Texas A&M University, USA); Henry D Pfister (Texas A&M University, USA); Jean-Francois Chamberland (Texas A&M University, USA)
10:50 Queueing Delay - Error Probability Tradeoff for Point-to-Point Channels with Fixed Length Block Codes: Vineeth Bala Sukumaran (Indian Institute of Science, Bangalore, India); Utpal Mukherji (Indian Institute of Science, India)

09:50 Mean-Variance Optimal Linear Precoders for Random MISO Broadcast Channels: Alon Shalev Housfater (University of Toronto, Canada); Teng Joon Lim (National University of Singapore, Singapore)
10:10 On Vector Perturbation Precoding for the MIMO Gaussian Broadcast Channel: Yuval Avner (Technion, Israel); Benjamin Zaidel (Technion, Israel); Shlomo Shamai (The Technion, Israel)
10:30 Block Triangularization: A New Linear Precoding Strategy for Gaussian MIMO BC: Junyoung Nam (Electronics and Telecommunication Research Institute (ETRI), Korea); Giuseppe Caire (University of Southern California, USA); Jeongseok Ha (Korea Advanced Institute of Science and Technology, Korea)
10:50 Broadcasting on the Grassmannian: Enhancing the Multiplexing Gain: Yang Li (University of Texas at Dallas, USA); Aria Nosratinia (University of Texas, Dallas, USA)

09:50 Security Notions for Information Theoretically Secure Encryptions: Mitsugu Iwamoto (University of Electro-Communications, Japan); Kazuo Ohta (University of Electro-Communications, Japan)
10:10 On Unconditionally Secure Multi-Party Sampling from Scratch: Ye Wang (Boston University, USA); Prakash Ishwar (Boston University, USA)
10:30 Index Coding and Error Correction: Hoang Dau (Nanyang Technological University, Singapore); Vitaly Skachek (University of Illinois at Urbana-Champaign, USA); Yeow Meng Chee (Nanyang Technological University, Singapore)
10:50 The Average Radius of Codes: Survey and New Results: Gerard Cohen (ENST, France); Carlos Munuera (Universidad de Valladolid, Spain); Patrick Sol? (Telecom Paristech, France)

09:50 Compress-and-Forward Scheme for a Relay Network: Approximate Optimality and Connection to Algebraic Flows: Adnan Raja (University of Illinois, Urbana-Champaign, USA); Pramod Viswanath (University of Illinois, Urbana-Champaign, USA)
10:10 Degraded Two-Message Multicast Over Graphs: Shirin Saeedi Bidokhti (EPFL, Switzerland); Christina Fragouli (EPFL, Switzerland)
10:30 Common Information of Random Linear Network Coding Over a 1-Hop Broadcast Packet Erasure Channel: Chih-Chun Wang (Purdue University, USA); Jaemin Han (Purdue University, USA)
10:50 Multilevel Coding Schemes for Compute-and-Forward: Brett Hern (Texas A&M University, USA); Krishna Narayanan (Texas A&M University, USA)

09:50 Secure Source Coding with Action-Dependent Side Information: Kittipong Kittichokechai (Royal Institute of Technology, Sweden); Tobias J. Oechtering (Royal Institute of Technology & School of Electrical Engineering, EE, Sweden); Mikael Skoglund (Royal Institute of Technology, Sweden)
10:10 Cascade and Triangular Source Coding with Causal Side Information: Yeow-Khiang Chia (Stanford University, USA); Tsachy Weissman (Stanford University, USA)
10:30 Source-Channel Coding Tradeoff in Multiple Antenna Multiple Access Channels: Ebrahim MolavianJazi (University of Notre Dame, USA); J. Nicholas Laneman (University of Notre Dame, USA)
10:50 Vector Gaussian Multiple Description Coding with Individual and Central Distortion Constraints: Jun Chen (McMaster University, Canada); Jia Wang (Shanghai Jiao Tong University, P.R. China)

09:50 Robust Incremental Redundancy Hybrid ARQ Coding for Channels with Unknown CSI: Stojan Denic (Telecommunications Research Lab Toshiba, United Kingdom)
10:10 On Random CDMA with Constant Envelope: Ralf R. M?ller (Norwegian University of Science and Technology, Norway)
10:30 Universal Decoding Over Gaussian Fading Channels - Metric Calculation and Performance Evaluation: Nir Weinberger (Tel Aviv University, Israel); Meir Feder (Tel-Aviv University, Israel)
10:50 Mitigating Interference with Integer-Forcing Architectures: Jiening Zhan (University of California, Berkeley, USA); Uri Erez (Tel Aviv University, Israel); Michael Gastpar (University of California, Berkeley, USA); Bobak Nazer (Boston University, USA)

11:30 Scaling Behavior of Convolutional LDPC Ensembles Over the BEC: Pablo M. Olmos (Universidad de Sevilla, Spain); Ruediger L Urbanke (EPFL, Switzerland)
11:50 Dynamic Scheduling-Aided Decoding Strategies for LDPC Convolutional Codes with Rational Parity-Check Matrices: Jian-Jia Weng (National Chiao Tung University, Taiwan); Mu-Chen Wu (National Chiao Tung University, Taiwan); Chung-Hsuan Wang (National Chiao Tung University, Taiwan); Yi-Sheng Su (Chang Jung Christian University, Taiwan); Tsung Cheng Wu (I-Shou University, Taiwan)
12:10 Efficient Message Passing Scheduling for Terminated LDPC Convolutional Codes: Michael Lentmaier (Dresden University of Technology, Germany); Maria Mellado Prenda (Dresden University of Technology, Germany); Gerhard Fettweis (Technische Universit?t Dresden, Germany)
12:30 On the Lower Bound of the Free Distance of Partial Unit Memory Codes Based on LDPC Codes: Konstantin Kondrashov (Institute for Information Transmission Problems, Russia); Victor V. Zyablov (Institute for Information Transmission Problems (IITP) RAS, Russia)

11:30 On Conjugacy Classes of Subgroups of the General Linear Group and Cyclic Orbit Codes: Felice Manganiello (Universit?t Z?rich, Switzerland); Anna-Lena Trautmann (Universit?t Z?rich, Switzerland); Joachim Rosenthal (University of Zurich, Switzerland)
11:50 High Rate Fibonacci Polynomial Codes: Mostafa Esmaeili (Isfahan University of Technology, Iran); Morteza Esmaeili (Isfahan University of Technology, Iran); T. Aaron Gulliver (University of Victoria, Canada)
12:10 On the Treewidth of MDS and Reed-Muller Codes: Navin Kashyap (Indian Institute of Science & Queen's University, India); Andrew Thangaraj (IIT Madras, India)
12:30 Network-Error Correcting Codes Using Small Fields: Krishnan Prasad (Indian Institute of Science, India); B. Sundar Rajan (Indian Institute of Science, India)

11:30 On Essentially Conditional Information Inequalities: Tarik Kaced (Universit? de Provence, France); Andrei Romashchenko (Laboratoire D'Informatique Fondamentale de Marseille, CNRS & The Institute for Information Transmission Problems of RAS, France)
11:50 Further Results on Geometric Properties of a Family of Relative Entropies: Ashok Kumar M. (Indian Insitute of Science, India); Rajesh Sundaresan (Indian Institute of Science, India)
12:10 Entropy Power Inequality for a Family of Discrete Random Variables: Naresh Sharma (Tata Institute of Fundamental Research, India); Siddharth Muthukrishnan (Tata Institute of Fundamental Research, India); Smarajit Das (Tata Institute of Fundamental Research, India)
12:30 Inequalities for Entropies of Sets of Subsets of Random Variables: Chao Tian (AT&T Labs - Research, USA)

11:30 Distributed Resource Allocation for Proportional Fairness in Multi-Band Wireless Systems: I-Hong Hou (University of Illinois at Urbana-Champaign, USA); Piyush Gupta (Bell Labs, Alcatel-Lucent, USA)
11:50 Degrees of Freedom of Two-User MIMO Networks with Random Medium Access Control Mechanism: Vahid Pourahmadi (University of Waterloo, Canada); Abolfazl Motahari (University of Waterloo, Canada); Amir K. Khandani (University of Waterloo, Canada)
12:10 Distributed Scheduling for Wireless Networks: Radhika Gowaikar (Qualcomm Incorporated, USA); Christopher Lott (Qualcomm, Inc., USA); Rashid Attar (QUALCOMM Inc., USA); Donna Ghosh (Qualcomm Corp R&D, USA); Kambiz Azarian (Qualcomm Inc., USA); Amin Jafarian (The University of Texas, Austin, USA)
12:30 Min-Max Fair Coordinated Beamforming Via Large Systems Analysis: Randa Zakhour (University of Melbourne, Australia); Stephen Hanly (National University of Singapore, Singapore)

11:30 LQG Control Approach to Gaussian Broadcast Channels with Feedback: Ehsan Ardestanizadeh (University of California, San Diego & ASSIA Inc., USA); Paolo Minero (University of Notre Dame, USA); Massimo Franceschetti (University of California at San Diego, USA)
11:50 Wireless Peer-to-Peer Mutual Broadcast Via Sparse Recovery: Lei Zhang (Northwestern University, USA); Dongning Guo (Northwestern University, USA)
12:10 Vector Broadcast Channels: Optimal Threshold Selection Problem: Tharaka Samarasinghe (University of Melbourne, Australia); Hazer Inaltekin (The University of Melbourne, Australia); Jamie Evans (University of Melbourne, Australia)
12:30 Approximately Optimal Broadcasting-Cum-Multicasting in Wireless Networks: Sreeram Kannan (University of Illinois, Urbana-Champaign, USA); Adnan Raja (University of Illinois, Urbana-Champaign, USA); Pramod Viswanath (University of Illinois, Urbana-Champaign, USA)

11:30 Secret Sharing Via Noisy Broadcast Channels: Lifeng Lai (University of Arkansas, Little Rock, USA); Yingbin Liang (Syracuse University, USA); Wenliang Du (Syracuse University, USA); Shlomo Shamai (The Technion, Israel)
11:50 Group Secret Key Agreement Over State-Dependent Wireless Broadcast Channels: Mahdi Jafari Siavoshani (EPFL, Switzerland); Shaunak Mishra (University of California, Los Angeles, USA); Suhas Diggavi (University of California Los Angeles, USA); Christina Fragouli (EPFL, Switzerland)
12:10 Secure Multiplex Coding with a Common Message: Ryutaroh Matsumoto (Tokyo Institute of Technology, Japan); Masahito Hayashi (Tohoku University, Japan)
12:30 Key Agreement Over Multiple Access Channel Using Feedback Channel: Somayeh Salimi (Sharif University of Technology & Iran Telecommunication Research Center, Iran); Mahmoud Salmasizadeh (Sharif University of Technology, Iran); Mohammad Reza Aref (Sharif University of Tech., Iran)

11:30 Practical Code Design for Compute-and-Forward: Or Ordentlich (Tel Aviv University, Israel); Jiening Zhan (University of California, Berkeley, USA); Uri Erez (Tel Aviv University, Israel); Michael Gastpar (University of California, Berkeley, USA); Bobak Nazer (Boston University, USA)
11:50 Relaying Via Hybrid Coding: Young-Han Kim (UCSD, USA); Sung Hoon Lim (KAIST, Korea); Paolo Minero (University of Notre Dame, USA)
12:10 A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying: Ahmad Abu Al Haija (McGill University, Canada); Mai Vu (McGill University, Canada)
12:30 How to Achieve Privacy in Bidirectional Relay Networks: Rafael F. Wyrembelski (Technische Universit?t M?nchen, Germany); Holger Boche (Technical University Munich, Germany)

11:30 Computing a Function of Correlated Sources: A Rate Region: Milad Sefidgaran (Telecom ParisTech, France); Aslan Tchamkerten (Telecom ParisTech, France)
11:50 Algebraic Codes for Slepian-Wolf Code Design: Shizheng Li (Iowa State University, USA); Aditya Ramamoorthy (Iowa State University, USA)
12:10 Multi-Terminal Source Coding Through a Relay: Rajiv Soundararajan (University of Texas, Austin, USA); Sriram Vishwanath (University of Texas at Austin, USA)
12:30 Tree Interactive Encoding and Decoding: Conditionally $\Phi$-Mixing Sources: Jin Meng (University of Waterloo, Canada); En-hui Yang (University of Waterloo, Canada); Zhen Zhang (University of Southern California, USA)

11:30 The Fundamental Limits of Infinite Constellations in MIMO Fading Channels: Yair Yona (Tel-Aviv University, Israel); Meir Feder (Tel-Aviv University, Israel)
11:50 Near-Capacity BICM-ID for MIMO Channels: Qiuliang Xie (Tsinghua University, P.R. China); Jian Song (Tsinghua University, P.R. China); Fang Yang (Tsinghua University, P.R. China); Yang Zhixing (Tsinghua University, P.R. China)
12:10 Minimizing the Complexity of Fast Sphere Decoding of STBCs: G Jithamithra (Indian Institute of Science, India); B. Sundar Rajan (Indian Institute of Science, India)
12:30 Performance Analysis of Coded V-BLAST with Optimum Power and Rate Allocation: Victoria Kostina (Princeton University, USA); Sergey Loyka (University of Ottawa, Canada)

14:20 Two-Bit Bit Flipping Decoding of LDPC Codes: Dung Nguyen (University of Arizona, USA); Bane Vasi? (University of Arizona, USA); Michael W. Marcellin (ECE Dept, The University of Arizona, USA)
14:40 Uniformly Reweighted Belief Propagation: A Factor Graph Approach: Henk Wymeersch (Chalmers University of Technology, Sweden); Federico Penna (Politecnico di Torino, Italy); Vladimir Savi? (Universidad Politecnica de Madrid, Spain)
15:00 Fast Decoding of Regular LDPC Codes Using Greedy Approximation Algorithms: Nicholas Kalouptsidis (National and Kapodistrian University of Athens, Greece); Nicholas Kolokotronis (University of Peloponnese, Greece)
15:20 Connection Between Annealed Free Energy and Belief Propagation on Random Factor Graph Ensembles: Ryuhei Mori (Kyoto University, Japan)

14:20 Decomposing Permutations Via Cost-Constrained Transpositions: Farzad Farnoud (Hassanzadeh) (University of Illinois, Urbana-Champaign, USA); Olgica Milenkovic (University of Illinois, USA)
14:40 Computing the Ball Size of Frequency Permutations Under Chebyshev Distance: Min-Zheng Shieh (National Chiao Tung University, Taiwan); Shi-Chun Tsai (National Chiao Tung University, Taiwan)
15:00 Some Constructions of Maximal Witness Codes: Nikolaos Makriyannis (Universitat Pompeu Fabra, Spain); Bertrand Meyer (Ecole Polytechnique F?d?rale de Lausanne, Switzerland)

14:20 Causal State Amplification: Chiranjib Choudhuri (University of Southern California, USA); Young-Han Kim (UCSD, USA); Urbashi Mitra (University of Southern California, USA)
14:40 Separate Source-Channel Coding for Broadcasting Gorrelated Gaussians: Yang Gao (University of California, Riverside, USA); Ertem Tuncel (UC Riverside, USA)
15:00 Capacity Theorems for the Fading Interference Channel with a Relay and Feedback Links: Daniel Zahavi (Ben-Gurion University, Israel); Ron Dabora (Ben Gurion University, Israel)
15:20 An Information-Theoretic Approach to Constructing Coherent Risk Measures: Amir Ahmadi-Javid (Amirkabir University of Technology, Iran)

14:20 Quickest Detection in Censoring Sensor Networks: Yajun Mei (Georgia Institute of Technology, USA)
14:40 Fast Averaging: Shreeshankar Bodas (MIT, USA); Devavrat Shah (Massachusetts Institute of Technology, USA)
15:00 A Variational Message Passing Algorithm for Sensor Self-Localization in Wireless Networks: Claus Pedersen (Aalborg University, Denmark); Troels Pedersen (Aalborg University, Denmark); Bernard Henri Fleury (Aalborg University, Denmark)
15:20 Distributed Detection Using MRC with Censored Sensors and Rayleigh Faded Communications: Chinmoy Kundu (Indian Institute of Technology Delhi, India); Sumit Kundu (N.I.T Durgapur, India); Gianluigi Ferrari (University of Parma, Italy); Riccardo Raheli (University of Parma, Italy)

14:20 The State-Dependent Interference Channel with States Available At a Cribbing Encoder and One Receiver: Shraga Bross (Bar-Ilan University, Israel); Yossef Steinberg (Technion, Israel)
14:40 Multi-Level Rate-Splitting for Synchronous and Asynchronous Interference Channels: Hideki Yagi (The University of Electro-Communications, Japan); H. Vincent Poor (Princeton University, USA)
15:00 On Interference Alignment and the Deterministic Capacity for Cellular Channels with Weak Symmetric Cross Links: J?rg B?hler (TU Berlin, Germany); Gerhard Wunder (Heinrich-Hertz-Institut, Germany)
15:20 Communication with Disturbance Constraints: Bernd Bandemer (Stanford University, USA); Abbas El Gamal (Stanford University, USA)

14:20 Constrained Flash Memory Programming: Amit Berman (Technion - Israel Institute of Technology, Israel); Yitzhak Birk (Technion, Israel)
14:40 Quasi-Cross Lattice Tilings with Applications to Flash Memory: Moshe Schwartz (Ben-Gurion University of the Negev, Israel)
15:00 Layered Index-Less Indexed Flash Codes for Improving Average Performance: Riki Suzuki (Nagoya Institute of Technology, Japan); Tadashi Wadayama (Nagoya Institute of Technology, Japan)
15:20 Error-Correcting Schemes with Dynamic Thresholds in Nonvolatile Memories: Hongchao Zhou (California Institute of Technology, USA); Anxiao Andrew Jiang (Texas A&M University, USA); Jehoshua Bruck (California Institute of Technology, USA)

14:20 Practical Network Coding on Three-Node Point-to-Point Relay Networks: Silas L. Fong (City University of Hong Kong, Hong Kong); Mingxi Fan (Qualcomm, Inc., USA); Raymond W. Yeung (The Chinese University of Hong Kong, Hong Kong)
14:40 Superposition Noisy Network Coding: Neevan Ramalingam (Iowa State University, USA); Zhengdao Wang (Iowa State University, USA)
15:00 Noisy Analog Network Coding for the Two-Way Relay Channel: Majid Nasiri Khormuji (Royal Institute of Technology (KTH), Sweden); Mikael Skoglund (Royal Institute of Technology, Sweden)
15:20 Distance Properties and Performance of Physical Layer Network Coding with Binary Linear Codes for Gaussian Two-Way Relay Channels: Tao Yang (CSIRO, Australia); Ingmar Land (University of South Australia, Australia); Tao Huang (University of New South Wales, Australia); Jinhong Yuan (University of New South Wales, Australia); Zhuo Chen (CSIRO ICT Centre, Australia)

14:20 Multi-Terminal Source Coding with Action Dependent Side Information: Yeow-Khiang Chia (Stanford University, USA); Himanshu Asnani (Stanford University, USA); Tsachy Weissman (Stanford University, USA)
14:40 Multiterminal Source Coding with an Entropy-Based Distortion Measure: Thomas Courtade (UCLA, USA); Richard Wesel (University of California, Los Angeles, USA)
15:00 Efficient Distributed Source Coding for Multiple Receivers Via Matrix Sparsification: Chen Avin (Ben-Gurion University of the Negev, Israel); Michael Borokhovich (Ben-Gurion University of the Negev, Israel); Asaf Cohen (Ben-Gurion University of the Negev, Israel); Zvi Lotker (Ben Gurion University, Beer Sheva, Israel)
15:20 On the Vector Gaussian CEO Problem: Jun Chen (McMaster University, Canada); Jia Wang (Shanghai Jiao Tong University, P.R. China)

14:20 Polite Water-filling for the Boundary of the Capacity/Achievable Regions of MIMO MAC/BC/Interference Networks: Liu An (Peking University, P.R. China); Youjian (Eugene) Eugene Liu (University of Colorado at Boulder, USA); Haige Xiang (Peking University, P.R. China); Wu Luo (Peking University, P.R. China)
14:40 Noncoherent SIMO Pre-Log Via Resolution of Singularities: Erwin Riegler (Vienna University of Technology (VUT), Austria); Veniamin I. Morgenshtern (ETH Z?rich, Switzerland); Giuseppe Durisi (Chalmers University of Technology, Sweden); Shaowei Lin (UC Berkeley, USA); Bernd Sturmfels (UC Berkeley, USA); Helmut B?lcskei (ETH Zurich, Switzerland)
15:00 Distributed STBCs with Full-Diversity Partial Interference Cancellation Decoding: Lakshmi Prasad Natarajan (Indian Institute of Science, Bangalore, India); B. Sundar Rajan (Indian Institute of Science, India)
15:20 A Family of Fast-Decodable MIDO Codes from Crossed-Product Algebras Over Q: Laura Luzzi (Sup?lec, France); Frederique Oggier (Nanyang Technological University, Singapore)

16:00 Generalized Approximate Message Passing for Estimation with Random Linear Mixing: Sundeep Rangan (Polytechnic University of New York University, USA)
16:20 Application of Belief Propagation to Trust and Reputation Management: Erman Ayday (Georgia Institute of Technology, USA); Faramarz Fekri (Georgia Institute of Technology, USA)
16:40 Normal Factor Graphs: A Diagrammatic Approach to Linear Algebra: Ali Al-Bashabsheh (University of Ottawa, Canada); Yongyi Mao (University of Ottawa, Canada); Pascal Vontobel (HP Labs, USA)
17:00 A Factor-Graph Approach to Lagrangian and Hamiltonian Dynamics: Pascal Vontobel (HP Labs, USA)

16:00 The Ordered Hamming Metric and Ordered Symmetric Channels: Woomyoung Park (Uinversity of Maryland, USA); Alexander Barg (University of Maryland, USA)
16:20 Codes and Designs Related to Lifted MRD Codes: Natalia Silberstein (Technion - Israel Institute of Technology, Israel); Tuvi Etzion (Technion-Israel Institute of Technology, Israel)
16:40 Combinatorial Lower Bound for List Decoding of Codes on Finite-Field Grassmannian: Rachit Agarwal (University of Illinois at Urbana-Champaign, USA)
17:00 Density and Bounds for Grassmannian Codes with Chordal Distance: Renaud-Alexandre Pitaval (Aalto University, Finland); Olav Tirkkonen (Aalto University, Finland); Steven D Blostein (Queen's University, Canada)
17:20 Soft-Decision List Decoding of Reed-Muller Codes with Linear Complexity: Ilya Dumer (University of California at Riverside, USA); Grigory Kabatiansky (IITT, Moscow, Russia); C?dric Tavernier (CE e., UAE)

16:00 Subspace Expanders and Matrix Rank Minimization: Samet Oymak (California Institute of Technology, USA); Amin Khajehnejad (Caltech, USA); Babak Hassibi (California Institute of Technology, USA)
16:20 Low-Rank Matrix Recovery from Errors and Erasures: Yudong Chen (The University of Texas at Austin, USA); Ali Jalali (University of Texas at Austin, USA); Sujay Sanghavi (University of Texas, Austin, USA); Constantine Caramanis (The University of Texas at Austin, USA)
16:40 A Simplified Approach to Recovery Conditions for Low Rank Matrices: Samet Oymak (California Institute of Technology, USA); Karthik Mohan (University of Washington, USA); Maryam Fazel (California Institute of Technology, USA); Babak Hassibi (California Institute of Technology, USA)
17:00 Tight Recovery Thresholds and Robustness Analysis for Nuclear Norm Minimization: Samet Oymak (California Institute of Technology, USA); Babak Hassibi (California Institute of Technology, USA)
17:20 Support Recovery with Sparsely Sampled Free Random Matrices: Antonia Tulino (Bell Laboratories, USA); Giuseppe Caire (University of Southern California, USA); Shlomo Shamai (The Technion, Israel); Sergio Verd? (Princeton University, USA)

16:00 Network Control: A Rate-Distortion Perspective: Jubin Jose (University of Texas at Austin, USA); Sriram Vishwanath (University of Texas at Austin, USA)
16:20 Information Capacity of Energy Harvesting Sensor Nodes: Ramachandran Rajesh (Indian Institute of Science, India); Vinod Sharma (Indian Institute of Science, India); Pramod Viswanath (University of Illinois, Urbana-Champaign, USA)
16:40 Exploiting Peer-to-Peer State Exchange for Distributed Medium Access Control: Ka Hung Hui (Northwestern University, USA); Tianyi Li (Northwestern University, USA); Dongning Guo (Northwestern University, USA); Randall Berry (Northwestern University, USA)
17:00 Delay Performance of CSMA in Networks with Bounded Degree Conflict Graphs: Vijay Subramanian (Northwestern University, USA); Murat Alanyali (Boston University, USA)
17:20 Polite Water-Filling for Weighted Sum-Rate Maximization in MIMO B-MAC Networks Under Multiple Linear Constraints: Liu An (Peking University, P.R. China); Youjian (Eugene) Eugene Liu (University of Colorado at Boulder, USA); Vincent Lau (The university of science and Technology, Hong Kong); Haige Xiang (Peking University, P.R. China); Wu Luo (Peking University, P.R. China)

16:00 On Maximal Error Capacity Regions of Symmetric Gaussian Multiple-Access Channels: Sirin Nitinawarat (University of Illinois at Urbana-Champaign, USA)
16:20 Construction of Multiple Access Channel Codes Based on Hash Property: Jun Muramatsu (NTT Corporation, Japan); Shigeki Miyake (NTT, Japan)
16:40 Multiple Access Channel with Partial and Controlled Cribbing Encoders: Himanshu Asnani (Stanford University, USA); Haim H Permuter (Ben-Gurion University, Israel)
17:00 Capacity Regions of Discrete Asynchronous Multiple Access Channels: L?r?nt Farkas (Budapest University of Technology and Economics, Hungary); Tam?s K?i (Budapest University of Technology and Economics, Hungary)
17:20 On the Capacity of a Hybrid Broadcast Multiple Access System for WDM Networks: Vinay A. Vaishampayan (AT&T Labs - Research & Columbia University, USA); Chao Tian (AT&T Labs - Research, USA); Mark Feuer (AT&T Labs - Research, USA)

16:00 Patterned Cells for Phase Change Memories: Anxiao Andrew Jiang (Texas A&M University, USA); Hongchao Zhou (California Institute of Technology, USA); Zhiying Wang (California Institute of Technology, USA); Jehoshua Bruck (California Institute of Technology, USA)
16:20 DRESS Codes for the Storage Cloud: Simple Randomized Constructions: Sameer Pawar (University of California, Berkeley, USA); Nima Noorshams (UC Berkeley, USA); Salim El Rouayheb (University of California, Berkeley, USA); Kannan Ramchandran (University of California at Berkeley, USA)
16:40 Bounds and Constructions for Granular Media Coding: Artyom Sharov (Technion, Israel); Ron M. Roth (Technion, Israel)
17:00 Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds: Yuval Cassuto (EPFL, Switzerland); Simon Litsyn (Tel Aviv University, Israel)
17:20 On Systematic Encoding for Blaum-Roth Codes: Qian Guo (Fudan University, P.R. China); Haibin Kan (Fudan University, P.R. China)

16:00 The Finite Field Multi-Way Relay Channel with Correlated Sources: The Three-User Case: Lawrence Ong (The University of Newcastle, Australia); Roy Timo (University of South Australia, Australia); Gottfried Lechner (University of South Australia, Australia); Sarah Johnson (University of Newcastle, Australia); Christopher Kellett (University of Newcastle, Australia)
16:20 Lattice Strategies for a Multi-Pair Bi-Directional Relay Network: Sang Joon Kim (Samsung, Korea); Besma Smida (Purdue University Calumet, USA); Natasha Devroye (University of Illinois at Chicago, USA)
16:40 Feedback Enlarges Capacity Region of Two-Way Relay Channel: Silas L. Fong (City University of Hong Kong, Hong Kong); Raymond W. Yeung (The Chinese University of Hong Kong, Hong Kong)
17:00 A new eigen-direction alignment algorithm for physical-layer network coding in MIMO two-way relay channels: Tao Yang (CSIRO, Australia); Xiaojun Yuan (City University of Hong Kong, Hong Kong); Li Ping (City University of Hong Kong, Hong Kong); Iain B. Collings (CSIRO, Australia); Jinhong Yuan (University of New South Wales, Australia)

16:00 Proactive Source Coding: Onur Gungor (The Ohio State University, USA); Onur Ozan Koyluoglu (The University of Texas at Austin, USA); Hesham El Gamal (Ohio State University, USA); Can Emre Koksal (The Ohio State University, USA)
16:20 Near-Optimal Rates for Limited-Delay Universal Lossy Source Coding: Andr?s Gy?rgy (Computer and Automation Research Institute of the Hungarian Academy of Sciences, Hungary); Gergely Neu (Budapest University of Technology and Economics & MTA SZTAKI Institute for Computer Science and Control, Hungary)
16:40 On the Construction and MAP Decoding of Optimal Variable-Length Error-Correcting Codes: Ting-Yi Wu (National Chiao-Tung University, Taiwan); Po-Ning Chen (National Chiao Tung University, Taiwan); Fady Alajaji (Queen's University, Canada); Yunghsiang Sam Han (National Taiwan University of Science and Technology, Taiwan)
17:00 Characterizing Compressibility with Lorenz Curves: Claudio Weidmann (CNRS / ENSEA / University Cergy-Pontoise, France)
17:20 Incremental Refinement Using a Gaussian Test Channel: Jan ?stergaard (Aalborg University, Denmark); Ram Zamir (Tel Aviv University, Israel)

16:00 On the Generalized Degrees of Freedom of the K - User Symmetric MIMO Gaussian Interference Channel: Parthajit Mohapatra (Indian Institute of Science, India); Chandra R Murthy (Indian Institute of Science, India)
16:20 Capacity of the MIMO Interference Channel to Within a Constant Gap: Sanjay Karmakar (University Of Colorado at Boulder, USA); Mahesh Kumar Varanasi (University of Colorado, USA)
16:40 The Generalized Degrees of Freedom of the MIMO Interference Channel: Sanjay Karmakar (University Of Colorado at Boulder, USA); Mahesh Kumar Varanasi (University of Colorado, USA)
17:00 The Degrees of Freedom Region of the MIMO Interference Channel with Delayed CSIT: Chinmay Vaze (University of Colorado at Boulder, USA); Mahesh Kumar Varanasi (University of Colorado, USA)
17:20 A Convergent Version of Max SINR for the MIMO Interference Channel: Craig Wilson (University of Illinois at Urbana-Champaign, USA); Venugopal Veeravalli (University of Illinois at Urbana-Champaign, USA)

09:50 Decimation-Enhanced Finite Alphabet Iterative Decoders for LDPC Codes on the BSC: Shiva Kumar Planjery (University of Arizona, USA); Bane Vasi? (University of Arizona, USA); David Declercq (ETIS lab. ENSEA/Cergy University/CNRS UMR, France)
10:10 Optimal and Suboptimal Receivers for Maximal-Rate Roof-LDPC Codes Over MIMO Block-Fading Channels: Daniele Capirone (Politecnico di Torino, Italy); Alberto Tarable (Politecnico di Torino, Italy)
10:30 Rate-Equivocation Optimal Spatially Coupled LDPC Codes for the BEC Wiretap Channel: Vishwambhar Rathi (Icera, United Kingdom); Ruediger L Urbanke (EPFL, Switzerland); Mattias Andersson (Royal Institute of Technology, Sweden); Mikael Skoglund (Royal Institute of Technology, Sweden)
10:50 Capacity Achieving LDPC Ensembles for the TEP Decoder in Erasure Channels: Pablo M. Olmos (Universidad de Sevilla, Spain); Juan Jos? Murillo-Fuentes (Universidad de Sevilla, Spain); Fernando P?rez-Cruz (Universidad Carlos III de Madrid, Spain)

09:50 Minimal Trellis for Systematic Recursive Convolutional Encoders: Cecilio Pimentel (UFPE, Brazil); Richard Demo Souza (Federal University of Technology - Paran? (UTFPR), Brazil); Bartolomeu F. Uch?a-Filho (Federal University of Santa Catarina & Communications Research Group, Brazil); Isaac Benchimol (IFAM, Brazil)
10:10 Simultaneous Code/Error-Trellis Reduction for Convolutional Codes Using Shifted Code/Error-Subsequences: Masato Tajima (University of Toyama, Japan); Koji Okino (University of Toyama, Japan); Takashi Miyagoshi (University of Toyama, Japan)
10:30 Partial Unit Memory Codes Based on Gabidulin Codes: Antonia Wachter (Ulm University, Germany); Vladimir Sidorenko (University of Ulm, Germany); Martin Bossert (University of Ulm, Germany); Victor V. Zyablov (Institute for Information Transmission Problems (IITP) RAS, Russia)
10:50 Delay Invariant Convolutional Network Codes: Qifu T Sun (The Chinese University of Hong Kong, Hong Kong); Sidharth Jaggi (Chinese University of Hong Kong, Hong Kong); Shuo-Yen Robert Li (The Chinese University of Hong Kong, Hong Kong)

09:50 Some Limits to Nonparametric Estimation for Ergodic Processes: Hayato Takahashi (The Institute of Statistical Mathematics, Japan)
10:10 Population Size Estimation Using a Few Individuals as Agents: Farid Movahedi Naini (EPFL, Switzerland); Olivier Dousse (Nokia Research Center, Switzerland); Patrick Thiran (EPFL, Switzerland); Martin Vetterli (EPFL, Switzerland)
10:30 Target Localization with Binary Observations: Effect of Censoring Non-Detecting Sensors: Arian Shoari (University of Rochester, USA); Alireza Seyedi (University of Rochester, USA)
10:50 Confidence Sets in Time--Series Filtering: Boris Ryabko (Siberian State University of Telecommunication and Informatics & Institute of Computational Technologies SB RAN, Russia); Daniil Ryabko (INRIA Lille-Nord Europe, France)

09:50 Transmission Control of Two-User Slotted ALOHA Over Gilbert-Elliott Channel: Stability and Delay Analysis: Anthony Fanous (University of Maryland, College Park, USA); Anthony Ephremides (University of Maryland at College Park, USA)
10:10 Variable Frame Based Max-Weight Algorithms for Networks with Switchover Delay: G?ner D ?elik (MIT, USA); Sem Borst (Alcatel-Lucent, Bell Labs & Eindhoven University of Technology, USA); Phil Whiting (Bell Labs, Lucent Technologies, USA); Eytan Modiano (MIT, USA)
10:30 Towards a Queueing-Based Framework for In-Network Function Computation: Siddhartha Banerjee (The University of Texas at Austin & UT Austin, USA); Piyush Gupta (Bell Labs, Alcatel-Lucent, USA); Sanjay Shakkottai (The University of Texas at Austin, USA)
10:50 On the Scaling of Non-Asymptotic Capacity in Multi-Access Networks with Bursty Traffic: Florin Ciucu (T-Labs / TU Berlin, Germany)

09:50 The Capacity Region of the Linear Shift Deterministic Y-Channel: Anas Chaaban (TU Darmstadt, Germany); Aydin Sezgin (TU Darmstadt & Network Information Theory Lab, Germany)
10:10 Two Unicast Information Flows Over Linear Deterministic Networks: I-Hsiang Wang (University of California at Berkeley, USA); Sudeep Kamath (U.C. Berkeley, USA); David Tse (University of California at Berkeley, USA)
10:30 Secret Writing on Dirty Paper: A Deterministic View: Mustafa El-Halabi (Texas A&M University, USA); Tie Liu (Texas A&M University, USA); Costas N Georghiades (Texas A&M University, USA); Shlomo Shamai (The Technion, Israel)
10:50 Wireless Network Simplification: The Gaussian N-Relay Diamond Network: Caner Nazaroglu (METU, Turkey); Ayfer ?zg?r (EPFL, Switzerland); Christina Fragouli (EPFL, Switzerland)

09:50 Computing the Capacity of Rewritable Memories: Christoph Bunte (ETH Zurich, Switzerland); Amos Lapidoth (ETHZ, Switzerland)
10:10 Characterizing Capacity Achieving Write Once Memory Codes for Multilevel Flash Memories: Ryan Gabrys (UCLA, USA); Lara Dolecek (UCLA, USA)
10:30 Variable-Level Cells for Nonvolatile Memories: Anxiao Andrew Jiang (Texas A&M University, USA); Hongchao Zhou (California Institute of Technology, USA); Jehoshua Bruck (California Institute of Technology, USA)
10:50 Sum-Capacity of Multiple-Write Noisy Memory: Lele Wang (UCSD, USA); Young-Han Kim (UCSD, USA)

09:50 Physical-Layer MIMO Relaying: Anatoly Khina (Tel Aviv University, Israel); Yuval Kochman (Massachusetts Institute of Technology, USA); Uri Erez (Tel Aviv University, Israel)
10:10 The Necessity of Relay Selection for Beamforming in Amplify-and-Forward Networks: Erdem Koyuncu (University of California, Irvine, USA); Hamid Jafarkhani (University of California, Irvine, USA)
10:30 Half-Duplex Relaying Based on Quantize-and-Forward: Sha Yao (Royal Institute of Technology, Sweden); Mikael Skoglund (Royal Institute of Technology, Sweden); Tung T Kim (Princeton University, USA); H. Vincent Poor (Princeton University, USA)
10:50 Modulation for MIMO Networks with Several Users: Anatoly Khina (Tel Aviv University, Israel); Ayal Hitron (Tel Aviv University, Israel); Uri Erez (Tel Aviv University, Israel)

09:50 On the Dynamic Construction of an Antidictionary with Linear Complexity: Takahiro Ota (Nagano Prefectural Institute of Technology, Japan); Hiroyoshi Morita (University of Electro-Communications, Japan); Hirotada Fukae (Shikoku Polytechnic College, Japan)
10:10 A Bio-Inspired Approach to Condensing Information: Rudolf Mathar (RWTH Aachen University, Germany); Anke Schmeink (RWTH Aachen University, Germany)
10:30 The "Source-Simplification" Aspect of Signaling: Pulkit Grover (University of California, Berkeley, USA); Anant Sahai (UC Berkeley, USA)

09:50 A New Capacity Result for the Z-Gaussian Cognitive Interference Channel: Stefano Rini (UIC, USA); Daniela Tuninetti (University of Illinois at Chicago, USA); Natasha Devroye (University of Illinois at Chicago, USA)
10:10 On the Capacity Region of the Cognitive Interference Channel with Unidirectional Destination Cooperation: Hsuan-Yi Chu (National Taiwan University, Taiwan); Hsuan-Jung Su (National Taiwan University, Taiwan)
10:30 Capacity of a Class of Overlay Cognitive MAC Radios: Goochul Chung (University of Texas, USA); Sriram Vishwanath (University of Texas at Austin, USA)
10:50 Effect of Uncertainties in Modeling Interferences in Coherent and Energy Detectors for Spectrum Sensing: Ezio Biglieri (Universitat Pompeu Fabra, Barcelona, Spain)

11:30 Windowed Decoding of Spatially Coupled Codes: Aravind R. Iyengar (University of California, San Diego, USA); Paul H. Siegel (University of California, San Diego, USA); Ruediger L Urbanke (EPFL, Switzerland); Jack Wolf (UCSD, USA)
11:50 Reduced-Complexity Collaborative Decoding of Interleaved Reed-Solomon and Gabidulin Codes: Hans Kurzweil (University of Erlangen-Nuremberg, Germany); Mathis Seidl (University of Erlangen-Nuremberg, Germany); Johannes Huber (University of Erlangen-Nuremberg, Germany)
12:10 Threshold Saturation on Channels with Memory Via Spatial Coupling: Shrinivas Shrikant Kudekar (Los Alamos National Laboratory & New Mexico Consortium, USA); Kenta Kasai (Tokyo Institute of Technology, Japan)
12:30 Universality for the Noisy Slepian-Wolf Problem Via Spatial Coupling: Arvind Yedla (Texas A&M University, USA); Henry D Pfister (Texas A&M University, USA); Krishna Narayanan (Texas A&M University, USA)

11:30 Lattice Network Coding Via Signal Codes: Chen Feng (University of Toronto, Canada); Danilo Silva (Federal University of Santa Catarina, Brazil); Frank R. Kschischang (University of Toronto, Canada)
11:50 Coding for a Network Coded Fountain: Shenghao Yang (The Chinese University of Hong Kong, Hong Kong); Raymond W. Yeung (The Chinese University of Hong Kong, Hong Kong)
12:10 Linear Coding for Network Computing: Rathinakumar Appuswamy (IBM Research, USA); Massimo Franceschetti (University of California at San Diego, USA); Nikhil Karamchandani (University of California San Diego, USA); Ken Zeger (University of California, San Diego, USA)
12:30 On Network Error Correction Under a Secret Key Model: Danilo Silva (Federal University of Santa Catarina, Brazil)

11:30 Sequential Analysis in High-Dimensional Multiple Testing and Sparse Recovery: Matthew Malloy (University of Wisconsin, USA); Robert Nowak (University of Wisconsin - Madison, USA)
11:50 Performance Bounds for Active Sequential Hypothesis Testing: Mohammad Naghshvar (University of California, San Diego, USA); Tara Javidi (UCSD, USA)
12:10 On Reliability Approach to Multiple Hypotheses Testing and to Identification of Probability Distributions of Two Stochastically Related Objects: Evgueni Haroutunian (Institute for Informatics and Automation Problems, Armenia); Aram Yessayan (Istitute for Informatics and Automation Problems, Armenia)
12:30 Nearly Minimax Changepoint Detection Procedures: Alexander G Tartakovsky (University of Southern California & Vice President, Argo Science Corp., USA); Moshe Pollak (The Hebrew University of Jerusalem, Israel)

11:30 Bargaining Solution for Partial Orthogonal Transmission Over Frequency Selective Interference Channel: Ephraim Zehavi (Bar-Ilan University, Israel); Amir Leshem (Bar-Ilan University, Israel)
11:50 Coalition Games for Transmitter Cooperation in Wireless Networks: Srinivas Yerramalli (University of Southern California, USA); Rahul Jain (University of Southern California, USA); Urbashi Mitra (University of Southern California, USA)
12:10 Spectrum Pricing Games with Arbitrary Bandwidth Availability Probabilities: Gaurav S. Kasbekar (University of Pennsylvania, USA); Saswati Sarkar (University of Pennsylvania, USA)
12:30 Mixed Strategy Nash Equilibrium in Two-User Resource Allocation Games: Jie Gao (University of Alberta, Canada); Sergiy A. Vorobyov (University of Alberta, Canada); Hai Jiang (University of Alberta, Canada)

11:30 Diversity-Multiplexing Tradeoff in a MIMO Gaussian Interference Channel with a Relay: Ivana Mari? (Aviat Networks, USA); Andrea Goldsmith (Stanford University, USA)
11:50 Capacity to Within 3 Bits for a Class of Gaussian Interference Channels with a Cognitive Relay: Stefano Rini (UIC, USA); Daniela Tuninetti (University of Illinois at Chicago, USA); Natasha Devroye (University of Illinois at Chicago, USA)
12:10 The Capacity of the Interference Channel with a Cognitive Relay in Strong Interference: Stefano Rini (UIC, USA); Daniela Tuninetti (University of Illinois at Chicago, USA); Natasha Devroye (University of Illinois at Chicago, USA); Andrea Goldsmith (Stanford University, USA)
12:30 Interference Alignment Aided by Relays for the Quasi-Static X Channel: Dong-sup Jin (Seoul National University, Korea); Jong-Seon No (Seoul National University, Korea); Dong-Joon Shin (Hanyang University, Korea)

11:30 Key Reduction of McEliece's Cryptosystem Using List Decoding: Morgan Barbier (?cole Polytechnique LIX - INRIA Saclay ?le de France, France); Paulo Barreto (Sao Paulo State University, Brazil)
11:50 Constructing Boolean Functions in Odd Number of Variables with Maximum Algebraic Immunity: Konstantinos Limniotis (National and Kapodistrian University of Athens, Greece); Nicholas Kolokotronis (University of Peloponnese, Greece); Nicholas Kalouptsidis (National and Kapodistrian University of Athens, Greece)
12:10 Multi-Dimensional Arrays for Watermarking: Oscar Moreno (Gauss Research Laboratory, Puerto Rico); Andrew Z Tirkel (Scientific Technology, Australia)
12:30 Almost Separating and Almost Secure Frameproof Codes: Marcel Fernandez (Technical University of Catalonia, Spain); Grigory Kabatiansky (IITT, Moscow, Russia); Jose Moreira (Technical University of Catalonia, Spain)

11:30 Sum Rate Analysis of Rayleigh Product MIMO Channels with Linear MMSE Receiver: Caijun Zhong (Queen's University Belfast, United Kingdom); Tharmalingam Ratnarajah (Queens University of Belfast, United Kingdom)
11:50 On the Constrained Capacity of Multi-Antenna Fading Coherent Channels with Discrete Inputs: Miguel Rodrigues (University of Porto, Portugal)
12:10 Multiple-Unicast in Fading Wireless Networks: A Separation Scheme is Approximately Optimal: Sreeram Kannan (University of Illinois, Urbana-Champaign, USA); Pramod Viswanath (University of Illinois, Urbana-Champaign, USA)

11:30 Scalar Quantization with R?nyi Entropy Constraint: Wolfgang Kreitmeier (University of Passau, Germany); Tamas Linder (Queen's University, Canada)
11:50 Asymmetric Quantizers are Better At Low SNR: Tobias Koch (University of Cambridge, United Kingdom); Amos Lapidoth (ETHZ, Switzerland)
12:10 A Necessary and Sufficient Condition for Transform Optimality in Source Coding: Emrah Akyol (UCSB, USA); Kenneth Rose (University of California, Santa Barbara, USA)
12:30 Low-Precision A/D Conversion for Maximum Information Rate in Channels with Memory: Georg Zeitler (Technische Universit?t M?nchen, Germany); Andrew C. Singer (University of Illinois at Urbana Champaign, USA); Gerhard Kramer (Technische Universit?t M?nchen, Germany)

11:30 Weighted Sum Rate Maximization for the MIMO X Channel Through MMSE Precoding: Adrian Agustin (Technical University of Catalonia (UPC), Spain); Josep Vidal (Universitat Polit?cnica de Catalunya, Spain)
11:50 When Alamouti Codes Meet Interference Alignment: Transmission Schemes for Two-User X Channel: Liangbin Li (University of California, Irvine, USA); Hamid Jafarkhani (University of California, Irvine, USA); Syed Ali Jafar (University of California Irvine, USA)
12:10 Interference Alignment Over Asynchronous X Networks: Hossein Najafi (University of Waterloo, Canada); Mehdi Torbatian (University of Waterloo, Canada); Mohamed Oussama Damen (University of Waterloo, Canada)

14:20 Global Estimation of Anatomical Connection Strength in Diffusion MRI Tractography by Message-Passing: Milos Ivkovi? (Cornell University & Weill Cornell Medical School, USA); Ashish Raj (Weill Cornell Medical College, USA)
14:40 Absorbing Set Spectrum Approach for Practical Code Design: Jiadong Wang (UCLA, USA); Lara Dolecek (UCLA, USA); Zhengya Zhang (University of Michigan, USA); Richard Wesel (University of California, Los Angeles, USA)
15:00 An Optimal Partial Decoding Algorithm for Rateless Codes: Valerio Bioglio (Universit? di Torino, Italy); Marco Grangetto (Universit? di Torino, Italy); Rossano Gaeta (Universit? di Torino, Italy); Matteo Sereno (University of Torino, Italy)
15:20 Degree Distribution Optimization in Raptor Network Coding: Nikolaos Thomos (Swiss Federal Institute of Technology - EPFL, Switzerland); Pascal Frossard (Swiss Federal Institute of Technology - EPFL, Switzerland)

14:20 A General Framework for Constructing Fast-Decodable Asymmetric Space-Time Codes: Roope Vehkalahti (University of Turku, Finland); Camilla J. Hollanti (University of Turku & Turku Centre for Computer Science, Finland)
14:40 Maximum Rate of 3- and 4-Real-Symbol ML Decodable Unitary Weight STBCs: Teja Damodaram Bavirisetti (Indian Institute of Science, India); B. Sundar Rajan (Indian Institute of Science, India)
15:00 An Algebraic Look Into MAC-DMT of Lattice Space-Time Codes: Roope Vehkalahti (University of Turku, Finland); Hsiao-feng Francis Lu (National Chiao Tung University, Taiwan)
15:20 The Complexity of Sphere Decoding Perfect Codes Under a Vanishing Gap to ML Performance: Joakim Jald?n (KTH Royal Institute of Technology, Sweden); Petros Elia (EURECOM, France)

14:20 Impulsive Noise Estimation and Cancellation in DSL Using Orthogonal Clustering: Tareq Al-Naffouri (King Fahd University of Petroleum and Minerals, Saudi Arabia); Ahmed A. Quadeer (King Fahd University of Petroleum & Minerals, Saudi Arabia); Giuseppe Caire (University of Southern California, USA)
14:40 Computing Reliability Distributions of Windowed Max-Log-Map (MLM) Detectors: ISI Channels: Fabian Lim (Massachusetts Institute of Technology, USA); Aleksandar Kavcic (University of Hawaii, USA)
15:00 On Diversity Orders of Distortion Outage for Coherent Multi-Access Channels: Chih-Hong Wang (University of Melbourne, Australia); Alex Leong (University of Melbourne, Australia); Subhrakanti Dey (University of Melbourne, Australia)
15:20 Distributed Detection in Noisy Sensor Networks: Soummya Kar (Princeton University, USA); Ravi Tandon (Princeton University, USA); H. Vincent Poor (Princeton University, USA); Shuguang Cui (Texas A&M University, USA)

14:20 Optimal MaxWeight Scheduling in a Multihop Wireless Network Via Branch and Bound: Pradeep Chathuranga Weeraddana (University of Oulu, Finland); Marian Codreanu (University of Oulu, Finland); Matti Latva-aho (UoOulu, Finland); Anthony Ephremides (University of Maryland at College Park, USA)
14:40 Optimal Offline Packet Scheduling on an Energy Harvesting Broadcast Link: Fatih Ozcelik (Middle East Technical University, Turkey); Hakan Erkal (Middle East Technical University & ASELSAN INC., Turkey); Elif Uysal-Biyikoglu (METU, Turkey)
15:00 Optimality of Binary Power-Control in a Single Cell Via Majorization: Hazer Inaltekin (The University of Melbourne, Australia); Stephen Hanly (National University of Singapore, Singapore)

14:20 Multiple Access Channel with States Known Noncausally At One Encoder and Only Strictly Causally At the Other Encoder: Abdellatif Zaidi (Universit? Paris-Est Marne La Vall?e, France); Pablo Piantanida (SUPELEC, France); Shlomo Shamai (The Technion, Israel)
14:40 Leveraging Strictly Causal State Information At the Encoders for Multiple Access Channels: Min Li (Penn State, USA); Osvaldo Simeone (New Jersey Institute of Technology, USA); Aylin Yener (Pennsylvania State University, USA)
15:00 Multiple-Access Channel with Delayed State Information Via Directed Information: Uria Basher (Ben-Gurion University, Israel); Avihay Shirazi (Ben-Gurion University, Israel); Haim H Permuter (Ben-Gurion University, Israel)
15:20 Spatially Coupled Codes Over the Multiple Access Channel: Shrinivas Shrikant Kudekar (Los Alamos National Laboratory & New Mexico Consortium, USA); Kenta Kasai (Tokyo Institute of Technology, Japan)

14:20 Assisted Common Information: Further Results: Vinod M Prabhakaran (EPFL, Switzerland); Manoj Prabhakaran (University of Illinois, Urbana-Champaign, USA)
14:40 On the Secrecy Degrees of Freedom of Multi-Antenna Wiretap Channels with Delayed CSIT: Sheng Yang (Supelec, France); Pablo Piantanida (SUPELEC, France); Mari Kobayashi (Supelec, France); Shlomo Shamai (The Technion, Israel)
15:00 Improved Rate-Equivocation Regions for Secure Cooperative Communication: Ninoslav Marina (Princeton University, USA); Hideki Yagi (The University of Electro-Communications, Japan); H. Vincent Poor (Princeton University, USA)
15:20 When is a Function Securely Computable?: Himanshu Tyagi (University of Maryland, College Park, USA); Prakash Narayan (University of Maryland, USA); Piyush Gupta (Bell Labs, Alcatel-Lucent, USA)

14:20 On Communication Over Unknown Sparse Frequency-Selective Block-Fading Channels: Arun Pachai Kannu (IIT Madras, India); Philip Schniter (The Ohio State University, USA)
14:40 Nearest Neighbour Decoding and Pilot-Aided Channel Estimation in Stationary Gaussian Flat-Fading Channels: Taufiq Asyhari (University of Cambridge, United Kingdom); Tobias Koch (University of Cambridge, United Kingdom); Albert Guill?n i F?bregas (University of Cambridge, United Kingdom)
15:00 On the Szeg?-Asymptotics for Doubly-Dispersive Gaussian Channels: Peter Jung (TU-Berlin, Heinrich-Hertz-Chair for Mobile Communication Technology & Fraunhofer German-Sino Lab for Mobile Communications - MCI, Germany)
15:20 Asymptotic Moments for Interference Mitigation in Correlated Fading Channels: Jakob Hoydis (SUP?LEC, France); M?rouane Debbah (Supelec, France); Mari Kobayashi (Supelec, France)

14:20 The Rate-Distortion Function for Product of Two Sources with Side-Information At Decoders: Shun Watanabe (Tokushima University, Japan)
14:40 Distributed Compression of Linear Functions: Partial Sum-Rate Tightness and Gap to Optimal Sum-Rate: Yang Yang (Texas A&M University, USA); Zixiang Xiong (Texas A&M University, USA)
15:00 Slepian-Wolf Type Problems on the Erasure Channel: Michael Luby (Qualcomm, Inc, USA); Amin Shokrollahi (EPFL, Switzerland)
15:20 Information Rates of Densely Sampled Gaussian Data: David Neuhoff (University Michigan, USA); Sandeep Pradhan (University Michigan, USA)

14:20 A Nonlinear Approach to Interference Alignment: Peyman Razaghi (University of Southern California, USA); Giuseppe Caire (University of Southern California, USA)
14:40 Interference Alignment with Per-Antenna Power Constraints: Jonathan Starr (University of Texas, USA); Omar El Ayach (The University of Texas at Austin, USA); Robert Heath (The University of Texas at Austin, USA)
15:00 Aligned Interference Neutralization and the Degrees of Freedom of the 2X2X2 Interference Channel: Tiangao Gou (University of California Irvine, USA); Syed Ali Jafar (University of California Irvine, USA); Sang-Woon Jeon (KAIST, Korea); Sae-Young Chung (KAIST, Korea)
15:20 Retrospective Interference Alignment: Hamed Maleki (University of California Irvine, USA); Syed Ali Jafar (University of California Irvine, USA); Shlomo Shamai (The Technion, Israel)

16:00 Extremes of Random Coding Error Exponents: Albert Guill?n i F?bregas (University of Cambridge, United Kingdom); Ingmar Land (University of South Australia, Australia); Alfonso Martinez (University of Cambridge, United Kingdom)
16:20 Random-Coding Bounds for Threshold Decoders: Error Exponent and Saddlepoint Approximation: Alfonso Martinez (University of Cambridge, United Kingdom); Albert Guill?n i F?bregas (University of Cambridge, United Kingdom)
16:40 New Techniques for Upper-Bounding the MLD Performance of Binary Linear Codes: Xiao Ma (Sun Yat-sen University, P.R. China); Jia Liu (Sun Yat-sen University, P.R. China); Bao-Ming Bai (Xidian University, P.R. China)

16:00 Optimum Joint Detection and Estimation: George V. Moustakides (University of Patras, Greece)
16:20 Multiple Access Demodulation in the Lifted Signal Graph with Spatial Coupling: Christian Schlegel (University of Alberta, Canada); Dmitri Truhachev (University of Alberta, Canada)
16:40 Constrained Epsilon-Equalizer Test for Multiple Hypothesis Testing: Lionel Fillatre (Universit? de Technologie de Troyes, France)
17:00 Linear Programming Based Detectors for Two-Dimensional Intersymbol Interference Channels: Shrinivas Shrikant Kudekar (Los Alamos National Laboratory & New Mexico Consortium, USA); Jason K Johnson (Los Alamos National Laboratory, USA); Michael Chertkov (Los Alamos National Laboratory, USA)

16:00 Capacity of the Ising Channel with Feedback: Ohad Elishco (Ben-Gurion University of the Negev, Israel); Haim H Permuter (Ben-Gurion University, Israel)
16:20 Limit Theorems for the Sample Entropy of Hidden Markov Chains: Guangyue Han (University of Hong Kong, Hong Kong)
16:40 Gibbs Models with a Variable Range of Interactions on Triangle Grid: Eugene Pechersky (Institute of Information Transmission Problems, RAS, Russia)

16:00 The Two-User Gaussian Fading Broadcast Channel: Amin Jafarian (The University of Texas, Austin, USA); Sriram Vishwanath (University of Texas at Austin, USA)
16:20 Gaussian Fading Broadcast Channels with CSI Only At the Receivers: An Improved Constant Gap: Roy Yates (Rutgers University, USA); Jing Lei (Rutgers University, USA)
16:40 Effective Capacity Region and Optimal Power Control for Fading Broadcast Channels: Deli Qiao (University of Nebraska-Lincoln, USA); M. Cenk Gursoy (University of Nebraska-Lincoln, USA); Senem Velipasalar (University of Nebraska-Lincoln, USA)
17:00 Recursive Stream Selection for CF MU-MIMO BC Precoders Design: Mustapha Amara (EURECOM & Orange Labs (R&D Resa/Win), France); Dirk Slock (Eurecom, France); Yi Yuan-Wu (Orange Labs, France)

16:00 Modulation Diversity in Fading Channels with Quantized Receiver: Saif Khan Mohammed (Linkoping University & Dept. Electrical Enginerring (ISY), Sweden); Emanuele Viterbo (Monash University, Australia); Yi Hong (Monash University, Australia); A. Chockalingam (Indian Institute of Science, India)
16:20 Outage Probability Under Channel Distribution Uncertainty: Ioanna Ioannou (University of Cyprus, Cyprus); Charalambos D Charalambous (University of Cyprus, Cyprus); Sergey Loyka (University of Ottawa, Canada)
16:40 Scalar Coherent Fading Channel: Dispersion Analysis: Yury Polyanskiy (Princeton University, USA); Sergio Verd? (Princeton University, USA)

16:00 Zero-Delay Joint Source-Channel Coding for the Gaussian Wyner-Ziv Problem: Xuechen Chen (University of California Riverside, USA); Ertem Tuncel (UC Riverside, USA)
16:20 Rate-Distortion Functions for Source Coding with Complementary Side Information: Roy Timo (University of South Australia, Australia); Alex Grant (University of South Australia, Australia); Gerhard Kramer (Technische Universit?t M?nchen, Germany)
16:40 Robust Coding for Lossy Computing with Receiver-Side Observation Costs: Behzad Ahmadi (New Jersey Institute of Technology, USA); Osvaldo Simeone (New Jersey Institute of Technology, USA)
17:00 Cascade Source Coding with Erased Side Information: Ravi Tandon (Princeton University, USA); Soheil Mohajer (Princeton, Switzerland); H. Vincent Poor (Princeton University, USA)

16:00 Achievable Rates of MIMO-ISI Systems with Linear Precoding and Iterative LMMSE Detection: Xiaojun Yuan (City University of Hong Kong, Hong Kong); Li Ping (City University of Hong Kong, Hong Kong); Aleksandar Kavcic (University of Hawaii, USA)
16:20 Precoder Design and Convergence Analysis of MIMO Systems with Krylov Subspace Receivers: Jun Tong (The University of Newcastle, Australia); Peter J. Schreier (Universitaet Paderborn, Germany); Steve Weller (University of Newcastle, Australia)
16:40 A Low ML-Decoding Complexity, Full-Diversity, Full-Rate MIMO Precoder: Pavan K. Srinath (Indian Institute of Science, India); B. Sundar Rajan (Indian Institute of Science, India)
17:00 Optimal Lattices for MIMO Precoding: D?evdan Kapetanovi? (Lund University, Sweden); Hei Victor Cheng (Hong Kong University of Science and Technology, Hong Kong); Wai Ho Mow (Hong Kong University of Science and Technology & HKUST, Hong Kong); Fredrik Rusek (Lund University, Sweden)

Time	Blue 1	Blue 3	Green 10	Green 8	Green 9	Red 10	Red 11	Red 8	Red 9
Monday, August 1
08:30	P-01: Erdal Arikan, "Polar Coding: Status and Some New Directions" Plenary Lecture, Central Blue Hall
09:50	AC-01: Polar Codes I	W-01: Interference Alignment and Degrees of Freedom for Wireless Networks	S-01: Shannon Theoretic Source Coding	N-01: Session in the memory of Rudi Ahlswede	M-01: Gaussian Relay Networks I	C-01: Quantum Information I	E-01: Compressive Sensing and Statistics	Me-01: Constraint Coding I	G-01: Communication with Feedback
11:30	AC-02: Polar Codes II	W-02: Degrees of Freedom in Multiuser Communications	S-02: Universal Prediction and Communication	N-02: Network Communication Theory	M-02: Gaussian Relay Networks II	C-02: Quantum Information II	E-02: Graphical Models	Me-02: Constraint Coding II	G-02: Channel Capacity I
14:20	AC-03: LDPC Codes I	W-03: Communication Systems	S-03: Source Coding and Statistics	N-03: Network Coding Techniques	M-03: Interference Networks	C-03: Quantum Codes I	E-03: Compressive Sensing and Information Theory	Me-03: Sequences I	G-03: Channel Capacity II
16:00	AC-04: LDPC Codes II	W-04: CSI in Wireless Networks I	S-04: Topics in Source Coding	N-04: Cut-Flow Network Coding	M-04: Wiretap Channels	C-04: Quantum Codes II	E-04: Compressive Sensing in Signal Processing	Me-04: Sequences II	G-04: Channel Capacity III
Tuesday, August 2
08:30	P-02: Zhanna Reznikova, "Ants and Bits" Plenary Lecture, Central Blue Hall
09:50	AC-05: LDPC Codes III	W-05: Interference Alignment with Limited CSI	S-05: Joint Source Channel Coding	N-05: Network Coding Delay and Complexity	M-05: Cognitive Interference Channels	C-05: Algebraic Coding I	E-05: Pattern Recognition and Learning I	Me-05: Coding for Memories I	G-05: Shannon Theory I
11:30	AC-06: LDPC Codes IV	W-06: MIMO Communication	S-06: Data Compression I	N-06: Secure Network Coding	M-06: Multiple Access	C-06: Algebraic Coding II	E-06: Pattern Recognition and Learning II	Me-06: Coding for Memories II	G-06: Shannon Theory II
15:00	AC-07: LDPC Codes V	W-07: Diversity Multiplexing Trade Off in MIMO Systems	S-07: Data Compression II	N-07: Coding Issues in Network Coding	M-07: Gaussian Interference Channels	C-07: Algebraic Coding - III	E-07: Estimation	Me-07: Distributed Storage I	G-07: Network Games and Dynamics
16:40	AC-08: LDPC Codes VI	W-08: CSI in Wireless Networks II	S-08: Data Compression III	N-08: Relay Network Capacities	M-08: Interference Channels: Degrees of Freedom and Throughput	C-08: Coding Theory I	E-08: Algorithms for Compressive Sensing	Me-08: Distributed Storage II	G-08: Special Session on Information Theory and Neuroscience
Wednesday, August 3
08:30	P-03: Wojciech Szpankowski, "Algorithms, Combinatorics, Information, and Beyond" Plenary Lecture, Central Blue Hall
09:50	RR: Recent Results Poster Session Blue Foyer
11:10	AC-09: LDPC Codes VII	W-09: Detection with Multiple Users or Interference	S-09: Universal Compression	N-09: Relay Channels	M-09: Broadcast channels	C-09: DNA Codes	E-09: Estimation Theory	Me-09: Cryptography I	G-09: Wireless Networks
Thursday, August 4
08:30	P-04: Shlomo Shamai (Shitz), Shannon Lecture, "From Constrained Signaling to Network Interference Alignment via an Information-Estimation Perspective" Central Blue Hall
09:50	AC-10: LDPC Codes VIII	W-10: Communication Techniques	S-10: Multiple Terminal Source Coding I	N-10: Network Coding Theory	M-10: MIMO/MISO Broadcast Channels	C-10: Coding Theory II	E-10: Shannon Theory III	Me-10: Cryptography II	G-10: Delay and Stability in Wireless Networks
11:30	AC-11: LDPC Codes IX	W-11: Multiple Antenna Communication I	S-11: Multiple Terminal Source Coding II	N-11: Strategies for Relay Channels	M-11: Wireless Gaussian Broadcast Channels	C-11: Coding Theory III	E-11: Information Inequalities	Me-11: Cryptography III	G-11: Allocation in Wireless Networks
14:20	AC-12: LDPC Codes X	W-12: Multiple Antenna Communication II	S-12: Multiple Terminal Source Coding III	N-12: Relay Network Coding	M-12: Discrete Memoryless Interference Channel	C-12: Coding Theory IV	E-12: Shannon Theory in Communications and Statistics	Me-12: Coding for Memories III	G-12: Sensor Networks
16:00	AC-13: LDPC Codes XI	W-13: MIMO Interference Channels	S-13: Source Coding I	N-13: Two-Way Relay Channels	M-13: Multiple Access Capacity and Techniques	C-13: Coding Theory V	E-13: Matrix Completion and Rank Minimization	Me-13: Coding for Memories IV	G-13: Network Control
Friday, August 5
08:30	P-05: Vladimir Tikhomirov "Entropy in Information Theory and Functional Analysis" Plenary Lecture, Central Blue Hall
09:50	AC-14: LDPC Codes XII	W-14: Cognitive Communication	S-14: Source Coding II	N-14: Relaying in Wireless Networks	M-14: Deterministic Approach to Gaussian Channels	C-14: Coding Theory VI	E-14: Statistical Estimation	Me-14: Storage capacities	G-14: Delay and Stability in Networks
11:30	AC-15: LDPC Codes XIII	W-15: X Channels	S-15: Quantization	N-15: Wireless Communication over Fading Channels I	M-15: Interference Channels with Relaying	C-15: Coding Theory VII	E-15: Detection	Me-15: Cryptography IV	G-15: Game Theory in Networks
14:20	AC-16: LDPC Codes XIV	W-16: Interference Alignment	S-16: Distributed Source Coding	N-16: Wireless Communication over Fading Channels II	M-16: Multiple Access with State Information	C-16: Coding Theory VIII	E-16: Detection in Communication Systems I	Me-16: Cryptography V	G-16: Optimal Scheduling in Networks
16:00	AC-17: Error exponents	W-17: Precoding	S-17: Source Coding with Side Information	N-17: Wireless Channels	M-17: Fading Broadcast Channels		E-17: Detection in Communication Systems II		G-17: Random Fields

Program for 2011 IEEE International Symposium on Information Theory Proceedings

Monday, August 1

Tuesday, August 2

Wednesday, August 3

Thursday, August 4

Friday, August 5

Monday, August 1

08:30 - 09:30

P-01: Erdal Arikan, "Polar Coding: Status and Some New Directions" Plenary Lecture, Central Blue Hall

09:50 - 11:10

AC-01: Polar Codes I

C-01: Quantum Information I

E-01: Compressive Sensing and Statistics

G-01: Communication with Feedback

M-01: Gaussian Relay Networks I

Me-01: Constraint Coding I

N-01: Session in the memory of Rudi Ahlswede

S-01: Shannon Theoretic Source Coding

W-01: Interference Alignment and Degrees of Freedom for Wireless Networks

11:30 - 12:50

AC-02: Polar Codes II

C-02: Quantum Information II

E-02: Graphical Models

G-02: Channel Capacity I

M-02: Gaussian Relay Networks II

Me-02: Constraint Coding II

N-02: Network Communication Theory

11:30 - 12:30

S-02: Universal Prediction and Communication

11:30 - 12:50

W-02: Degrees of Freedom in Multiuser Communications

14:20 - 15:40

AC-03: LDPC Codes I

14:20 - 15:20

C-03: Quantum Codes I

14:20 - 15:40

E-03: Compressive Sensing and Information Theory

G-03: Channel Capacity II

M-03: Interference Networks

Me-03: Sequences I

N-03: Network Coding Techniques

S-03: Source Coding and Statistics

14:20 - 15:20

W-03: Communication Systems

16:00 - 17:20

AC-04: LDPC Codes II

C-04: Quantum Codes II

16:00 - 17:40

E-04: Compressive Sensing in Signal Processing

G-04: Channel Capacity III

M-04: Wiretap Channels

Me-04: Sequences II

N-04: Cut-Flow Network Coding

S-04: Topics in Source Coding

W-04: CSI in Wireless Networks I

Tuesday, August 2

08:30 - 09:30

P-02: Zhanna Reznikova, "Ants and Bits" Plenary Lecture, Central Blue Hall

09:50 - 11:10

AC-05: LDPC Codes III

C-05: Algebraic Coding I

E-05: Pattern Recognition and Learning I

G-05: Shannon Theory I

M-05: Cognitive Interference Channels

Me-05: Coding for Memories I

N-05: Network Coding Delay and Complexity

S-05: Joint Source Channel Coding

W-05: Interference Alignment with Limited CSI

11:30 - 12:50

AC-06: LDPC Codes IV

C-06: Algebraic Coding II

E-06: Pattern Recognition and Learning II

G-06: Shannon Theory II

M-06: Multiple Access

Me-06: Coding for Memories II

N-06: Secure Network Coding

S-06: Data Compression I

W-06: MIMO Communication

15:00 - 16:20

AC-07: LDPC Codes V