Click on a time to jump ahead


S1.T1: Source Coding with Side Information

Time: Monday, July 2, 09:50 - 11:10
Location: Kresge Rehearsal B (030)
Session Chair: Luis Lastras, IBM - T.J. Watson Research Center
 
S1.T1.1: Data Processing Lower Bounds for Scalar Lossy Source Codes with Side Information at the Decoder
         Avraham Reani
         Neri Merhav
 
S1.T1.2: Graph-based Code Design for Quadratic-Gaussian Wyner-Ziv Problem with Arbitrary Side Information
         Yi-Peng Wei
         Shih-Chun Lin
         Yu-Hsiu Lin
         Hsuan-Jung Su
 
S1.T1.3: Source Coding With Delayed Side Information
         Osvaldo Simeone
         Haim Permuter
 
S1.T1.4: A Compression Algorithm Using Mis-aligned Side-information
         Nan Ma
         Kannan Ramchandran
         David Tse
 

S1.T2: Multiple Access Codes

Time: Monday, July 2, 09:50 - 11:10
Location: Kresge Auditorium (109)
Session Chair: David Tse, University of California, Berkeley
 
S1.T2.1: Construction of MIMO MAC Codes Achieving the Pigeon Hole Bound
         Toni Ernvall
         Roope Vehkalahti
 
S1.T2.2: On The Sum-Capacity of Gaussian MAC With Peak Constraint
         Babak Mamandipoor
         Kamyar Moshksar
         Amir K. Khandani
 
S1.T2.3: Expurgation for Discrete Multiple-Access Channels via Linear Codes
         Eli Haim
         Yuval Kochman
         Uri Erez
 
S1.T2.4: Simpler Achievable Rate Regions for Multiaccess with Finite Blocklength
         Ebrahim MolavianJazi
         J. Nicholas Laneman
 

S1.T3: Two-Unicast Networks

Time: Monday, July 2, 09:50 - 11:10
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Salman Avestimehr, Cornell University
 
S1.T3.1: On Two Unicast Wireless Networks with Destination-to-Source Feedback
         I-Hsiang Wang
 
S1.T3.2: On Degrees of Freedom of Layered Two Unicast Networks with Delayed CSIT
         I-Hsiang Wang
         Suhas Diggavi
 
S1.T3.3: Sum Secure Degrees of Freedom of Two-Unicast Layered Wireless Networks
         Jianwei Xie
         Sennur Ulukus
 
S1.T3.4: Approximate Ergodic Capacity of a Class of Fading 2-user 2-hop Networks
         Sang-Woon Jeon
         Chien-Yi Wang
         Michael Gastpar
 

S1.T4: Secrecy Models in Wiretap Channels

Time: Monday, July 2, 09:50 - 11:10
Location: Stratton 20 Chimneys (306)
Session Chair: Paul Cuff, Princeton University
 
S1.T4.1: Broadcast Channels with Confidential Messages by Randomness Constrained Stochastic Encoder
         Shun Watanabe
         Yasutada Oohama
 
S1.T4.2: Secrecy Is Cheap if the Adversary Must Reconstruct
         Curt Schieler
         Paul Cuff
 
S1.T4.3: Imperfect Secrecy in Wiretap Channel II
         Fan Cheng
         Raymond W. Yeung
         Kenneth Shum
 
S1.T4.4: Strong Secrecy in Compound Broadcast Channels with Confidential Messages
         Rafael Wyrembelski
         Holger Boche
 

S1.T5: List Decoding and Reed-Solomon Codes

Time: Monday, July 2, 09:50 - 11:10
Location: Kresge Little Theatre (035)
Session Chair: Ilya Dumer, University of California, Riverside
 
S1.T5.1: Burst list decoding of interleaved Reed-Solomon codes
         Tom Kolan
         Ron Roth
 
S1.T5.2: List Decoding Algorithms based on Gröbner Bases for General One-Point AG Codes
         Olav Geil
         Ryutaroh Matsumoto
         Diego Ruano
 
S1.T5.3: An algorithm for list decoding number field codes
         Jean-Francois Biasse
         Guillaume Quintin
 
S1.T5.4: A Lifting Decoding Scheme and its Application to Interleaved Linear Codes
         Guillaume Quintin
 

S1.T6: Combinatorial Problems in Coding

Time: Monday, July 2, 09:50 - 11:10
Location: Kresge Rehearsal A (033)
Session Chair: Olgica Milenkovic, University of Illinois, Urbana-Champaign
 
S1.T6.1: Translation association schemes, poset metrics, and the shape enumerator of codes
         Alexander Barg
         Marcelo Firer
 
S1.T6.2: On the Uncertainty of Information Retrieval in Associative Memories
         Eitan Yaakobi
         Jehoshua Bruck
 
S1.T6.3: On q-ary antipodal matchings and applications
         Erik Ordentlich
         Ron Roth
         Gadiel Seroussi
 
S1.T6.4: Optimal Family of q-ary Codes Obtained From a Substructure of Generalised Hadamard Matrices
         Carl Bracken
         Yeow Meng Chee
         Punarbasu Purkayastha
 

S1.T7: Gaussian Channels

Time: Monday, July 2, 09:50 - 11:10
Location: Stratton (407)
Session Chair: Dongning Guo, Northwestern University
 
S1.T7.1: High-Rate Superposition Codes with Iteratively Optimal Estimates
         Andrew Barron
         Sanghee Cho
 
S1.T7.2: The Capacity of the Multi-MMSE Constrained Gaussian Channel
         Ronit Bustin
         Shlomo (Shitz) Shamai
 
S1.T7.3: Expurgated Infinite Constellations at Finite Dimensions
         Amir Ingber
         Ram Zamir
 
S1.T7.4: The Capacity Loss of Dense Constellations
         Tobias Koch
         Alfonso Martinez
         Albert Guillén i Fàbregas
 

S1.T8: Information Theoretic Tools and Properties

Time: Monday, July 2, 09:50 - 11:10
Location: Stratton (491)
Session Chair: Peter Harremoes, Copenhagen Business College
 
S1.T8.1: On Optimum Strategies for Minimizing the Exponential Moments of a Loss Function
         Neri Merhav
 
S1.T8.2: Minimization of Entropy Functionals Revisited
         Imre Csiszar
         Frantisek Matúš
 
S1.T8.3: Shannon Entropy Convergence Results in the Countable Infinite Case
         Jorge Silva
         Patricio Parada
 
S1.T8.4: On the equivalence between Stein identity and de Bruijn identity
         Sangwoo Park
         Erchin Serpedin
         Khalid Qaraqe
 

S1.T9: Theory of Quantum Error Correction

Time: Monday, July 2, 09:50 - 11:10
Location: Stratton West Lounge (201)
Session Chair: Iryna Andriyanova, ENSEA / Université de Cergy-Pontoise
 
S1.T9.1: Sphere Packing Bound for Quantum Channels
         Marco Dalai
 
S1.T9.2: Stabilizer Codes over Frobenius Rings
         Sushma Nadella
         Andreas Klappenecker
 
S1.T9.3: Nice Nearrings
         Andreas Klappenecker
 
S1.T9.4: Asymmetric quantum codes obtained from code expansion
         Giuliano La Guardia
 

S2.T1: Network Source Coding with Side Information

Time: Monday, July 2, 11:30 - 12:50
Location: Kresge Rehearsal B (030)
Session Chair: Neri Merhav, Technion - Israel Institute of Technology
 
S2.T1.1: A General Formula of Rate-Distortion Functions for Source Coding with Side Information at Many Decoders
         Tetsunao Matsuta
         Tomohiko Uyematsu
 
S2.T1.2: On the Heegard-Berger Problem with Common Reconstruction Constraints
         Behzad Ahmadi
         Ravi Tandon
         Osvaldo Simeone
         H. Vincent Poor
 
S2.T1.3: Distributed and Cascade Lossy Source Coding with a Side Information "Vending Machine"
         Behzad Ahmadi
         Osvaldo Simeone
 
S2.T1.4: Information Masking and Amplification: The Source Coding Setting
         Thomas Courtade
 

S2.T2: Variations on Broadcast Channels

Time: Monday, July 2, 11:30 - 12:50
Location: Kresge Auditorium (109)
Session Chair: Chandra Nair, Chinese University of Hong Kong
 
S2.T2.1: Multiple Description Coding Based Compress-and-Forward for the Broadcast Relay Channel
         Seçkin Anıl Yıldırım
         Melda Yuksel
 
S2.T2.2: Broadcast Correlated Gaussians: the Vector-Scalar Case
         Lin Song
         Jun Chen
         Chao Tian
 
S2.T2.3: Quadratic Gaussian Source Broadcast with Individual Bandwidth Mismatches
         Louis Tan
         Ashish Khisti
         Emina Soljanin
 
S2.T2.4: The Broadcast Approach Under Mixed Delay Constraints
         Kfir Cohen
         Avi Steiner
         Shlomo (Shitz) Shamai
 

S2.T3: Multi-Hop Multi-Flow Wireless Networks

Time: Monday, July 2, 11:30 - 12:50
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Pramod Viswanath, University of Illinois, Urbana-Champaign
 
S2.T3.1: Is Gaussian Noise the Worst-Case Additive Noise in Wireless Networks?
         Ilan Shomorony
         Salman Avestimehr
 
S2.T3.2: An Asymptotically Optimal Push-Pull Method for Multicasting over a Random Network
         Vasuki Swamy
         Rajesh Sundaresan
         Pramod Viswanath
 
S2.T3.3: Optimized Flow Allocation for Anonymous Communication in Multipath Wireless Networks
         Chouchang Yang
         Basel Alomair
         Radha Poovendran
 
S2.T3.4: Can geographic routing scale when nodes are mobile?
         Dinesh Ramasamy
         Upamanyu Madhow
 

S2.T4: Wiretap Channels with Feedback, Side Information, and Common Messaes

Time: Monday, July 2, 11:30 - 12:50
Location: Stratton 20 Chimneys (306)
Session Chair: Yasutada Oohama, University of Electro-Communications
 
S2.T4.1: Broadcasting over Fading Wiretap Channels
         Yingbin Liang
         Lifeng Lai
         H. Vincent Poor
         Shlomo (Shitz) Shamai
 
S2.T4.2: On the Ergodic Secret Message Capacity of the Wiretap Channel with Finite-Rate Feedback
         Zouheir Rezki
         Ashish Khisti
         Mohamed-Slim Alouini
 
S2.T4.3: Capacity Region of Non-degraded Wiretap Channel with Noiseless feedback
         Bin Dai
         Han Vinck
         Yuan Luo
         Zhuojun Zhuang
 
S2.T4.4: An Achievable Region for the Wiretap Multiple-Access Channel with Common Message
         Moritz Wiese
         Holger Boche
 

S2.T5: Reed-Muller Codes

Time: Monday, July 2, 11:30 - 12:50
Location: Kresge Little Theatre (035)
Session Chair: Alexander Barg, University of Maryland
 
S2.T5.1: Projected Subcodes of the second order binary Reed-Muller Code
         Matthieu Legeay
         Pierre Loidreau
 
S2.T5.2: Spherically punctured biorthogonal codes
         Ilya Dumer
         Olga Kapralova
 
S2.T5.3: Multiplicative secret sharing schemes from Reed-Muller type codes
         Iwan Duursma
         Jiashun Shen
 
S2.T5.4: Partial Permutation Decoding for Abelian Codes
         José Bernal-Buitrago
         Juan Simón
 

S2.T6: Constrained Coding

Time: Monday, July 2, 11:30 - 12:50
Location: Kresge Rehearsal A (033)
Session Chair: Ron Roth, Technion - Israel Institute of Technology
 
S2.T6.1: On embedding conditions of shifts of finite type into the Fibonacci-Dyck shift
         Hiroshi Fujisaki
 
S2.T6.2: Approximately Counting the Number of Constrained Arrays via the Sum-Product Algorithm
         Farzad Parvaresh
         Pascal Vontobel
 
S2.T6.3: On Codes for Structured Bursts
         Luis Lastras-Montaño
         Mario Blaum
 
S2.T6.4: Erasure Coding for Real-Time Streaming
         Derek Leong
         Tracey Ho
 

S2.T7: Capacity of Gaussian Channels

Time: Monday, July 2, 11:30 - 12:50
Location: Stratton (407)
Session Chair: Sae-Young Chung, KAIST
 
S2.T7.1: On the Capacity of Additive White Alpha-Stable Noise Channels
         Jihad Fahs
         Ibrahim Abou-Faycal
 
S2.T7.2: Bounds on the Capacity of the Additive Inverse Gaussian Noise Channel
         Hui-Ting Chang
         Stefan Moser
 
S2.T7.3: Achievable Rates of Gaussian Channels with Realistic Duty Cycle and Power Constraints
         Hui Li
         Dongning Guo
 
S2.T7.4: An Efficient Algorithm to Calculate BICM Capacity
         Georg Böcherer
         Fabian Altenbach
         Alex Alvarado
         Steven Corroy
         Rudolf Mathar
 

S2.T8: Distributed Detection and Estimation

Time: Monday, July 2, 11:30 - 12:50
Location: Stratton (491)
Session Chair: Henry Pfister, Texas A&M University
 
S2.T8.1: Quantization Effect On Second Moment of Log-Likelihood Ratio and Its Application to Decentralized Sequential Detection
         Yan Wang
         Yajun Mei
 
S2.T8.2: The sufficiency principle for decentralized data reduction
         Ge Xu
         Biao Chen
 
S2.T8.3: Nonparametric Decentralized Detection Based on Weighted Count Kernel
         Jiayao Hu
         Yingbin Liang
         Eric Xing
 
S2.T8.4: Distributed Estimation in Multi-Agent Networks
         Lalitha Sankar
         H. Vincent Poor
 

S2.T9: Quantum Codes from Classical Codes,

Time: Monday, July 2, 11:30 - 12:50
Location: Stratton West Lounge (201)
Session Chair: Joanne Hall, Charles University in Prague
 
S2.T9.1: Quantum polar codes for arbitrary channels
         Mark Wilde
         Joseph Renes
 
S2.T9.2: A Construction of Quantum Codes via A Class of Classical Polynomial Codes
         Lingfei Jin
         Chaoping Xing
 
S2.T9.3: Quantum LDPC codes obtained by non-binary constructions
         Iryna Andriyanova
         Denise Maurice
         Jean-Pierre Tillich
 
S2.T9.4: Improved quantum hypergraph-product LDPC codes
         Alexey Kovalev
         Leonid Pryadko
 

S3.T1: Lossy Source Coding

Time: Monday, July 2, 14:40 - 16:20
Location: Kresge Rehearsal B (030)
Session Chair: Yiannis Kontoyiannis, Athens University of Economics & Business
 
S3.T1.1: On Real-Time and Causal Secure Source Coding
         Yonatan Kaspi
         Neri Merhav
 
S3.T1.2: Rate-Distortion Behavior at Low Distortion for Densely Sampled Gaussian Data
         David Neuhoff
         Sandeep Pradhan
 
S3.T1.3: Pointwise lossy source coding theorem for sources with memory
         Barlas Oğuz
         Venkat Anantharam
 
S3.T1.4: Gaussian Rate-Distortion via Sparse Linear Regression over Compact Dictionaries
         Ramji Venkataramanan
         Antony Joseph
         Sekhar Tatikonda
 
S3.T1.5: Lossy Source Coding via Spatially Coupled LDGM Ensembles
         Vahid Aref
         Nicolas Macris
         Ruediger Urbanke
         Marc Vuffray
 

S3.T2: Three-Receiver Broadcast Channels

Time: Monday, July 2, 14:40 - 16:20
Location: Kresge Auditorium (109)
Session Chair: Yossi Steinberg, Technion - Israel Institute of Technology
 
S3.T2.1: On Three-Receiver More Capable Channels
         Chandra Nair
         Lingxiao Xia
 
S3.T2.2: The Capacity Region of Some Classes of Parallel Degraded Broadcast Channels with Three Receivers and Three-Degraded Message Sets
         Hon Fah Chong
         Ying-Chang Liang
 
S3.T2.3: Broadcast Capacity Regions with Three Receivers and Message Cognition
         Tobias Oechtering
         Michele Wigger
         Roy Timo
 
S3.T2.4: Three-Receiver Broadcast Channels with Side Information
         Saeed Hajizadeh
         Ghosheh Abed Hodtani
 
S3.T2.5: Is Non-Unique Decoding Necessary?
         Shirin Saeedi Bidokhti
         Vinod Prabhakaran
         Suhas Diggavi
 

S3.T3: *-and-Forward Relaying

Time: Monday, July 2, 14:40 - 16:20
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Pablo Piantanida, SUPELEC
 
S3.T3.1: Blind Compute-and-Forward
         Chen Feng
         Danilo Silva
         Frank Kschischang
 
S3.T3.2: Rateless Coded Hybrid Amplify/Decode-Forward Cooperation for Wireless Multicast
         Talha Khan
         Momin Uppal
         Anders Høst-Madsen
         Zixiang Xiong
 
S3.T3.3: Dynamic QMF for Half-Duplex Relay Networks
         Ayfer Özgür
         Suhas Diggavi
 
S3.T3.4: Joint Optimization of The Transmit Covariance and The Relay Precoder in General Gaussian Amplify-and-Forward Relay Channels
         Ramy Gohary
         Halim Yanikomeroglu
 
S3.T3.5: Layered Quantize-Forward For The Two-Way Relay Channel
         Hieu Do
         Tobias Oechtering
         Mikael Skoglund
 

S3.T4: Secure Communications

Time: Monday, July 2, 14:40 - 16:20
Location: Stratton 20 Chimneys (306)
Session Chair: Gerhard Kramer, Technische Universität München
 
S3.T4.1: Broadcasting Private Messages Securely
         László Czap
         Vinod Prabhakaran
         Suhas Diggavi
         Christina Fragouli
 
S3.T4.2: On Private Broadcasting over Independent Parallel Channels
         Ashish Khisti
         Tie Liu
 
S3.T4.3: Degraded Broadcast Channel with Noncausal Side Information, Confidential Messages and Noiseless Feedback
         Bin Dai
         Han Vinck
         Yuan Luo
         Zhuojun Zhuang
 
S3.T4.4: On Optimal Signaling over Secure MIMO Channels
         Sergey Loyka
         Charalambos Charalambous
 
S3.T4.5: Square Root Law for Communication with Low Probability of Detection on AWGN Channels
         Boulat Bash
         Dennis Goeckel
         Don Towsley
 

S3.T5: Spatially-Coupled Coding

Time: Monday, July 2, 14:40 - 16:20
Location: Kresge Little Theatre (035)
Session Chair: G. David Forney, Massachusetts Institute of Technology
 
S3.T5.1: Spatially Coupled Ensembles Universally Achieve Capacity under Belief Propagation
         Shrinivas Kudekar
         Thomas Richardson
         Ruediger Urbanke
 
S3.T5.2: How to Prove the Maxwell Conjecture Via Spatial Coupling - A Proof of Concept
         Andrei Giurgiu
         Nicolas Macris
         Ruediger Urbanke
 
S3.T5.3: Spatially-Coupled Binary MacKay-Neal Codes for Channels with Non-Binary Inputs and Affine Subspace Outputs
         Kenta Kasai
         Takayuki Nozaki
         Kohichi Sakaniwa
 
S3.T5.4: Improving Spatially Coupled LDPC Codes by Connecting Chains
         Dmitri Truhachev
         David Mitchell
         Michael Lentmaier
         Daniel Costello
 
S3.T5.5: Distance Spectrum Estimation of LDPC Convolutional Codes
         Hua Zhou
         David Mitchell
         Norbert Goertz
         Daniel Costello
 

S3.T6: Codes and Their Applications

Time: Monday, July 2, 14:40 - 16:20
Location: Kresge Rehearsal A (033)
Session Chair: Gadiel Seroussi, HP Labs and U. de la Republica, Uruguay
 
S3.T6.1: Spatially-Coupled Random Access on Graphs
         Gianluigi Liva
         Enrico Paolini
         Michael Lentmaier
         Marco Chiani
 
S3.T6.2: Biff (Bloom Filter) Codes: Fast Error Correction for Large Data Sets
         Michael Mitzenmacher
         George Varghese
 
S3.T6.3: Distributed Rateless Coding with Cooperative Sources
         Mahyar Shirvanimoghaddam
         Yonghui Li
         Branka Vucetic
 
S3.T6.4: On Matching Short LDPC Codes with Spectrally-Efficient Modulation
         Stefan Nowak
         Ruediger Kays
 
S3.T6.5: On the Power Transfer of Error-Control Codes for RFID Communications
         Guang Yang
         Eirik Rosnes
         Angela Isabel Barbero
         Øyvind Ytrehus
 

S3.T7: Deletion Channels

Time: Monday, July 2, 14:40 - 16:20
Location: Stratton (407)
Session Chair: Marcelo Weinberger, Hewlett-Packard Laboratories
 
S3.T7.1: A characterization of the number of subsequences obtained via the deletion channel
         Yuvalal Liron
         Michael Langberg
 
S3.T7.2: Adaptive Synchronization Marker for Insertion/Deletion/Substitution Error Correction
         Masato Inoue
         Haruhiko Kaneko
 
S3.T7.3: A Coloring Approach to Constructing Deletion Correcting Codes from Constant Weight Subgraphs
         Daniel Cullina
         Ankur Kulkarni
         Negar Kiyavash
 
S3.T7.4: Mutual Information for a Deletion Channel
         Michael Drmota
         Wojciech Szpankowski
         Krishnamurthy Viswanathan
 

S3.T8: Directed Information, Common Information, and Divergence

Time: Monday, July 2, 14:40 - 16:20
Location: Stratton (491)
Session Chair: Andrew Barron, Yale University
 
S3.T8.1: Directed Information on Abstract Spaces: Properties and Extremum Problems
         Charalambos Charalambous
         Photios Stavrou
 
S3.T8.2: Universal Estimation of Directed Information via Sequential Probability Assignments
         Jiantao Jiao
         Haim Permuter
         Lei Zhao
         Young-Han Kim
         Tsachy Weissman
 
S3.T8.3: Lossy Common Information of Two Dependent Random Variables
         Kumar Viswanatha
         Emrah Akyol
         Kenneth Rose
 
S3.T8.4: Information Divergence is more chi square distributed than the chi squared statistic
         Peter Harremoës
         Gábor Tusnády
 
S3.T8.5: Application of Information-Type Divergences to Constructing Multiple-priors and Variational Preferences
         Amir Ahmadi-Javid
 

S3.T9: Communication Problems in Quantum Optics

Time: Monday, July 2, 14:40 - 16:20
Location: Stratton West Lounge (201)
Session Chair: Robert Calderbank, Duke University
 
S3.T9.1: The Ultimate Limits of Optical Communication Efficiency with Photon-Counting Receivers
         Sam Dolinar
         Baris Erkmen
         Bruce Moision
         Kevin Birnbaum
         Dariush Divsalar
 
S3.T9.2: Polar coding to achieve the Holevo capacity of a pure-loss optical channel
         Saikat Guha
         Mark Wilde
 
S3.T9.3: Explicit capacity-achieving receivers for optical communication and quantum reading
         Mark Wilde
         Saikat Guha
         Si-Hui Tan
         Seth Lloyd
 
S3.T9.4: Quantum M-ary Phase Shift Keying
         Ranjith Nair
         Brent Yen
         Saikat Guha
         Jeffrey H. Shapiro
         Stefano Pirandola
 

S4.T1: The Slepian-Wolf and CEO Problems

Time: Monday, July 2, 16:40 - 18:00
Location: Kresge Rehearsal B (030)
Session Chair: Ertem Tuncel, University of California, Riverside
 
S4.T1.1: On Lossless Universal Compression of Distributed Identical Sources
         Ahmad Beirami
         Faramarz Fekri
 
S4.T1.2: Polar Coding for the Slepian-Wolf Problem Based on Monotone Chain Rules
         Erdal Arıkan
 
S4.T1.3: On the Vector Gaussian L-Terminal CEO Problem
         Jia Wang
         Jun Chen
 
S4.T1.4: An Outer Bound for the Vector Gaussian CEO Problem
         Ersen Ekrem
         Sennur Ulukus
 

S4.T2: Capacity of Broadcast Channels

Time: Monday, July 2, 16:40 - 18:00
Location: Kresge Auditorium (109)
Session Chair: Emina Soljanin, Lucent Technology
 
S4.T2.1: On Marton's inner bound for broadcast channels
         Amin Gohari
         Chandra Nair
         Venkat Anantharam
 
S4.T2.2: The capacity region of the two-receiver vector Gaussian broadcast channel with private and common messages
         Yanlin Geng
         Chandra Nair
 
S4.T2.3: The State-Dependent Semideterministic Broadcast Channel
         Amos Lapidoth
         Ligong Wang
 
S4.T2.4: The Degraded Broadcast Channel with Action-Dependent States
         Yossef Steinberg
         Tsachy Weissman
 

S4.T3: Connectivity and Interference

Time: Monday, July 2, 16:40 - 18:00
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Massimo Franceschetti, University of California, San Diego
 
S4.T3.1: Percolation in Directed Random Geometric Graphs
         Olivier Dousse
 
S4.T3.2: Power Optimization on a Network: The effects of randomness
         Aris Moustakas
         Nicholas Bambos
 
S4.T3.3: Cooperation versus Interference in Large Wireless Relay Networks
         Andrés Altieri
         Leonardo Rey Vega
         Cecilia Galarza
         Pablo Piantanida
 
S4.T3.4: Interference and Throughput in Aloha-based Ad Hoc Networks with Isotropic Node Distribution
         Ralph Tanbourgi
         Holger Jäkel
         Leonid Chaichenets
         Friedrich Jondral
 

S4.T4: Structured Codes

Time: Monday, July 2, 16:40 - 18:00
Location: Stratton 20 Chimneys (306)
Session Chair: Ram Zamir, Tel-Aviv University
 
S4.T4.1: Capacity Achieving Linear Codes with Random Binary Sparse Generating Matrices over the Binary Symmetric Channel
         Abbasali Makhdoumi Kakhaki
         Hossein Karkeh Abadi
         Pedram Pad
         Hamid Saeedi
         Farokh Marvasti
         Kasra Alishahi
 
S4.T4.2: Nested Lattice Codes for Arbitrary Continuous Sources and Channels
         Aria Sahebi
         Sandeep Pradhan
 
S4.T4.3: Asymptotically Good Codes Over Non-Abelian Groups
         Aria Sahebi
         Sandeep Pradhan
 
S4.T4.4: Efficient Decoding of Permutation Codes Obtained from Distance Preserving Maps
         Yeow Meng Chee
         Punarbasu Purkayastha
 

S4.T5: Codes on Graphs

Time: Monday, July 2, 16:40 - 18:00
Location: Kresge Little Theatre (035)
Session Chair: Frank Kschischang, University of Toronto
 
S4.T5.1: Observability, Controllability and Local Reducibility of Linear Codes on Graphs
         David Forney
         Heide Gluesing-Luerssen
 
S4.T5.2: Reducing complexity of tail-biting trellises
         Heide Gluesing-Luerssen
         David Forney
 
S4.T5.3: A Graphical Revisit of the Krawtchouk Transform
         Yongyi Mao
         Terence Chan
 
S4.T5.4: A Factor-Graph Representation of Probabilities in Quantum Mechanics
         Hans-Andrea Loeliger
         Pascal Vontobel
 

S4.T6: Identifying Codes and Power Line Communications

Time: Monday, July 2, 16:40 - 18:00
Location: Kresge Rehearsal A (033)
Session Chair: Gerard Cohen, ENST Paris
 
S4.T6.1: Importance of Symbol Equity in Coded Modulation for Power Line Communications
         Yeow Meng Chee
         Han Mao Kiah
         Punarbasu Purkayastha
         Chengmin Wang
 
S4.T6.2: Optimal Equitable Symbol Weight Codes for Power Line Communications
         Yeow Meng Chee
         Han Mao Kiah
         Alan Ling
         Chengmin Wang
 
S4.T6.3: Codes for Locating Objects in Sensor Networks
         Ville Junnila
         Tero Laihonen
         Aline Parreau
 
S4.T6.4: New lower bounds for identifying codes in infinite grids
         Ville Junnila
         Tero Laihonen
 

S4.T7: Capacity of Finite-Alphabet Channels

Time: Monday, July 2, 16:40 - 18:00
Location: Stratton (407)
Session Chair: Tobias Koch, Universidad Carlos III de Madrid
 
S4.T7.1: Improved Upper Bounds on the Capacity of Binary Channels with Causal Adversaries
         Bikash Dey
         Sidharth Jaggi
         Michael Langberg
         Anand Sarwate
 
S4.T7.2: Finding the Capacity of a Quantized Binary-Input DMC
         Brian Kurkoski
         Hideki Yagi
 
S4.T7.3: On the Capacity of Binary Input Symmetric q-ary Output Channels with Synchronization Errors
         Mojtaba Rahmati
         Tolga Duman
 
S4.T7.4: Mutual Information and Relative Entropy over the Binomial and Negative Binomial Channels
         Camilo G. Taborda
         Fernando Pérez-Cruz
 

S4.T8: Information and Estimation

Time: Monday, July 2, 16:40 - 18:00
Location: Stratton (491)
Session Chair: George Atia, University of Illinois
 
S4.T8.1: Pointwise Relations between Information and Estimation in Gaussian Noise
         Kartik Venkat
         Tsachy Weissman
 
S4.T8.2: Estimation with a helper who knows the interference
         Yeow-Khiang Chia
         Rajiv Soundararajan
         Tsachy Weissman
 
S4.T8.3: Rate Distortion Codes for the Collective Estimation from Independent Noisy Observations
         Tatsuto Murayama
         Peter Davis
 
S4.T8.4: Mismatched MMSE Estimation of Multivariate Gaussian Sources
         Iñaki Esnaola
         Antonia Tulino
         H. Vincent Poor
 

S4.T9: Quantum Channels in Network Information Theory

Time: Monday, July 2, 16:40 - 18:00
Location: Stratton West Lounge (201)
Session Chair: Masahito Hayashi, Nagoya University
 
S4.T9.1: Classical codes for quantum broadcast channels
         Ivan Savov
         Mark Wilde
 
S4.T9.2: Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels
         Minglai Cai
         Ning Cai
         Christian Deppe
 
S4.T9.3: Partial decode-forward for quantum relay channels
         Ivan Savov
         Mark Wilde
         Mai Vu
 
S4.T9.4: Achieving the Han-Kobayashi inner bound for the quantum interference channel
         Pranab Sen
 

S5.T1: Multiterminal Source Coding

Time: Tuesday, July 3, 09:50 - 11:10
Location: Kresge Rehearsal B (030)
Session Chair: Osvaldo Simeone, New Jersey Institute of Technology
 
S5.T1.1: The Effect of Zero-rate Encoders in the Multi-terminal Source Coding Problem
         Badri Vellambi
 
S5.T1.2: Multiterminal Source Coding under Logarithmic Loss
         Thomas Courtade
         Tsachy Weissman
 
S5.T1.3: On Cooperation in Multi-Terminal Computation and Rate Distortion
         Milad Sefidgaran
         Aslan Tchamkerten
 
S5.T1.4: Polynomials and Computing Functions of Correlated Sources
         Sheng Huang
         Mikael Skoglund
 

S5.T2: Relay Channels

Time: Tuesday, July 3, 09:50 - 11:10
Location: Kresge Auditorium (109)
Session Chair: Ayfer Ozgur Aydin, Stanford University
 
S5.T2.1: An upper bound on relaying over capacity
         Feng Xue
 
S5.T2.2: Buffer-Aided Relaying in a Three Node Network
         Nikola Zlatanov
         Robert Schober
         Lutz Lampe
 
S5.T2.3: The Capacity Region of Restricted Multi-Way Relay Channels with Deterministic Uplinks
         Lawrence Ong
         Sarah Johnson
 
S5.T2.4: The Finite Field Multi-Way Relay Channel with Correlated Sources: Beyond Three Users
         Lawrence Ong
         Roy Timo
         Sarah Johnson
 

S5.T3: Energy-Efficient Communication

Time: Tuesday, July 3, 09:50 - 11:10
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Tony Ephremides, University of Maryland, College Park
 
S5.T3.1: Reliable versus Unreliable Transmission for Energy Efficient Transmission in Relay Networks
         Anders Høst-Madsen
         Nan Jiang
         Yang Yang
         Zixiang Xiong
 
S5.T3.2: Bounds on the Minimum Energy-Per-Bit for Bursty Traffic in Diamond Networks
         Ilan Shomorony
         Raul Etkin
         Farzad Parvaresh
         Salman Avestimehr
 
S5.T3.3: Impact of Channel and Source Variations on the Energy Efficiency under QoS Constraints
         Mustafa Ozmen
         M. Cenk Gursoy
 
S5.T3.4: Energy Efficient Greedy Link Scheduling and Power Control in wireless networks
         Arun Sridharan
         Changhee Joo
         Can Koksal
 

S5.T4: Finite Blocklength Analysis

Time: Tuesday, July 3, 09:50 - 11:10
Location: Stratton 20 Chimneys (306)
Session Chair: Yury Polyanskiy, Massachusetts Institute of Technology
 
S5.T4.1: Second-Order Achievable Rates in Random Number Generation for Mixed Sources
         Ryo Nomura
         Te Sun Han
 
S5.T4.2: Moderate Deviations Analysis of Binary Hypothesis Testing
         Igal Sason
 
S5.T4.3: The Log-Volume of Optimal Constant-Composition Codes for Memoryless Channels, Up to a Few Nats
         Pierre Moulin
 
S5.T4.4: Finite Blocklength Coding for Multiple Access Channels
         Yen-Wei Huang
         Pierre Moulin
 

S5.T5: Coding for L1 Distance and Asymmetric Errors

Time: Tuesday, July 3, 09:50 - 11:10
Location: Kresge Little Theatre (035)
Session Chair: Paul Siegel, University of California, San Diego
 
S5.T5.1: On Symmetric L1 distance error control codes and elementary symmetric functions
         Luca Tallini
         Bella Bose
 
S5.T5.2: On symmetric/asymmetric Lee distance error control codes and elementary symmetric functions
         Luca Tallini
         Bella Bose
 
S5.T5.3: New Constructions of Codes for Asymmetric Channels via Concatenation
         Markus Grassl
         Peter Shor
         Graeme Smith
         John Smolin
         Bei Zeng
 

S5.T6: Boolean Functions and Related Topics

Time: Tuesday, July 3, 09:50 - 11:10
Location: Kresge Rehearsal A (033)
Session Chair: Kyeongcheol Yang, Pohang University of Science and Technology (POSTECH)
 
S5.T6.1: Hyper-bent functions via Dillon-like exponents
         Sihem Mesnager
         Jean-Pierre Flori
 
S5.T6.2: New Classes of Generalized Boolean Bent Functions over Z_4
         Nian Li
         Xiaohu Tang
         Tor Helleseth
 
S5.T6.3: An Optimal Sampling Technique for Distinguishing Random S-boxes
         Paul Stankovski
         Martin Hell
 
S5.T6.4: Cross Recurrence Property of m-Sequences
         Farhad Hemmati
 

S5.T7: Continuous Time Channels and Shannon Ordering

Time: Tuesday, July 3, 09:50 - 11:10
Location: Stratton (407)
Session Chair: Maxim Raginsky, University of Illinois, Urbana-Champaign
 
S5.T7.1: Channel Capacity under General Nonuniform Sampling
         Yuxin Chen
         Yonina Eldar
         Andrea Goldsmith
 
S5.T7.2: Continuous Time Channels with Interference
         Ioana Ivan
         Michael Mitzenmacher
         Justin Thaler
         Henry Yuen
 
S5.T7.3: On Establishing the Shannon Ordering for Discrete Memoryless Channels
         Yuan Zhang
         Cihan Tepedelenlioglu
 
S5.T7.4: Ergodic Capacity Ordering of Fading Channels
         Adithya Rajan
         Cihan Tepedelenlioglu
 

S5.T8: Prediction and Estimation

Time: Tuesday, July 3, 09:50 - 11:10
Location: Stratton (491)
Session Chair: Urbashi Mitra, University of Southern California
 
S5.T8.1: Penalized Maximum Likelihood Methods for Finite Memory Estimators of Infinite Memory Processes
         Zsolt Talata
 
S5.T8.2: Piecewise Constant Prediction
         Erik Ordentlich
         Marcelo Weinberger
         Yihong Wu
 
S5.T8.3: Efficient Tracking of Large Classes of Experts
         András György
         Tamas Linder
         Gabor Lugosi
 

S5.T9: Secrecy in Quantum Communications

Time: Tuesday, July 3, 09:50 - 11:10
Location: Stratton West Lounge (201)
Session Chair: Ligong Wang, Massachusetts Institute of Technology
 
S5.T9.1: Precise evaluation of leaked information with universal2 privacy amplification in the presence of quantum attacker
         Masahito Hayashi
 
S5.T9.2: Quantum wiretap channel with non-uniform random number and its exponent of leaked information
         Masahito Hayashi
 
S5.T9.3: Entanglement Cost of Quantum Channels
         Mario Berta
         Fernando Brandao
         Matthias Christandl
         Stephanie Wehner
 
S5.T9.4: Mutually unbiased bases as submodules and subspaces
         Joanne Hall
         Jan Stovicek
 

S6.T1: Finite Blocklength Analysis for Source Coding

Time: Tuesday, July 3, 11:30 - 12:50
Location: Kresge Rehearsal B (030)
Session Chair: Tsachy Weissman, Stanford University
 
S6.T1.1: A Simple Technique for Bounding the Redundancy of Source Coding with Side Information
         Shigeaki Kuzuoka
 
S6.T1.2: The Dispersion of Slepian-Wolf Coding
         Vincent Tan
         Oliver Kosut
 
S6.T1.3: Moderate-Deviations of Lossy Source Coding for Discrete and Gaussian Sources
         Vincent Tan
 
S6.T1.4: Relations Between Redundancy Patterns of the Shannon Code and Wave Diffraction Patterns of Partially Disordered Media
         Neri Merhav
 

S6.T2: Code Design for Relay Channels

Time: Tuesday, July 3, 11:30 - 12:50
Location: Kresge Auditorium (109)
Session Chair: Lawrence Ong, The University of Newcastle
 
S6.T2.1: Code Design for Very Noisy Relay Channels
         Puripong Suthisopapan
         Kenta Kasai
         Anupap Meesomboon
         Virasit Imtawil
         Kohichi Sakaniwa
 
S6.T2.2: Algebraic Fast-Decodable Relay Codes for Distributed Communications
         Camilla Hollanti
         Nadya Markin
 
S6.T2.3: Superposition of Binary and Gaussian Codebooks to Relay Data in Diamond Networks
         Farzad Parvaresh
         Raul Etkin
 
S6.T2.4: Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channel
         Marina Ivashkina
         Iryna Andriyanova
         Pablo Piantanida
         Charly Poulliat
 

S6.T3: Energy Harvesting

Time: Tuesday, July 3, 11:30 - 12:50
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Patrick Mitran, University of Waterloo
 
S6.T3.1: Wireless Information Transfer with Opportunistic Energy Harvesting
         Liang Liu
         Rui Zhang
         Kee Chaing Chua
 
S6.T3.2: Optimal Save-Then-Transmit Protocol for Energy Harvesting Wireless Transmitters
         Shixin Luo
         Rui Zhang
         Teng Joon Lim
 
S6.T3.3: On Optimal Online Policies in Energy Harvesting Systems For Compound Poisson Energy Arrivals
         Patrick Mitran
 
S6.T3.4: Energy Cooperation in Energy Harvesting Wireless Communications
         Berk Gurakan
         Omur Ozel
         Jing Yang
         Sennur Ulukus
 

S6.T4: Distributed Applications

Time: Tuesday, July 3, 11:30 - 12:50
Location: Stratton 20 Chimneys (306)
Session Chair: Lalitha Sankar, Princeton University
 
S6.T4.1: Dynamic Intrusion Detection in Resource-Constrained Cyber Networks
         Keqin Liu
         Qing Zhao
 
S6.T4.2: A Byzantine Attack Defender: the Conditional Frequency Check
         Xiaofan He
         Huaiyu Dai
         Peng Ning
 
S6.T4.3: Distributed Ranking in Networks with Limited Memory and Communication
         Kyomin Jung
         Boyoung Kim
         Milan Vojnović
 
S6.T4.4: Degree-guided Map-Reduce Task Assignment with Data Locality Constraint
         Qiaomin Xie
         Yi Lu
 

S6.T5: Coding for Flash Memories

Time: Tuesday, July 3, 11:30 - 12:50
Location: Kresge Little Theatre (035)
Session Chair: Moshe Schwartz, Ben-Gurion University of the Negev
 
S6.T5.1: Trade-offs between Instantaneous and Total Capacity in Multi-Cell Flash Memories
         Eyal En Gad
         Anxiao Andrew Jiang
         Jehoshua Bruck
 
S6.T5.2: Optimized Cell Programming for Flash Memories with Quantizers
         Minghai Qin
         Eitan Yaakobi
         Paul Siegel
 
S6.T5.3: Tackling Intracell Variability in TLC Flash Through Tensor Product Codes
         Ryan Gabrys
         Eitan Yaakobi
         Laura Grupp
         Steven Swanson
         Lara Dolecek
 
S6.T5.4: Coding strategies for the uniform noise rewritable channel with hidden state
         Ramji Venkataramanan
         Sekhar Tatikonda
         Luis Lastras-Montaño
         Michele Franceschini
 

S6.T6: Sequences: Theory and Applications

Time: Tuesday, July 3, 11:30 - 12:50
Location: Kresge Rehearsal A (033)
Session Chair: Tor Helleseth, University of Bergen
 
S6.T6.1: Meeting the Levenshtein bound with equality by weighted-correlation complementary set
         Zi Long Liu
         Yong Liang Guan
 
S6.T6.2: On the Cross-Correlation of Ternary $m$-Sequences of Period $3^{4k+2}-1$ With Decimation $\frac{3^{4k+2}-3^{2k+1}+2}{4}+3^{2k+1}$
         Ji-Youp Kim
         Sung-Tai Choi
         Taehyung Lim
         Jong-Seon No
         Habong Chung
 
S6.T6.3: Large Zero Periodic Autocorrelation Zone of Golay Sequences
         Guang Gong
         Fei Huo
         Yang Yang
 
S6.T6.4: Large Zero Odd Periodic Autocorrelation Zone of Golay Sequences and QAM Golay Sequences
         Yang Yang
         Fei Huo
         Guang Gong
 

S6.T7: Tools for Bounding Capacity

Time: Tuesday, July 3, 11:30 - 12:50
Location: Stratton (407)
Session Chair: Danilo Silva, Federal University of Santa Catarina
 
S6.T7.1: Linear Information Coupling Problems
         Shao-Lun Huang
         Lizhong Zheng
 
S6.T7.2: Cut-Set Bound for Generalized Networks
         Silas Fong
         Raymond W. Yeung
         Gerhard Kramer
 
S6.T7.3: Cut-Set Bound for Generalized Networks with Positive Delay
         Silas Fong
         Raymond W. Yeung
 
S6.T7.4: Achievability Proof via Output Statistics of Random Binning
         Mohammad Hossein Yassaee
         Mohammad Reza Aref
         Amin Gohari
 

S6.T8: Probability and Estimation

Time: Tuesday, July 3, 11:30 - 12:50
Location: Stratton (491)
Session Chair: Abraham Wyner, University of Pennsylvania
 
S6.T8.1: Constrained Probability
         Jan Willems
 
S6.T8.2: Estimation of the Entropy on the Basis of its Polynomial Representation
         Martin Vinck
         Francesco Battaglia
         Vladimir Balakirsky
         Han Vinck
         Cyriel Pennartz
 
S6.T8.3: q-Gaussian based Smoothed Functional Algorithms for Stochastic Optimization
         Debarghya Ghoshdastidar
         Ambedkar Dukkipati
         Shalabh Bhatnagar
 
S6.T8.4: Multi-Level Error-Resilient Neural Networks
         Amin Karbasi
         Amir Hesam Salavati
 

S6.T9: Tools for Quantum Information Theory

Time: Tuesday, July 3, 11:30 - 12:50
Location: Stratton West Lounge (201)
Session Chair: Mark Wilde, McGill University
 
S6.T9.1: Work recoverable from two-particle information
         Lev Levitin
         Tommaso Toffoli
 
S6.T9.2: Entropy rate calculations of algebraic measures
         Katy Marchand
         Jaideep Mulherkar
         Bruno Nachtergaele
 
S6.T9.3: Necessary and Sufficient Conditions for Minimax Strategy in Quantum Signal Detection
         Kentaro Kato
 
S6.T9.4: Planar Difference Functions
         Joanne Hall
         Asha Rao
         Diane Donovan
 

S7.T1: Lossless and Universal Source Coding

Time: Tuesday, July 3, 14:40 - 16:20
Location: Kresge Rehearsal B (030)
Session Chair: Erik Ordentlich, Hewlett-Packard Company
 
S7.T1.1: Results on the Fundamental Gain of Memory-Assisted Universal Source Coding
         Ahmad Beirami
         Mohsen Sardari
         Faramarz Fekri
 
S7.T1.2: On Fast and Memory-Efficient Construction of an Antidictionary Array
         Hirotada Fukae
         Takahiro Ota
         Hiroyoshi Morita
 
S7.T1.3: Information Spectrum Approach to Overflow Probability of Variable-Length Codes with Conditional Cost Function
         Ryo Nomura
         Toshiyasu Matsushima
 
S7.T1.4: Bounds on estimated Markov orders of individual sequences
         Luciana Vitale
         Álvaro Martín
         Gadiel Seroussi
 
S7.T1.5: Variable-Length Extractors
         Hongchao Zhou
         Jehoshua Bruck
 

S7.T2: Relay Channels in Wireless Networks

Time: Tuesday, July 3, 14:40 - 16:20
Location: Kresge Auditorium (109)
Session Chair: Young-Han Kim, University of California, Sad Diego
 
S7.T2.1: Simple relaying strategies for half-duplex networks
         Siddhartha Brahma
         Ayfer Özgür
         Christina Fragouli
 
S7.T2.2: Reducibility of joint relay positioning and flow optimization problem
         Mohit Thakur
         Nadia Fawaz
         Muriel Médard
 
S7.T2.3: Wireless Network-Level Partial Relay Cooperation
         Nikolaos Pappas
         Jeongho Jeon
         Anthony Ephremides
         Apostolos Traganitis
 
S7.T2.4: Wireless MIMO Switching with MMSE Relaying
         Fanggang Wang
         Soung Chang Liew
         Dongning Guo
 
S7.T2.5: Transmission of non-linear binary input functions over a CDMA System
         Elaheh Mohammadi
         Amin Gohari
         Hassan Aghaeinia
 

S7.T3: Cellular Networks

Time: Tuesday, July 3, 14:40 - 16:20
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Vince Poor, Princeton University
 
S7.T3.1: Spectral Efficiency Limits in Pilot-Assisted Cooperative Communications
         Angel Lozano
         Jeffrey Andrews
         Robert Heath
 
S7.T3.2: Pilot Contamination Precoding in Multi-Cell Large Scale Antenna Systems
         Alexei Ashikhmin
         Tom Marzetta
 
S7.T3.3: Wireless Network Control with Privacy Using Hybrid ARQ
         Yunus Sarikaya
         Ozgur Ercetin
         Can Koksal
 
S7.T3.4: Reverse Compute and Forward: A Low-Complexity Architecture for Downlink Distributed Antenna System
         SongNam Hong
         Giuseppe Caire
 
S7.T3.5: Base Station Cooperation with limited Feedback: A Large System Analysis
         Rusdha Muharar
         Randa Zakhour
         Jamie Evans
 

S7.T4: Secrecy in Computation and Communication

Time: Tuesday, July 3, 14:40 - 16:20
Location: Stratton 20 Chimneys (306)
Session Chair: João Barros, University of Porto
 
S7.T4.1: Distributed computing with privacy
         Himanshu Tyagi
 
S7.T4.2: Secure Computation in a Bidirectional Relay
         Navin Kashyap
         Shashank V
         Andrew Thangaraj
 
S7.T4.3: On the Secrecy Capacity of 3-Receiver Broadcast Channel With Causal States and Conferencing
         Sadaf Salehkalaibar
         Mohammad Reza Aref
 
S7.T4.4: On Secure Communication with Constrained Randomization
         Matthieu Bloch
         Joerg Kliewer
 
S7.T4.5: Secure Transmission of a Gaussian Source over Gaussian Channels with Side Information
         Joffrey Villard
         Pablo Piantanida
         Shlomo (Shitz) Shamai
 

S7.T5: Regenerating Codes

Time: Tuesday, July 3, 14:40 - 16:20
Location: Kresge Little Theatre (035)
Session Chair: Alex Dimakis, University of Southern California
 
S7.T5.1: Long MDS Codes for Optimal Repair Bandwidth
         Zhiying Wang
         Itzhak Tamo
         Jehoshua Bruck
 
S7.T5.2: Access vs. Bandwidth in Codes for Storage
         Itzhak Tamo
         Zhiying Wang
         Jehoshua Bruck
 
S7.T5.3: Functional-Repair-by-Transfer Regenerating Codes
         Kenneth Shum
         Yuchong Hu
 
S7.T5.4: Exact Scalar Minimum Storage Coordinated Regenerating Codes
         Nicolas Le Scouarnec
 
S7.T5.5: Regenerating Codes for Errors and Erasures in Distributed Storage
         K. v. Rashmi
         Nihar Shah
         Kannan Ramchandran
         P Vijay Kumar
 

S7.T6: Sequences and Their Properties

Time: Tuesday, July 3, 14:40 - 16:20
Location: Kresge Rehearsal A (033)
Session Chair: Jong-Seon No, Seoul National University
 
S7.T6.1: On inverses of APN exponents
         Gohar Kyureghyan
         Valentin Suder
 
S7.T6.2: Generalized Bent Functions and Their Relation to Maiorana-McFarland Class
         Lilya Budaghyan
         Claude Carlet
         Tor Helleseth
         Alexander Kholosha
 
S7.T6.3: Binary Niho Sequences with Four-valued Cross Correlations
         Jinquan Luo
         Tor Helleseth
 
S7.T6.4: Rotating-table game and construction of periodic sequences with lightweight calculation
         Min Zeng
         Yuan Luo
         Guang Gong
 
S7.T6.5: Low Probability of Intercept Properties of Some Binary Sequence Families with Good Correlation Properties
         Serdar Boztas
         Parampalli Udaya
 

S7.T7: Approximate Belief Propagation

Time: Tuesday, July 3, 14:40 - 16:20
Location: Stratton (407)
Session Chair: David Declercq, ENSEA / Université de Cergy-Pontoise
 
S7.T7.1: Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing
         David Donoho
         Adel Javanmard
         Andrea Montanari
 
S7.T7.2: Hybrid Generalized Approximate Message Passing with Applications to Structured Sparsity
         Sundeep Rangan
         Alyson Fletcher
         Vivek Goyal
         Philip Schniter
 
S7.T7.3: Quantized Stochastic Belief Propagation: Efficient Message-Passing for Continuous State Spaces
         Nima Noorshams
         Martin Wainwright
 
S7.T7.4: Iterative Estimation of Constrained Rank-One Matrices in Noise
         Sundeep Rangan
         Alyson Fletcher
 

S7.T8: Information Inequalities

Time: Tuesday, July 3, 14:40 - 16:20
Location: Stratton (491)
Session Chair: Frantisek Matus, Institute of Information Theory and Automation
 
S7.T8.1: Entropy functions and determinant inequalities
         Terence Chan
         Dongning Guo
         Raymond Yeung
 
S7.T8.2: Non-entropic Inequalities from Information Constraints
         Siu-Wai Ho
         Terence Chan
         Alex Grant
 
S7.T8.3: Sumset Inequalities for Differential Entropy and Mutual Information
         Ioannis Kontoyiannis
         Mokshay Madiman
 
S7.T8.4: An Information Theoretic Perspective Over an Extremal Entropy Inequality
         Sangwoo Park
         Erchin Serpedin
         Khalid Qaraqe
 
S7.T8.5: Data Processing Inequalities Based on a Certain Structured Class of Information Measures with Application to Estimation Theory
         Neri Merhav
 

S7.T9: Compressive Sensing

Time: Tuesday, July 3, 14:40 - 16:20
Location: Stratton West Lounge (201)
Session Chair: Helmut Boelcskei, ETH Zürich
 
S7.T9.1: Compressive Principal Component Pursuit
         John Wright
         Arvind Ganesh
         Kerui Min
         Yi Ma
 
S7.T9.2: Principal Component Pursuit with Reduced Linear Measurements
         Arvind Ganesh
         Kerui Min
         John Wright
         Yi Ma
 
S7.T9.3: Bilateral Random Projections
         Tianyi Zhou
         Dacheng Tao
 
S7.T9.4: Compressed Sensing on the Image of Bilinear Maps
         Philipp Walk
         Peter Jung
 
S7.T9.5: SPIN: Iterative Signal Recovery on Incoherent Manifolds
         Chinmay Hegde
         Richard Baraniuk
 

S8.T1: Network Coding: Code Design and Resource Allocation

Time: Tuesday, July 3, 16:40 - 18:00
Location: Kresge Rehearsal B (030)
Session Chair: Joerg Kliewer, New Mexico State University
 
S8.T1.1: On a construction of universal network code using LDPC matrices
         Shigeki Miyake
         Jun Muramatsu
 
S8.T1.2: Properties of Network Polynomials
         Javad Ebrahimi
         Christina Fragouli
 
S8.T1.3: Network Coding Aware Resource Allocation to Improve Throughput
         Dan Zhang
         Kai Su
         Narayan Mandayam
 
S8.T1.4: Min-Cost Multicast Networks in Euclidean Space
         Xunrui Yin
         Yan Wang
         Xin Wang
         Xiangyang Xue
         Zongpeng Li
 

S8.T2: Relay Strategies for Network Communications

Time: Tuesday, July 3, 16:40 - 18:00
Location: Kresge Auditorium (109)
Session Chair: Daniela Tuninetti, University of Illinois, Chicago
 
S8.T2.1: Selective Coding Strategy for Unicast Composite Networks
         Arash Behboodi
         Pablo Piantanida
 
S8.T2.2: Causal relay networks with causal side information
         Ihn-Jung Baik
         Sae-Young Chung
 
S8.T2.3: Partial Decode-Forward Binning for Full-Duplex Causal Cognitive Interference Channels
         Zhuohua Wu
         Mai Vu
 
S8.T2.4: Combined Decode-Forward and Layered Noisy Network Coding Schemes for Relay Channels
         Peng Zhong
         Mai Vu
 

S8.T3: Energy Issues in Communication Systems

Time: Tuesday, July 3, 16:40 - 18:00
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Sennur Ulukus, University of Maryland, College Park
 
S8.T3.1: Energy-Efficient Sensing and Communication of Parallel Gaussian Sources
         Xi Liu
         Osvaldo Simeone
         Elza Erkip
 
S8.T3.2: Achievable Rates for Intermittent Communication
         Mostafa Khoshnevisan
         J. Nicholas Laneman
 
S8.T3.3: Energy State Amplification in an Energy Harvesting Communication System
         Omur Ozel
         Sennur Ulukus
 
S8.T3.4: On Energy/Information Cross-Layer Architectures
         Lav Varshney
 

S8.T4: Multiple Description Coding

Time: Tuesday, July 3, 16:40 - 18:00
Location: Stratton 20 Chimneys (306)
Session Chair: Shirin Jalali, California Institute of Technology
 
S8.T4.1: Gaussian Robust Sequential and Predictive Coding
         Lin Song
         Jun Chen
         Jia Wang
         Tie Liu
 
S8.T4.2: Successive Refinement with Cribbing Decoders and its Channel Coding Duals
         Himanshu Asnani
         Haim Permuter
         Tsachy Weissman
 
S8.T4.3: Combinatorial Message Sharing and Random Binning for Multiple Description Coding
         Emrah Akyol
         Kumar Viswanatha
         Kenneth Rose
 
S8.T4.4: Gaussian Multiple Descriptions with Common and Constrained Reconstruction Constraints
         Ravi Tandon
         Behzad Ahmadi
         Osvaldo Simeone
         H. Vincent Poor
 

S8.T5: WOM Codes

Time: Tuesday, July 3, 16:40 - 18:00
Location: Kresge Little Theatre (035)
Session Chair: Yuval Cassuto, Technion - Israel Institute of Technology
 
S8.T5.1: Making WOM Codes Decodable using Short Synchronous WOM Codes
         Nicolas Bitouzé
         Alexandre Graell i Amat
         Eirik Rosnes
 
S8.T5.2: High Sum-Rate Three-Write and Non-Binary WOM Codes
         Eitan Yaakobi
         Amir Shpilka
 
S8.T5.3: Short Q-ary WOM Codes with Hot/Cold Write Differentiation
         Yuval Cassuto
         Eitan Yaakobi
 
S8.T5.4: WOM with Retained Messages
         Lele Wang
         Minghai Qin
         Eitan Yaakobi
         Young-Han Kim
         Paul Siegel
 

S8.T6: New Sequence Constructions

Time: Tuesday, July 3, 16:40 - 18:00
Location: Kresge Rehearsal A (033)
Session Chair: Serdar Boztas, RMIT University
 
S8.T6.1: New Near-optimal Codebooks Associated With Binary Sidelnikov Sequences
         Nam Yul Yu
 
S8.T6.2: New Nonbinary Sequence Families with Low Correlation and Large Linear Span
         Chunlei Li
         Tor Helleseth
 
S8.T6.3: New Constructions of Asymptotically Optimal Optical Orthogonal Codes With $\lambda=1$
         Jin-Ho Chung
         Kyeongcheol Yang
 
S8.T6.4: New polyphase sequence sets with all-zero cross-correlation
         Andrzej Brodzik
 

S8.T7: Communication Theory

Time: Tuesday, July 3, 16:40 - 18:00
Location: Stratton (407)
Session Chair: John Anderson, Lund University
 
S8.T7.1: New Achievable Rates for Nonlinear Volterra Channels via Martingale Inequalities
         Kostis Xenoulis
         Nicholas Kalouptsidis
         Igal Sason
 
S8.T7.2: On the Complete Monotonicity of Symbol Error Rates
         Adithya Rajan
         Cihan Tepedelenlioglu
 
S8.T7.3: A Serial Concatenation of Coding and Trellis Shaping for OFDM Systems with Peak Power Reduction
         Ryota Yoshizawa
         Hideki Ochiai
 
S8.T7.4: Achievable Gains in Peak Power Reduction via Single-Carrier Distribution Shaping
         Stella Achtenberg
         Dan Raphaeli
 

S8.T8: Estimation and Detection

Time: Tuesday, July 3, 16:40 - 18:00
Location: Stratton (491)
Session Chair: Andrew Eckford, York University
 
S8.T8.1: An Affine Invariant k-Nearest Neighbor Regression Estimate
         Gerard Biau
         Luc Devroye
         Vida Dujmovic
         Adam Krzyzak
 
S8.T8.2: On Linear Coherent Estimation with Spatial Collaboration
         Swarnendu Kar
         Pramod Varshney
 
S8.T8.3: Modeling Spatially-Dependent Extreme Events with Markov Random Field Priors
         Hang Yu
         Zheng Choo
         Justin Dauwels
         Philip Jonathan
         Qiao Zhou
 
S8.T8.4: Signal Detection Algorithms for Two-Dimensional Intersymbol-Interference Channels
         Yiming Chen
         Shayan Garani Srinivasa
 

S8.T9: Sampling and Signaling

Time: Tuesday, July 3, 16:40 - 18:00
Location: Stratton West Lounge (201)
Session Chair: Andrew Singer,
 
S8.T9.1: Sparse Signal Recovery in Hilbert Spaces
         Graeme Pope
         Helmut Bölcskei
 
S8.T9.2: On Sampling a High-Dimensional Bandlimited Field on a Union of Shifted Lattices
         Jayakrishnan Unnikrishnan
         Martin Vetterli
 
S8.T9.3: Recovery of Sparse 1-D Signals from the Magnitudes of their Fourier Transform
         Kishore Jaganathan
         Samet Oymak
         Babak Hassibi
 
S8.T9.4: Generalized Faster-Than-Nyquist Signaling
         Jing Zhou
         Daoben Li
         Xuesong Wang
 

S9.T1: Network Coding: Security and Reliability

Time: Wednesday, July 4, 09:50 - 11:10
Location: Kresge Rehearsal B (030)
Session Chair: Raymond Yeung, Chinese University of Hong Kong
 
S9.T1.1: Explicit construction of universal strongly secure network coding via MRD codes
         Jun Kurihara
         Tomohiko Uyematsu
         Ryutaroh Matsumoto
 
S9.T1.2: List-decoding of Subspace Codes and Rank-Metric Codes up to Singleton Bound
         Hessam Mahdavifar
         Alexander Vardy
 
S9.T1.3: A Matroidal Framework for Network-Error Correcting Codes
         Krishnan Prasad
         B. Sundar Rajan
 
S9.T1.4: Matroidal undirected network
         Chung Chan
 

S9.T2: Relaying over Interference Networks

Time: Wednesday, July 4, 09:50 - 11:10
Location: Kresge Auditorium (109)
Session Chair: Aylin Yener, Penn State University
 
S9.T2.1: The DoF of the K-user Interference Channel with a Cognitive Relay
         Anas Chaaban
         Aydin Sezgin
 
S9.T2.2: Lattice Coding and the Generalized Degrees of Freedom of the Interference Channel with Relay
         Anas Chaaban
         Aydin Sezgin
 
S9.T2.3: Guiding Blind Transmitters: Relay-aided Interference Alignment for the X channel
         Ye Tian
         Aylin Yener
 
S9.T2.4: Broadcast Approaches to Dual-Hop Parallel Relay Networks
         Mahdi Zamani
         Amir K. Khandani
 

S9.T3: Degrees of Freedom and Scaling

Time: Wednesday, July 4, 09:50 - 11:10
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Mahesh Varanasi, University of Colorado at Boulder
 
S9.T3.1: On the information content of scattered waves
         Massimo Franceschetti
 
S9.T3.2: Degrees of Freedom of Sparsely Connected Wireless Networks
         Sang-Woon Jeon
         Naveen Goela
         Michael Gastpar
 
S9.T3.3: Hierarchical Beamforming for Large One-Dimensional Wireless Networks
         Alla Merzakreeva
         Olivier Lévêque
         Ayfer Özgür
 
S9.T3.4: Degrees of Freedom (DoF) of Locally Connected Interference Channels with Cooperating Multiple-Antenna Transmitters
         Aly El Gamal
         V. Sreekanth Annapureddy
         Venugopal Veeravalli
 

S9.T4: Joint Source-Channel Codes

Time: Wednesday, July 4, 09:50 - 11:10
Location: Stratton 20 Chimneys (306)
Session Chair: Deniz Gunduz, Centre Tecnològic de Telecomunicacions de Catalunya
 
S9.T4.1: On Linear Transforms in Zero-delay Gaussian Source Channel Coding
         Emrah Akyol
         Kenneth Rose
 
S9.T4.2: Achieving Csiszár's Source-Channel Coding Exponent with Product Distributions
         Adrià Tauste Campo
         Gonzalo Vazquez-Vilar
         Albert Guillén i Fàbregas
         Tobias Koch
         Alfonso Martinez
 
S9.T4.3: Lossy joint source-channel coding in the finite blocklength regime
         Victoria Kostina
         Sergio Verdú
 
S9.T4.4: Update Efficient Codes for Error Correction
         Arya Mazumdar
         Gregory Wornell
         Venkat Chandar
 

S9.T5: Linear Codes and UEP Codes

Time: Wednesday, July 4, 09:50 - 11:10
Location: Kresge Little Theatre (035)
Session Chair: Bella Bose, Oregon State University
 
S9.T5.1: On some properties of a check digit system
         Yanling Chen
         Markku Niemenmaa
         Han Vinck
         Danilo Gligoroski
 
S9.T5.2: Computing Extensions of Linear Codes using a Greedy Algorithm
         Markus Grassl
         Sunghyu Han
 
S9.T5.3: An Algebraic Framework for Concatenated Linear Block Codes in Side Information Based Problems
         Felipe Barbosa
         Joerg Kliewer
         Max Costa
 
S9.T5.4: Rate Allocation for Component Codes of Plotkin-Type UEP Codes
         Jin Soo Park
         Ki-Hyeon Park
         Hong-Yeop Song
 

S9.T6: Synchrony and Perfect Secrecy

Time: Wednesday, July 4, 09:50 - 11:10
Location: Kresge Rehearsal A (033)
Session Chair: Matthieu Bloch, Georgia Institute of Technology
 
S9.T6.1: Synchrony Amplification
         Ueli Maurer
         Björn Tackmann
 
S9.T6.2: Perfectly Secure Encryption of Individual Sequences
         Neri Merhav
 
S9.T6.3: Design of Error-free Perfect Secrecy System by Prefix Codes and Partition Codes
         Chinthani Uduwerelle
         Siu-Wai Ho
         Terence Chan
 

S9.T7: Medium Access Control

Time: Wednesday, July 4, 09:50 - 11:10
Location: Stratton (407)
Session Chair: Thomas Fuja, University of Notre Dame
 
S9.T7.1: Fast-CSMA Based Distributed Scheduling Algorithm under SINR Model
         Subhash Lakshminarayana
         Bin Li
         Mohamad Assaad
         Atilla Eryilmaz
         Mérouane Debbah
 
S9.T7.2: Upper Bound for the Capacity of Multiple Access Protocols on Multipacket Reception Channels
         Douglas Chan
         Toby Berger
 
S9.T7.3: Effect of Channel Estimation Errors on the Stability of Channel-Aware Random Access
         Jeongho Jeon
         Anthony Ephremides
 
S9.T7.4: Random Access Compressed Sensing over Fading and Noisy Communication Channels
         Fatemeh Fazel
         Maryam Fazel
         Milica Stojanovic
 

S9.T8: Portfolios and Estimation

Time: Wednesday, July 4, 09:50 - 11:10
Location: Stratton (491)
Session Chair: Emmanuel Abbe, Ecole Polytechnique Fédérale de Lausanne (EPFL)
 
S9.T8.1: Partial Kelly Portfolios and Shrinkage Estimators
         Justin Rising
         Abraham Wyner
 
S9.T8.2: Constant Markov Portfolio and its Application to Universal Portfolio with Side Information
         Mariko Tsurusaki
         Jun'ichi Takeuchi
 
S9.T8.3: Estimating Multiset of Bernoulli Processes
         Jayadev Acharya
         Hirakendu Das
         Ashkan Jafarpour
         Alon Orlitsky
         Shengjun Pan
 
S9.T8.4: The minimax risk of truncated series estimators for symmetric convex polytopes
         Adel Javanmard
         Li Zhang
 

S9.T9: Compressive Sensing and Phase Transitions

Time: Wednesday, July 4, 09:50 - 11:10
Location: Stratton West Lounge (201)
Session Chair: Joseph O'Sullivan, Washinton University at St. Louis
 
S9.T9.1: Optimal Phase Transitions in Compressed Sensing with Noisy Measurements
         Yihong Wu
         Sergio Verdú
 
S9.T9.2: Universality in Polytope Phase Transitions and Iterative Algorithms
         Mohsen Bayati
         Marc Lelarge
         Andrea Montanari
 
S9.T9.3: Compressed Measurements Needed for Noisy Distributed Compressed Sensing
         Sangjun Park
         Heung-No Lee
 
S9.T9.4: Central Approximation in Statistical Physics and Information Theory
         Ryuhei Mori
         Toshiyuki Tanaka
 

S10.T1: Network Coding: Capacity and Bounds

Time: Wednesday, July 4, 11:30 - 13:10
Location: Kresge Rehearsal B (030)
Session Chair: Ning Cai, Xidian University
 
S10.T1.1: An information-theoretic meta-theorem on edge-cut bounds
         Sudeep Kamath
         Pramod Viswanath
 
S10.T1.2: Symmetrical Multilevel Diversity Coding with an All-Access Encoder
         Jinjing Jiang
         Neeharika Marukala
         Tie Liu
 
S10.T1.3: On Network Coding Capacity under On-Off Scheduling
         Mayank Bakshi
         Michelle Effros
 
S10.T1.4: Non-coherent Network Coding: An Arbitrarily Varying Channel Approach
         Mahdi Jafari Siavoshani
         Shenghao Yang
         Raymond Yeung
 
S10.T1.5: Short Message Noisy Network Coding for Multiple Sources
         Jie Hou
         Gerhard Kramer
 

S10.T2: Multiple Access Channels with Side Information

Time: Wednesday, July 4, 11:30 - 13:10
Location: Kresge Auditorium (109)
Session Chair: Prakash Narayan, University of Maryland, College Park
 
S10.T2.1: Wyner-Ziv Type Versus Noisy Network Coding For a State-Dependent MAC
         Abdellatif Zaidi
         Pablo Piantanida
         Shlomo (Shitz) Shamai
 
S10.T2.2: MAC with Action-Dependent State Information at One Encoder
         Lior Dikstein
         Haim Permuter
         Shlomo (Shitz) Shamai
 
S10.T2.3: Capacity Region of the Finite State MAC with Cooperative Encoders and Delayed CSI
         Ziv Goldfeld
         Haim Permuter
         Benjamin Zaidel
 
S10.T2.4: Multiple Access Channel with Various Degrees of Asymmetric State Information
         Nevroz Şen
         Fady Alajaji
         Serdar Yüksel
         Giacomo Como
 
S10.T2.5: Achievable Rate Regions for the Dirty Multiple Access Channel with Partial Side Information at the Transmitters
         Elham Bahmani
         Ghosheh Abed Hodtani
 

S10.T3: MIMO Capacity

Time: Wednesday, July 4, 11:30 - 13:10
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Stefan Moser, National Chiao Tung University
 
S10.T3.1: On Asymptotic Capacity of Coordinated Multi-Point MIMO Channels with Spatial Correlation and LOS
         Jun Zhang
         Chao-Kai Wen
         Shi Jin
         Xiqi Gao
         Kai Kit Wong
 
S10.T3.2: Approaching Capacity of Large MIMO Systems by Non-Binary LDPC Codes and MMSE Detection
         Puripong Suthisopapan
         Kenta Kasai
         Virasit Imtawil
         Anupap Meesomboon
 
S10.T3.3: Unitary Isotropically Distributed Inputs are not Capacity-Achieving for Large-MIMO Fading Channels
         Wei Yang
         Giuseppe Durisi
         Erwin Riegler
 
S10.T3.4: Maximum Throughput and Expected-Rate in Multiple Transmit Antenna Systems
         Mahdi Zamani
         Amir K. Khandani
 
S10.T3.5: Capacity Lower Bound of MIMO Channels with Output Quantization and Correlated Noise
         Amine Mezghani
         Josef Nossek
 

S10.T4: Coding with Lattices

Time: Wednesday, July 4, 11:30 - 13:10
Location: Stratton 20 Chimneys (306)
Session Chair: Emanuele Viterbo, Monash University
 
S10.T4.1: Max-Product Algorithm for Low Density Lattice Codes
         Yair Yona
         Meir Feder
 
S10.T4.2: Non-random Coding Error Exponent for Lattices
         Yuval Domb
         Meir Feder
 
S10.T4.3: Iterative Encoding with Gauss-Seidel method for Spatially-Coupled Low-Density Lattice Codes
         Hironori Uchikawa
         Brian Kurkoski
         Kenta Kasai
         Kohichi Sakaniwa
 
S10.T4.4: Optimality of Linear Codes over PAM for the Modulo-Additive Gaussian Channel
         Ayal Hitron
         Uri Erez
 
S10.T4.5: Secrecy Gain of Gaussian Wiretap Codes from 2- and 3-Modular Lattices
         Fuchun Lin
         Frederique Oggier
 

S10.T5: Rateless Codes

Time: Wednesday, July 4, 11:30 - 13:10
Location: Kresge Little Theatre (035)
Session Chair: Gregory Wornell, Massachusetts Institute of Technology
 
S10.T5.1: Repairable Fountain Codes
         Megasthenis Asteris
         Alex Dimakis
 
S10.T5.2: Ripple Design of LT Codes for AWGN Channel
         Jesper Sørensen
         Toshiaki Koike-Akino
         Philip Orlik
         Jan Østergaard
         Petar Popovski
 
S10.T5.3: Finite Length LT Codes over Fq for Unequal Error Protection with Biased Sampling of Input Nodes
         Birgit Schotsch
         Radu Lupoaie
 
S10.T5.4: Rateless Feedback Codes
         Jesper Sørensen
         Toshiaki Koike-Akino
         Philip Orlik
 
S10.T5.5: Universal Rateless Coding with Finite Message Set
         Navot Blits
         Meir Feder
 

S10.T6: Secret Key Generation and Sharing

Time: Wednesday, July 4, 11:30 - 13:10
Location: Kresge Rehearsal A (033)
Session Chair: Ueli Maurer, ETH Zürich
 
S10.T6.1: One-Way Rate-Limited Sequential Key-Distillation
         Remi Chou
         Matthieu Bloch
 
S10.T6.2: Agreement of a restricted secret key
         Chung Chan
 
S10.T6.3: Fault-Tolerant Secret Key Generation
         Himanshu Tyagi
         Navin Kashyap
         Yogesh Sankarasubramaniam
         Kapali Viswanathan
 
S10.T6.4: Authentication Based on Secret-Key Generation
         Frans Willems
         Tanya Ignatenko
 
S10.T6.5: Connectivity results for sensor networks under a random pairwise key distribution scheme
         Osman Yağan
         Armand Makowski
 

S10.T7: Cognitive Channels

Time: Wednesday, July 4, 11:30 - 13:10
Location: Stratton (407)
Session Chair: Jayakrishnan Unnikrishnan, Ecole Polytechnique Fédérale de Lausanne (EPFL)
 
S10.T7.1: Optimal Active Sensing in Heterogeneous Cognitive Radio Networks
         Thang Van Nguyen
         Hyundong Shin
         Tony Q. S. Quek
         Moe Z. Win
 
S10.T7.2: Effect of Secondary Nodes on the Primary's Stable Throughput in a Cognitive Wireless Network
         Anthony Fanous
         Anthony Ephremides
 
S10.T7.3: The Capacity of the Semi-Deterministic Cognitive Interference Channel with a Common Cognitive Message and Approximate Capacity for the Gaussian Case
         Stefano Rini
         Carolin Huppert
 
S10.T7.4: The Capacity of a Three-user Interference Channel with a Cognitive Transmitter in Strong Interference
         Myunggil Kang
         Wan Choi
 
S10.T7.5: Gaussian Cognitive Interference Channels with State
         Ruchen Duan
         Yingbin Liang
 

S10.T8: Group Testing and Detection

Time: Wednesday, July 4, 11:30 - 13:10
Location: Stratton (491)
Session Chair: Andras György, University of Alberta
 
S10.T8.1: Compressive Binary Search
         Mark Davenport
         Ery Arias-Castro
 
S10.T8.2: Adaptive Group Testing as Channel Coding with Feedback
         Matthew Aldridge
 
S10.T8.3: Non-adaptive Group Testing: Explicit bounds and novel algorithms
         Chun Lam Chan
         Sidharth Jaggi
         Venkatesh Saligrama
         Samar Agnihotri
 
S10.T8.4: Adaptive sensing using deterministic partial Hadamard matrices
         Saeid Haghighatshoar
         Emmanuel Abbe
         Emre Telatar
 
S10.T8.5: Semi-Quantitative Group Testing
         Amin Emad
         Olgica Milenkovic
 

S10.T9: Compressive Sensing and Algorithms

Time: Wednesday, July 4, 11:30 - 13:10
Location: Stratton West Lounge (201)
Session Chair: Christoph Studer, Rice University
 
S10.T9.1: Beyond Worst-Case Reconstruction in Deterministic Compressed Sensing
         Sina Jafarpour
         Marco Duarte
         Robert Calderbank
 
S10.T9.2: Minimum Complexity Pursuit: Stability Analysis
         Shirin Jalali
         Arian Maleki
         Richard Baraniuk
 
S10.T9.3: 1-bit Hamming Compressed Sensing
         Tianyi Zhou
         Dacheng Tao
 
S10.T9.4: Binary Graphs and Message Passing Strategies for Compressed Sensing in the Noiseless Setting
         Francisco Ramirez-Javega
         Meritxell Lamarca
         Javier Villares
 
S10.T9.5: Analysis and Design of Irregular Graphs for Node-Based Verification-Based Recovery Algorithms in Compressed Sensing
         Yaser Eftekhari
         Amir Banihashemi
         Ioannis Lambadaris
 

S11.T1: Network Coding for Multiple Unicast Sessions

Time: Thursday, July 5, 09:50 - 11:10
Location: Kresge Rehearsal B (030)
Session Chair: Michael Langberg, The Open University of Israel
 
S11.T1.1: Space Information Flow: Multiple Unicast
         Zongpeng Li
         Chuan Wu
 
S11.T1.2: A Transform Approach to Linear Network Coding for Acyclic Networks with Delay
         Teja Bavirisetti
         Abhinav Ganesan
         Krishnan Prasad
         B. Sundar Rajan
 
S11.T1.3: On the Feasibility of Precoding-Based Network Alignment for Three Unicast Sessions
         Chun Meng
         Abinesh Ramakrishnan
         Athina Markopoulou
         Syed Jafar
 
S11.T1.4: Network Coding for Two-Unicast with Rate (1,2)
         Wentu Song
         Rongquan Feng
         Kai Cai
         Junshan Zhang
 

S11.T2: Interference Channels with Delayed CSI

Time: Thursday, July 5, 09:50 - 11:10
Location: Kresge Auditorium (109)
Session Chair: Amos Lapidoth, ETH Zürich
 
S11.T2.1: On X-Channels with Feedback and Delayed CSI
         Ravi Tandon
         Soheil Mohajer
         H. Vincent Poor
         Shlomo (Shitz) Shamai
 
S11.T2.2: Binary Fading Interference Channel with Delayed Feedback
         Alireza Vahid
         Mohammad Maddah-Ali
         Salman Avestimehr
 
S11.T2.3: Interference Alignment for Achieving both Full DOF and Full Diversity in the Broadcast Channel with Delayed CSIT
         Jinyuan Chen
         Raymond Knopp
         Petros Elia
 
S11.T2.4: On the Degrees of Freedom of MIMO X Channel with Delayed CSIT
         Akbar Ghasemi
         Mohammad Javad Abdoli
         Amir K. Khandani
 

S11.T3: Deterministic Models

Time: Thursday, July 5, 09:50 - 11:10
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Daniela Tuninetti, University of Illinois, Chicago
 
S11.T3.1: Random Access in Wireless X Networks: A Deterministic View
         Seyyed Mahboubi
         Ehsan Ebrahimzadeh
         Amir K. Khandani
 
S11.T3.2: A Deterministic Approach to Random Access Interference Channel
         Javad Behrouzi Moghaddam
         Akbar Ghasemi
         Amir K. Khandani
 
S11.T3.3: Carry-free Models and Beyond
         Se Yong Park
         Gireeja Ranade
         Anant Sahai
 
S11.T3.4: Expansion Coding: Achieving the Capacity of an AEN Channel
         Onur Ozan Koyluoglu
         Kumar Appaiah
         Hongbo Si
         Sriram Vishwanath
 

S11.T4: Joint Source-Channel Coding in Networks

Time: Thursday, July 5, 09:50 - 11:10
Location: Stratton 20 Chimneys (306)
Session Chair: Mikael Skoglund, Royal Institute of Technology (KTH)
 
S11.T4.1: Joint Source-Channel Coding for the Multiple-Access Relay Channel
         Yonathan Murin
         Ron Dabora
         Deniz Gündüz
 
S11.T4.2: On Source Transmission over Some Classes of Relay Channels
         Sadaf Salehkalaibar
         Mohammad Reza Aref
 
S11.T4.3: Lossy Source-Channel Communication over a Phase-Incoherent Interference Relay Channel
         Hamidreza Ebrahimzadeh Saffar
         Masoud Badiei Khuzani
         Patrick Mitran
 
S11.T4.4: Joint Source-Channel Coding for Cribbing Models
         Eliron Amir
         Yossef Steinberg
 

S11.T5: Polar Codes: Theory and Practice

Time: Thursday, July 5, 09:50 - 11:10
Location: Kresge Little Theatre (035)
Session Chair: Erdal Arikan, Bilkent Universitesi
 
S11.T5.1: Universal Bounds on the Scaling Behavior of Polar Codes
         Ali Goli
         S. Hamed Hassani
         Ruediger Urbanke
 
S11.T5.2: Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization
         S. Hamed Hassani
         Ruediger Urbanke
 
S11.T5.3: Code Based Efficient Maximum-Likelihood Decoding of Short Polar Codes
         Sinan Kahraman
         Mehmet Çelebi
 
S11.T5.4: Polar write once memory codes
         David Burshtein
         Alona Strugatski
 

S11.T6: Authentication and Signatures

Time: Thursday, July 5, 09:50 - 11:10
Location: Kresge Rehearsal A (033)
Session Chair: Jean-Pierre Tillich, INRIA Paris-Rocquencourt
 
S11.T6.1: Authentication over Noisy Data with the Use of Memory Containing Metric Functions
         Vladimir Balakirsky
         Han Vinck
 
S11.T6.2: Efficient code-based one-time signature from automorphism groups with syndrome compatibility
         Philippe Gaborit
         Julien Schrek
 
S11.T6.3: Efficient Signature Scheme for Network Coding
         Erez Waisbard
         Ely Porat
 

S11.T7: Message Passing Algorithms

Time: Thursday, July 5, 09:50 - 11:10
Location: Stratton (407)
Session Chair: Justin Dauwels, Nanyang Technological University
 
S11.T7.1: BPRS: Belief Propagation Based Iterative Recommender System
         Erman Ayday
         Arash Einolghozati
         Faramarz Fekri
 
S11.T7.2: Convergence of Generalized Linear Coordinate-Descent Message-Passing for Quadratic Optimization
         Guoqiang Zhang
         Richard Heusdens
 
S11.T7.3: Relaxed Gaussian Belief Propagation
         Yousef El-Kurdi
         Dennis Giannacopoulos
         Warren Gross
 
S11.T7.4: Message-passing sequential detection of multiple change points in networks
         XuanLong Nguyen
         Arash Amini
         Ram Rajagopal
 

S11.T8: Patterns, Estimation, Hypothesis Testing

Time: Thursday, July 5, 09:50 - 11:10
Location: Stratton (491)
Session Chair: Alon Orlitsky, University of California, San Diego
 
S11.T8.1: The Bethe Approximation of the Pattern Maximum Likelihood Distribution
         Pascal Vontobel
 
S11.T8.2: Alternating Markov Chains for Distribution Estimation in the Presence of Errors
         Farzad Farnoud
         Narayana Prasad Santhanam
         Olgica Milenkovic
 
S11.T8.3: On simple one-class classification methods
         Zineb Noumir
         Paul Honeine
         Cédric Richard
 
S11.T8.4: On Optimal Two Sample Homogeneity Tests for Finite Alphabets
         Jayakrishnan Unnikrishnan
 

S11.T9: L1-Regularized Least Squares and Frames

Time: Thursday, July 5, 09:50 - 11:10
Location: Stratton West Lounge (201)
Session Chair: John Wright, Columbia University
 
S11.T9.1: Recovery Threshold for Optimal Weight l1 Minimization
         Samet Oymak
         Amin Khajehnejad
         Babak Hassibi
 
S11.T9.2: The $\ell_1$ analysis approach by sparse dual frames for sparse signal recovery represented by frames
         Shidong Li
         Tiebin Mi
         Yulong Liu
 
S11.T9.3: Performance Analysis of $\ell_1$-synthesis with Coherent Frames
         Yulong Liu
         Shidong Li
         Tiebin Mi
         Lei Hong
         Yu Weidong
 
S11.T9.4: Sparse Signal Separation in Redundant Dictionaries
         Céline Aubel
         Christoph Studer
         Graeme Pope
         Helmut Bölcskei
 

S12.T1: Network Coding for Wireless

Time: Thursday, July 5, 11:30 - 12:50
Location: Kresge Rehearsal B (030)
Session Chair: Christina Fragouli, Ecole Polytechnique Fédérale de Lausanne (EPFL)
 
S12.T1.1: Analog Network Coding in General SNR Regime
         Samar Agnihotri
         Sidharth Jaggi
         Minghua Chen
 
S12.T1.2: Network Coding for the Broadcast Rayleigh Fading Channel with Feedback
         Xiaohang Song
         Onurcan İşcan
 
S12.T1.3: Linear Network Coding Capacity Region of 2-Receiver MIMO Broadcast Packet Erasure Channels with Feedback
         Chih-Chun Wang
         David Love
 
S12.T1.4: Wireless Network Coding for MIMO Two-way Relaying using Latin Rectangles
         Vijayvaradharaj Muralidharan
         B. Sundar Rajan
 

S12.T2: Interference Alignment

Time: Thursday, July 5, 11:30 - 12:50
Location: Kresge Auditorium (109)
Session Chair: Viveck Cadambe, Massachusetts Institute of Technology
 
S12.T2.1: The Approximate Sum Capacity of the Symmetric Gaussian K-User Interference Channel
         Or Ordentlich
         Uri Erez
         Bobak Nazer
 
S12.T2.2: Interference Alignment: From Degrees-of-Freedom to Constant-Gap Capacity Approximations
         Urs Niesen
         Mohammad Maddah-Ali
 
S12.T2.3: Degrees of Freedom of MIMO X Networks: Spatial Scale Invariance, One-Sided Decomposability and Linear Feasibility
         Hua Sun
         Chunhua Geng
         Tiangao Gou
         Syed Jafar
 
S12.T2.4: Signal Space Alignment for the Gaussian Y-Channel
         Anas Chaaban
         Aydin Sezgin
 

S12.T3: Deterministic Channels

Time: Thursday, July 5, 11:30 - 12:50
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Natasha Devroye, University of Illinois, Chicago
 
S12.T3.1: On the Capacity of Multi-user Two-way Linear Deterministic Channels
         Zhiyu Cheng
         Natasha Devroye
 
S12.T3.2: Sum Capacity of 3-user Deterministic Interference Channels with Connectivity Constraints
         Suvarup Saha
         Randall Berry
 
S12.T3.3: On the Sum-capacity of the Linear Deterministic Interference Channel with Partial Feedback
         Sy-Quoc Le
         Ravi Tandon
         Mehul Motani
         H. Vincent Poor
 
S12.T3.4: The Sum-Capacity of the Linear Deterministic Three-User Cognitive Interference Channel
         Diana Maamari
         Daniela Tuninetti
         Natasha Devroye
 

S12.T4: Classical and Adversarial Joint Source-Channel Coding

Time: Thursday, July 5, 11:30 - 12:50
Location: Stratton 20 Chimneys (306)
Session Chair: Albert Guillen i Fabregas, ICREA and Universitat Pompeu Fabra
 
S12.T4.1: The Adversarial Joint Source-Channel Problem
         Yuval Kochman
         Arya Mazumdar
         Yury Polyanskiy
 
S12.T4.2: A Strong Converse for Joint Source-Channel Coding
         Da Wang
         Amir Ingber
         Yuval Kochman
 
S12.T4.3: Joint Source-Channel Coding of one Random Variable over the Poisson Channel
         Albert No
         Kartik Venkat
         Tsachy Weissman
 
S12.T4.4: Curves on torus layers and coding for continuous alphabet sources
         Antonio Campello
         Cristiano Torezzan
         Sueli Costa
 

S12.T5: Polar Codes over Non-Binary Alphabets

Time: Thursday, July 5, 11:30 - 12:50
Location: Kresge Little Theatre (035)
Session Chair: Emre Telatar, Ecole Polytechnique Fédérale de Lausanne (EPFL)
 
S12.T5.1: Constructing Polar Codes for Non-Binary Alphabets and MACs
         Ido Tal
         Artyom Sharov
         Alexander Vardy
 
S12.T5.2: Polar codes for discrete alphabets
         Eren Sasoglu
 
S12.T5.3: Polar codes for q-ary channels, q=2^r
         Woomyoung Park
         Alexander Barg
 
S12.T5.4: Polar Coding without Alphabet Extension for Asymmetric Channels
         Junya Honda
         Hirosuke Yamamoto
 

S12.T6: Cryptanalysis and Distributed Guessing

Time: Thursday, July 5, 11:30 - 12:50
Location: Kresge Rehearsal A (033)
Session Chair: Simon Blackburn, Royal Holloway, University of London
 
S12.T6.1: Cryptanalysis of a Homomorphic Encryption Scheme from ISIT 2008
         Jingguo Bi
         Mingjie Liu
         Xiaoyun Wang
 
S12.T6.2: Finding short vectors in a lattice of Voronoi's first kind
         Robby McKilliam
         Alex Grant
 
S12.T6.3: Oblivious Distributed Guessing
         Serdar Boztas
 

S12.T7: Fading Channels

Time: Thursday, July 5, 11:30 - 12:50
Location: Stratton (407)
Session Chair: Miguel Rodriguez, Instituto de Telecomunicações
 
S12.T7.1: Error Exponents for Rayleigh Fading Product MIMO Channels
         Jiang Xue
         Md. Zahurul Sarkar
         Tharmalingam Ratnarajah
         Caijun Zhong
 
S12.T7.2: Ergodic Sum Capacity of Macrodiversity MIMO Systems in Flat Rayleigh Fading
         Dushyantha Basnayaka
         Peter Smith
         Philippa Martin
 
S12.T7.3: Characterization of the Constrained Capacity of Multiple-Antenna Fading Coherent Channels Driven by Arbitrary Inputs
         Miguel Rodrigues
 
S12.T7.4: A Random Matrix Approach to the Finite Blocklength Regime of MIMO Fading Channels
         Jakob Hoydis
         Romain Couillet
         Pablo Piantanida
         Mérouane Debbah
 
S12.T7.5: Worst-Case Expected-Rate Loss of Slow-Fading Channels
         Jae Won Yoo
         Tie Liu
         Shlomo (Shitz) Shamai
 

S12.T8: Hypothesis Testing

Time: Thursday, July 5, 11:30 - 12:50
Location: Stratton (491)
Session Chair: Richard Blahut, University of Illinois
 
S12.T8.1: Extrinsic Jensen-Shannon Divergence with Application in Active Hypothesis Testing
         Mohammad Naghshvar
         Tara Javidi
 
S12.T8.2: Controlled Sensing for Sequential Multihypothesis Testing
         George Atia
         Venugopal Veeravalli
 
S12.T8.3: Active Sequential Hypothesis Testing with Application to a Visual Search Problem
         Nidhin Vaidhiyan
         Arun Sripati
         Rajesh Sundaresan
 
S12.T8.4: Hypothesis testing via a comparator
         Yury Polyanskiy
 

S12.T9: L1-Regularized Least Squares and Sparsity

Time: Thursday, July 5, 11:30 - 12:50
Location: Stratton West Lounge (201)
Session Chair: Babak Hassibi, California Institute of Technology
 
S12.T9.1: The Sensitivity of Compressed Sensing Performance to Relaxation of Sparsity
         David Donoho
         Galen Reeves
 
S12.T9.2: Combinatorial Selection and Least Absolute Shrinkage via the Clash Algorithm
         Anastasios Kyrillidis
         Volkan Cevher
 
S12.T9.3: Lp-Constrained Least Squares (0
         Masahiro Yukawa
         Shun-ichi Amari
 
S12.T9.4: WarmL1: A Warm-start Homotopy-based Reconstruction Algorithm for Sparse Signals
         Tien-Ju Yang
         Yi-Min Tsai
         Chung-Te Li
         Liang-Gee Chen
 

S13.T1: Index Coding

Time: Thursday, July 5, 14:40 - 16:20
Location: Kresge Rehearsal B (030)
Session Chair: Sidharth Jaggi, Chinese University of Hong Kong
 
S13.T1.1: On Linear Index Coding for Random Graphs
         Ishay Haviv
         Michael Langberg
 
S13.T1.2: Index Coding: An Interference Alignment Perspective
         Hamed Maleki
         Viveck Cadambe
         Syed Jafar
 
S13.T1.3: Optimal Index Codes with Near-Extreme Rates
         Hoang Dau
         Vitaly Skachek
         Yeow Meng Chee
 
S13.T1.4: Bipartite Index Coding
         Arash Saber Tehrani
         Alex Dimakis
         Michael Neely
 
S13.T1.5: Pliable Index Coding
         Siddhartha Brahma
         Christina Fragouli
 

S13.T2: Interference Channels

Time: Thursday, July 5, 14:40 - 16:20
Location: Kresge Auditorium (109)
Session Chair: Urs Niesen, Bell Labs, Alcatel-Lucent
 
S13.T2.1: A new achievable rate region for the 3-user discrete memoryless interference channel
         Arun Padakandla
         Aria Sahebi
         Sandeep Pradhan
 
S13.T2.2: An Information-Spectrum Approach to the Capacity Region of General Interference Channel
         Lei Lin
         Xiao Ma
         Xiujie Huang
         Bao-Ming Bai
 
S13.T2.3: On a Class of Discrete Memoryless Broadcast Interference Channels
         Yuanpeng Liu
         Elza Erkip
 
S13.T2.4: On the Sum Capacity of the Discrete Memoryless Interference Channel with One-Sided Weak Interference and Mixed Interference
         Fangfang Zhu
         Biao Chen
 
S13.T2.5: An Achievable Rate Region for Three-Pair Interference Channels with Noise
         Bernd Bandemer
 

S13.T3: MIMO Precoding

Time: Thursday, July 5, 14:40 - 16:20
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Guiseppe Caire, University of Southern California
 
S13.T3.1: Hermitian Precoding for Distributed MIMO Systems
         Jianwen Zhang
         Xiaojun Yuan
         Li Ping
 
S13.T3.2: On the net DoF comparison between ZF and MAT over time-varying MISO broadcast channels
         Mari Kobayashi
         Giuseppe Caire
 
S13.T3.3: Proximity Factors of Lattice Reduction-Aided Precoding for Multiantenna Broadcast
         Shuiyin Liu
         Cong Ling
         Xiaofu Wu
 
S13.T3.4: High-SNR Analysis of MIMO Linear Precoders
         Ahmed Mehana
         Aria Nosratinia
 
S13.T3.5: A Transmit-Power Efficient MIMO-THP Design
         Christos Masouros
         Mathini Sellathurai
         Tharmalingam Ratnarajah
 

S13.T4: Gaussian Wiretap Channels

Time: Thursday, July 5, 14:40 - 16:20
Location: Stratton 20 Chimneys (306)
Session Chair: Han Vinck, University of Duisburg-Essen
 
S13.T4.1: Lattice codes achieving strong secrecy over the mod-Lambda Gaussian Channel
         Cong Ling
         Laura Luzzi
         Jean-Claude Belfiore
 
S13.T4.2: Key Agreement over Gaussian Wiretap Models with Known Interference at the Transmitter
         Ali Zibaeenejad
 
S13.T4.3: The Gaussian Interference Wiretap Channel When the Eavesdropper Channel is Arbitrarily Varying
         Xiang He
         Aylin Yener
 
S13.T4.4: Optimal Power Allocation for GSVD-Based Beamforming in the MIMO Gaussian Wiretap Channel
         Ali Fakoorian
         Lee Swindlehurst
 
S13.T4.5: Switched Power Allocation for MISOME Wiretap Channels
         Thang Van Nguyen
         Tony Q. S. Quek
         Hyundong Shin
 

S13.T5: Analysis of LDPC Codes

Time: Thursday, July 5, 14:40 - 16:20
Location: Kresge Little Theatre (035)
Session Chair: Pascal Vontobel, Hewlett-Packard Company
 
S13.T5.1: Beyond the Bethe Free Energy of LDPC Codes via Polymer Expansions
         Nicolas Macris
         Marc Vuffray
 
S13.T5.2: On Generalized EXIT Charts of LDPC Code Ensembles over Binary-Input Output-Symmetric Memoryless Channels
         Hosein Mamani
         Hamid Saeedi
         Ali Eslami
         Hossein Pishro-Nik
 
S13.T5.3: Analysis of Error Floors of Generalized Non-binary LDPC Codes over q-ary Memoryless Symmetric Channels
         Takayuki Nozaki
         Kenta Kasai
         Kohichi Sakaniwa
 
S13.T5.4: Finite-length analysis of the TEP decoder for LDPC ensembles over the BEC
         Pablo M. Olmos
         Fernando Pérez-Cruz
         Luis Salamanca
         Juan José Murillo-Fuentes
 

S13.T6: Convolutional and Turbo Codes

Time: Thursday, July 5, 14:40 - 16:20
Location: Kresge Rehearsal A (033)
Session Chair: Sam Dolinar, Jet Propulsion Laboratory
 
S13.T6.1: Properties and encoding aspects of direct product convolutional codes
         Vladimir Sidorenko
         Martin Bossert
         Francesca Vatta
 
S13.T6.2: Efficient Decoding of Partial Unit Memory Codes of Arbitrary Rate
         Antonia Wachter-Zeh
         Markus Stinner
         Martin Bossert
 
S13.T6.3: SISO MAP Decoding of Rate-1 Recursive Convolutional Codes: A Revisit
         Yonghui Li
         Md. Shahriar Rahman
         Branka Vucetic
 
S13.T6.4: Best Rate 1/2 Convolutional Codes for Turbo Equalization with Severe ISI
         John Anderson
         Mehdi Zeinali
 
S13.T6.5: Low Complexity Syndrome Based Decoding of Turbo Codes
         Jan Geldmacher
         Klaus Hueske
         Jürgen Götze
         Martin Kosakowski
 

S13.T7: Communication Systems

Time: Thursday, July 5, 14:40 - 16:20
Location: Stratton (407)
Session Chair: Anant Sahai, University of California, Berkeley
 
S13.T7.1: Message-Passing Algorithms for Channel Estimation and Decoding Using Approximate Inference
         Mihai Alin Badiu
         Gunvor Kirkelund
         Carles Navarro Manchón
         Erwin Riegler
         Bernard Fleury
 
S13.T7.2: Bidirectional Channel Estimation Using Adaptive Pilots
         Fei Teng
         Dongning Guo
         Michael Honig
 
S13.T7.3: Delay-Doppler Channel Estimation with Almost Linear Complexity
         Alexander Fish
         Shamgar Gurevich
         Ronny Hadani
         Akbar Sayeed
         Oded Schwartz
 
S13.T7.4: Efficient Algorithms for Calculating Euclidean Distance Spectra of Muliti-User Continuous Phase Modulation Systems
         Li Bing
         Tor Aulin
         Bao-Ming Bai
 
S13.T7.5: Joint Synchronization and Demodulation by Forward Filtering
         Murthy Devarakonda
         Hans-Andrea Loeliger
 

S13.T8: Coded Modulation

Time: Thursday, July 5, 14:40 - 16:20
Location: Stratton (491)
Session Chair: Johannes Huber, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
 
S13.T8.1: On the Equivalence of TCM Encoders
         Alex Alvarado
         Alexandre Graell i Amat
         Fredrik Brännström
         Erik Agrell
 
S13.T8.2: Performance Estimation of Bit-Interleaved Coded Modulation Based on Information Processing Characteristics
         Andreas Schenk
         Robert Fischer
         Johannes Huber
 
S13.T8.3: Cooperative Diversity via Set-Partitioning in BICM: Outage Analysis and Frame Interleaving
         Lai Wei
         Thomas Fuja
 
S13.T8.4: Mismatched Shaping Schemes for Bit-Interleaved Coded Modulation
         Li Peng
         Albert Guillén i Fàbregas
         Alfonso Martinez
 
S13.T8.5: Achieving the Shannon Limit with Probabilistically Shaped BICM
         Erik Agrell
         Alex Alvarado
 

S13.T9: Fourier Subsampling

Time: Thursday, July 5, 14:40 - 16:20
Location: Stratton West Lounge (201)
Session Chair: Vivek Goyal, Massachusetts Institute of Technology
 
S13.T9.1: Systematic DFT Frames: Principle and Eigenvalues Structure
         Mojtaba Vaezi
         Fabrice Labeau
 
S13.T9.2: Subsampling at Information Theoretically Optimal Rates
         Adel Javanmard
         Andrea Montanari
 
S13.T9.3: New Construction of A Near-optimal Partial Fourier Codebook Using The Structure of Binary m-sequences
         Nam Yul Yu
 
S13.T9.4: Behavior of the Minimum Singular Value of a Random Vandermonde Matrix
         Gabriel Tucci
         Philip Whiting
 
S13.T9.5: Applications of the Shannon-Hartley Theorem to Data Streams and Sparse Recovery
         Eric Price
         David Woodruff
 

S14.T1: Network Erasure Correction

Time: Thursday, July 5, 16:40 - 18:00
Location: Kresge Rehearsal B (030)
Session Chair: Tracey Ho, California Institute of Technology
 
S14.T1.1: Expander Graph Based Overlapped Chunked Codes
         Bin Tang
         Shenghao Yang
         Yitong Yin
         Baoliu Ye
         Sanglu Lu
 
S14.T1.2: On Densifying Coding Opportunities in Instantly Decodable Network Coding Graphs
         Sameh Sorour
         Shahrokh Valaee
 
S14.T1.3: How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks?
         Anoosheh Heidarzadeh
         Amir Banihashemi
 
S14.T1.4: On Decoding Delay of Intra-session Random Linear Network Coding for Line Networks
         Vahid Shah-Mansouri
         Vincent Wong
 

S14.T2: Subspace Interference Alignment and Feasibility Conditions

Time: Thursday, July 5, 16:40 - 18:00
Location: Kresge Auditorium (109)
Session Chair: Uri Erez, Tel-Aviv University
 
S14.T2.1: Subspace Alignment Chains and the Degrees of Freedom of the Three-User MIMO Interference Channel
         Chenwei Wang
         Tiangao Gou
         Syed Jafar
 
S14.T2.2: Genie Chains and the Degrees of Freedom of the K-User MIMO Interference Channel
         Chenwei Wang
         Hua Sun
         Syed Jafar
 
S14.T2.3: A general test to check the feasibility of linear interference alignment
         Óscar González
         Ignacio Santamaria
         Carlos Beltrán
 
S14.T2.4: The Feasibility Conditions of Interference Alignment for MIMO Interference Networks
         Liangzhong Ruan
         Vincent Lau
         Moe Win
 

S14.T3: Multiple-Antenna Broadcast Channels

Time: Thursday, July 5, 16:40 - 18:00
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Ralf Müller, Norwegian University of Science and Technology
 
S14.T3.1: Grassmannian-Euclidean Superposition for MIMO Broadcast Channels
         Yang Li
         Aria Nosratinia
 
S14.T3.2: Throughput Penalty of Fair Scheduling Algorithms on Multiple Antenna Broadcast Channels
         Juyul Lee
 
S14.T3.3: On the Degrees of Freedom of Time Correlated MISO Broadcast Channel with Delayed CSIT
         Mari Kobayashi
         Sheng Yang
         David Gesbert
         Xinping Yi
 
S14.T3.4: An Extremal Inequality and the Capacity Region of the Degraded MIMO Compound Gaussian Broadcast Channel with Multiple Users
         Hon Fah Chong
         Ying-Chang Liang
 

S14.T4: Game Theory

Time: Thursday, July 5, 16:40 - 18:00
Location: Stratton 20 Chimneys (306)
Session Chair: Bruce Hajek, University of Illinois
 
S14.T4.1: The Supermarket Game
         Jiaming Xu
         Bruce Hajek
 
S14.T4.2: A Game Theoretic Model for the Gaussian Broadcast Channel
         Srinivas Yerramalli
         Rahul Jain
         Urbashi Mitra
 
S14.T4.3: Incentives for Cooperative Relaying in a Simple Information-Theoretic Model
         Dileep Kalathil
         Rahul Jain
 

S14.T5: New Constructions of LDPC Codes

Time: Thursday, July 5, 16:40 - 18:00
Location: Kresge Little Theatre (035)
Session Chair: Ruediger Urbanke, Ecole Polytechnique Fédérale de Lausanne (EPFL)
 
S14.T5.1: Graph Cover Ensembles of Non-binary Protograph LDPC Codes
         Dariush Divsalar
         Lara Dolecek
 
S14.T5.2: Analysis and Design of Ultra-Sparse Non-Binary Cluster-LDPC Codes
         David Declercq
         Valentin Savin
         Lam Pham Sy
 
S14.T5.3: A New Ensemble of Rate-Compatible LDPC Codes
         Kai Zhang
         Xiao Ma
         Shancheng Zhao
         Bao-Ming Bai
         Xiaoyi Zhang
 
S14.T5.4: Fourier domain representation of non-binary LDPC codes
         Valentin Savin
 

S14.T6: Applications of Codes in Cryptography

Time: Thursday, July 5, 16:40 - 18:00
Location: Kresge Rehearsal A (033)
Session Chair: Ian Blake, University of British Columbia
 
S14.T6.1: Secure Network Coding and Non-Malleable Codes: Protection Against Linear Tampering
         Hervé Chabanne
         Gerard Cohen
         Alain Patey
 
S14.T6.2: On a Class of Three-Weight Codes with Cryptographic Applications
         Zihui Liu
         Xin-Wen Wu
 
S14.T6.3: Private Stream Search at the Same Communication Cost as a Regular Search: Role of LDPC Codes
         Matthieu Finiasz
         Kannan Ramchandran
 

S14.T7: Topics in Shannon Theory

Time: Thursday, July 5, 16:40 - 18:00
Location: Stratton (407)
Session Chair: Stark Draper, University of Wisconsin-Madison
 
S14.T7.1: Recognition Capacity Versus Search Speed in Noisy Databases
         Ertem Tuncel
 
S14.T7.2: On Fingerprinting Capacity Games for Arbitrary Alphabets and Their Asymptotics
         Yen-Wei Huang
         Pierre Moulin
 
S14.T7.3: Universal communication over unknown vector channels
         Yuval Lomnitz
         Meir Feder
 
S14.T7.4: The Porosity of Additive Noise Sequences
         Vinith Misra
         Tsachy Weissman
 

S14.T8: High-Dimensional Inference

Time: Thursday, July 5, 16:40 - 18:00
Location: Stratton (491)
Session Chair: Aaron Wagner, Cornell University
 
S14.T8.1: Classification with High-Dimensional Sparse Samples
         Dayu Huang
         Sean Meyn
 
S14.T8.2: Large scale correlation detection
         Francesca Bassi
         Alfred Hero III
 
S14.T8.3: An Innovative Approach for Analysing Rank Deficient Covariance Matrices
         Gabriel Tucci
         Ke Wang
 
S14.T8.4: Corrupted and missing predictors: Minimax bounds for high-dimensional linear regression
         Po-Ling Loh
         Martin Wainwright
 

S15.T1: Data Exchange and Gathering

Time: Friday, July 6, 09:50 - 11:10
Location: Kresge Rehearsal B (030)
Session Chair: Mehul Motani, National University of Singapore
 
S15.T1.1: Coded Cooperative Data Exchange Problem for General Topologies
         Mira Gonen
         Michael Langberg
 
S15.T1.2: Data Exchange Problem with Helpers
         Nebojsa Milosavljevic
         Sameer Pawar
         Salim El Rouayheb
         Michael Gastpar
         Kannan Ramchandran
 
S15.T1.3: Network Coded Gossip With Correlated Data
         Bernhard Haeupler
         Asaf Cohen
         Chen Avin
         Muriel Médard
 
S15.T1.4: Wireless Networks with Symmetric Demands
         Sudeep Kamath
         Sreeram Kannan
         Pramod Viswanath
 

S15.T2: Opportunistic and Relay-Aided Interference Alignment

Time: Friday, July 6, 09:50 - 11:10
Location: Kresge Auditorium (109)
Session Chair: Bobak Nazer, Boston University
 
S15.T2.1: Delay-Rate Tradeoff in Ergodic Interference Alignment
         Oliver Johnson
         Matthew Aldridge
         Robert Piechocki
 
S15.T2.2: Opportunistic Interference Alignment in MIMO Femtocell Networks
         Tri Nguyen
         Tony Q. S. Quek
         Hyundong Shin
 
S15.T2.3: Opportunistic Interference Alignment for MIMO IMAC: Effect of User Scaling Over Degrees-of-Freedom
         Hyun Jong Yang
         Won-Yong Shin
         Bang Chul Jung
         Arogyaswami Paulraj
 
S15.T2.4: Relay-aided Interference Alignment for MIMO Cellular Networks
         Xuesong Wang
         Yongping Zhang
         Philipp Zhang
         Xiaotao Ren
 

S15.T3: Topics in MIMO

Time: Friday, July 6, 09:50 - 11:10
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Meir Feder , Tel Aviv University
 
S15.T3.1: Generalized Distributive Law for ML Decoding of STBCs: Further Results
         Lakshmi Prasad Natarajan
         B. Sundar Rajan
 
S15.T3.2: The Jacobi MIMO Channel
         Ronen Dar
         Meir Feder
         Mark Shtaif
 
S15.T3.3: Channel Modelling of MU-MIMO Systems by Quaternionic Free Probability
         Ralf Müller
         Burak Çakmak
 
S15.T3.4: Transmission over Arbitrarily Permuted Parallel Gaussian Channels
         Ayal Hitron
         Anatoly Khina
         Uri Erez
 

S15.T4: Delay and Distributed Scheduling

Time: Friday, July 6, 09:50 - 11:10
Location: Stratton 20 Chimneys (306)
Session Chair: Roy Yates, Rutgers University
 
S15.T4.1: Real-Time Status Updating: Multiple Sources
         Roy Yates
         Sanjit Kaul
 
S15.T4.2: On Emptying a Wireless Network in Minimum Time
         Vangelis Angelakis
         Anthony Ephremides
         Qing He
         Di Yuan
 
S15.T4.3: Mixing Time and Temporal Starvation of General CSMA Networks with Multiple Frequency Agility
         Ka Kit Lam
         Chi-Kin Chau
         Minghua Chen
         Soung Chang Liew
 
S15.T4.4: From Glauber Dynamics To Metropolis Algorithm: Smaller Delay in Optimal CSMA
         Chul-Ho Lee
         Do Young Eun
         Se-Young Yun
         Yung Yi
 

S15.T5: Decoding Algorithms for Codes on Graphs

Time: Friday, July 6, 09:50 - 11:10
Location: Kresge Little Theatre (035)
Session Chair: Dan Costello, University of Notre Dame
 
S15.T5.1: Linear-Programming Decoding of Tanner Codes with Local-Optimality Certificates
         Nissim Halabi
         Guy Even
 
S15.T5.2: Hierarchies of Local-Optimality Characterizations in Decoding Tanner Codes
         Nissim Halabi
         Guy Even
 
S15.T5.3: Approaching capacity at high-rates with iterative hard-decision decoding
         Yung-Yih Jian
         Henry Pfister
         Krishna Narayanan
 
S15.T5.4: On The Maximum a Posteriori Decoding Thresholds of Multiuser Systems with Erasures
         Phong Nguyen
         Arvind Yedla
         Henry Pfister
         Krishna Narayanan
 

S15.T6: Fundamental Limits on Complexity

Time: Friday, July 6, 09:50 - 11:10
Location: Kresge Rehearsal A (033)
Session Chair: Navin Kashyap, Indian Institute of Science, Bangalore
 
S15.T6.1: An Analytic Upper Bound on T-Complexity
         Ulrich Speidel
         T. Aaron Gulliver
 
S15.T6.2: On the Query Computation and Verification of Functions
         Hirakendu Das
         Ashkan Jafarpour
         Alon Orlitsky
         Shengjun Pan
         Ananda Suresh
 
S15.T6.3: Fundamental limits on the power consumption of encoding and decoding
         Pulkit Grover
         Andrea Goldsmith
         Anant Sahai
 

S15.T8: Tree Learning

Time: Friday, July 6, 09:50 - 11:10
Location: Stratton (491)
Session Chair: Jonathan Yedidia, Disney Research
 
S15.T8.1: Tractable Bayesian Social Learning on Trees
         Yashodhan Kanoria
         Omer Tamuz
 
S15.T8.2: Learning Minimal Latent Directed Information Trees
         Jalal Etesami
         Negar Kiyavash
         Todd Coleman
 
S15.T8.3: Learning Markov Graphs Up To Edit Distance
         Abhik Das
         Praneeth Netrapalli
         Sujay Sanghavi
         Sriram Vishwanath
 
S15.T8.4: Passive Learning of the Interference Graph of a Wireless Network
         Jing Yang
         Stark Draper
         Robert Nowak
 

S15.T9: Strings, Sorting, and Biology

Time: Friday, July 6, 09:50 - 11:10
Location: Stratton West Lounge (201)
Session Chair: Toby Berger, University of Virginia
 
S15.T9.1: Information Theory for DNA Sequencing: Part 1: A Basic Model
         Abolfazl Motahari
         Guy Bresler
         David Tse
 
S15.T9.2: The Information Content in Sorting Algorithms
         Ludwig Busse
         Morteza Chehreghani
         Joachim Buhmann
 
S15.T9.3: String reconciliation with unknown edit distance
         Aryeh Kontorovich
         Ari Trachtenberg
 
S15.T9.4: Modeling Biological Circuits with Urn Functions
         David Lee
         Jehoshua Bruck
 

S16.T1: Coded Storage and Caching

Time: Friday, July 6, 11:30 - 13:10
Location: Kresge Rehearsal B (030)
Session Chair: Kenneth Shum, Chinese University of Hong Kong
 
S16.T1.1: Allocations for Heterogenous Distributed Storage
         Vasileios Ntranos
         Giuseppe Caire
         Alex Dimakis
 
S16.T1.2: Codes Can Reduce Queueing Delay in Data Centers
         Longbo Huang
         Sameer Pawar
         Hao Zhang
         Kannan Ramchandran
 
S16.T1.3: Locally Repairable Codes
         Dimitris Papailiopoulos
         Alex Dimakis
 
S16.T1.4: Optimal Linear Codes with a Local-Error-Correction Property
         N Prakash
         Govinda Kamath
         V Lalitha
         P Vijay Kumar
 
S16.T1.5: Wireless Device-to-Device Communications with Distributed Caching
         Negin Golrezaei
         Alex Dimakis
         Andreas Molisch
 

S16.T2: Gaussian Interference Channels

Time: Friday, July 6, 11:30 - 13:10
Location: Kresge Auditorium (109)
Session Chair: Max Costa, Universidade Estadual de Campinas
 
S16.T2.1: Capacity for MIMO Gaussian Interference Channels With Generally Strong and Noisy Interference
         Xiaohu Shang
         H. Vincent Poor
 
S16.T2.2: The Han-Kobayashi Region for a Class of Gaussian Interference Channels with Mixed Interference
         Yu Zhao
         Fangfang Zhu
         Biao Chen
 
S16.T2.3: Simple transmission strategies for interference channel
         Jung Hyun Bae
         Jungwon Lee
         Inyup Kang
 
S16.T2.4: Two-way Interference Channels
         Changho Suh
         I-Hsiang Wang
         David Tse
 
S16.T2.5: A New Outer Bound on the Capacity Region of Gaussian Interference Channels
         Junyoung Nam
         Giuseppe Caire
 

S16.T3: MIMO coding

Time: Friday, July 6, 11:30 - 13:10
Location: Stratton Sala de Puerto Rico (202)
Session Chair: Petros Elia, Eurécom
 
S16.T3.1: On the Sphere Decoding Complexity of High Rate Multigroup ML Decodable STBCs
         Lakshmi Prasad Natarajan
         Pavan Srinath
         B. Sundar Rajan
 
S16.T3.2: Feedback-aided complexity reductions in ML and Lattice decoding
         Arun Singh
         Petros Elia
 
S16.T3.3: Time-Varying Space-Only Codes
         Dieter Duyck
         Marc Moeneclaey
         Sheng Yang
         Fambirai Takawira
         Joseph Jean Boutros
 
S16.T3.4: A Class of Iterated Fast Decodable Space-Time Codes for 2^n Tx Antennas
         Nadya Markin
         Frederique Oggier
 
S16.T3.5: Space-Time MIMO Multicasting
         Idan Livni
         Anatoly Khina
         Ayal Hitron
         Uri Erez
 

S16.T4: Delay and Deadline Constrained Communication

Time: Friday, July 6, 11:30 - 13:10
Location: Stratton 20 Chimneys (306)
Session Chair: Roy Yates, Rutgers University
 
S16.T4.1: Approximating the Timely Throughput of Heterogeneous Wireless Networks
         Sina Lashgari
         Salman Avestimehr
 
S16.T4.2: Wireless Downloading Delay under Proportional Fair Scheduling with Coupled Service and Requests: An Approximated Analysis
         Karthikeyan Shanmugam
         Giuseppe Caire
 
S16.T4.3: Delay-Optimal Buffered Decode-and-Forward for Two-hop Networks with Random Link Connectivity
         Ying Cui
         Vincent Lau
         Edmund Yeh
 
S16.T4.4: Delay-Exponent of Delay-Universal Compress-and-Forward Relaying
         Khoa Nguyen
 
S16.T4.5: On Playback Delay in Streaming Communication
         Gauri Joshi
         Yuval Kochman
         Gregory Wornell
 

S16.T5: Decoding Techniques for LDPC Codes

Time: Friday, July 6, 11:30 - 13:10
Location: Kresge Little Theatre (035)
Session Chair: Ezio Biglieri, Universitat Pompeu Fabra
 
S16.T5.1: Jar Decoding: LDPC Coding Theorems for Binary Input Memoryless Channels
         En-hui Yang
         Jin Meng
 
S16.T5.2: A Two Stage Selective Averaging LDPC Decoding
         Dinesh Kumar A.
         Ambedkar Dukkipati
 
S16.T5.3: Quantized Min-Sum Decoders with Low Error Floor for LDPC Codes
         Xiaojie Zhang
         Paul Siegel
 
S16.T5.4: Enhancing the Error Correction of Finite Alphabet Iterative Decoders via Adaptive Decimation
         Shiva Planjery
         Bane Vasić
         David Declercq
 
S16.T5.5: Selecting Two-Bit Bit Flipping Algorithms for Collective Error Correction
         Dung Nguyen
         Bane Vasić
         Michael W. Marcellin
 

S16.T6: Cyclic Codes and Symbol-Pair Codes

Time: Friday, July 6, 11:30 - 13:10
Location: Kresge Rehearsal A (033)
Session Chair: Vladimir Sidorenko, Universität Ulm
 
S16.T6.1: Maximum Distance Separable Symbol-Pair Code
         Yeow Meng Chee
         Han Mao Kiah
         Chengmin Wang
 
S16.T6.2: Decoding of Cyclic Codes over Symbol-Pair Read Channels
         Eitan Yaakobi
         Jehoshua Bruck
         Paul Siegel
 
S16.T6.3: Describing A Cyclic Code by Another Cyclic Code
         Alexander Zeh
         Sergey Bezzateev
 
S16.T6.4: Weight Distribution of Some Cyclic Codes
         Sung-Tai Choi
         Ji-Youp Kim
         Jong-Seon No
         Habong Chung
 
S16.T6.5: Self-Dual Repeated Root Cyclic and Negacyclic Codes Over Finite Fields
         Kenza Guenda
         T. Aaron Gulliver
 

S16.T7: Feedback

Time: Friday, July 6, 11:30 - 13:10
Location: Stratton (407)
Session Chair: Haim Permuter, Ben-Gurion University of the Negev
 
S16.T7.1: Approximate Feedback Capacity of the Gaussian Multicast Channel
         Changho Suh
         Naveen Goela
         Michael Gastpar
 
S16.T7.2: A sequential transmission scheme for unifilar finite-state channels with feedback based on posterior matching
         Achilleas Anastasopoulos
 
S16.T7.3: Optimal Selective Feedback Policies for Opportunistic Beamforming Under Peak Feedback Constraints
         Tharaka Samarasinghe
         Hazer Inaltekin
         Jamie Evans
 
S16.T7.4: A Rate-compatible Sphere-packing Analysis of Feedback Coding with Limited Retransmissions
         Adam Williamson
         Tsung-Yi Chen
         Richard Wesel
 
S16.T7.5: Completely Decoupled Space-Time Block Codes with Low-Rate Feedback
         Wei Liu
         Mathini Sellathurai
         Jing Lei
         Ji-Bo Wei
         Chaojing Tang
 

S16.T8: Error Exponents

Time: Friday, July 6, 11:30 - 13:10
Location: Stratton (491)
Session Chair: David Burshtein, Tel-Aviv University
 
S16.T8.1: On Reliability Functions for Single-Message Unequal Error Protection
         Da Wang
         Venkat Chandar
         Sae-Young Chung
         Gregory Wornell
 
S16.T8.2: Error Exponents of Optimum Erasure/List and Ordinary Decoding for Channels with Side Information
         Erez Sabbag
         Neri Merhav
 
S16.T8.3: Extremality Properties for Gallager's Random Coding Exponent
         Mine Alsan
 
S16.T8.4: Refinement of the Sphere-Packing Bound
         Yucel Altug
         Aaron Wagner
 
S16.T8.5: On Decoding Error Exponent of Gaussian Channel with Noisy Feedback: Nonexponential Number of Messages
         Marat Burnashev
         Hirosuke Yamamoto
 

S16.T9: Information Theory in Biology

Time: Friday, July 6, 11:30 - 13:10
Location: Stratton West Lounge (201)
Session Chair: Wojciech Szpankowski, Purdue University
 
S16.T9.1: Collective Sensing Capacity of bacteria populations
         Arash Einolghozati
         Mohsen Sardari
         Faramarz Fekri
 
S16.T9.2: A Berger-Levy Energy Efficient Neuron Model with Unequal Synaptic Weights
         Jie Xing
         Toby Berger
         Terrence Sejnowski
 
S16.T9.3: Design Principles and Specifications for Neural-like Computation Under Constraints on Information Preservation and Energy Costs as Analyzed with Statistical Theory
         William Levy
         Toby Berger
 
S16.T9.4: The peak constrained additive inverse Gaussian noise channel
         Andrew Eckford
         Srinivas Kothapalli
         Raviraj Adve
 

S17.T1: Rank-Modulation Coding

Time: Friday, July 6, 15:00 - 16:40
Location: Kresge Rehearsal B (030)
Session Chair: Eitan Yaakobi, Caltech / UCSD
 
S17.T1.1: Systematic Error-Correcting Codes for Rank Modulation
         Hongchao Zhou
         Anxiao Andrew Jiang
         Jehoshua Bruck
 
S17.T1.2: Snake-in-the-Box Codes for Rank Modulation
         Yonatan Yehezkeally
         Moshe Schwartz
 
S17.T1.3: Rank Modulation for Translocation Error Correction
         Farzad Farnoud
         Vitaly Skachek
         Olgica Milenkovic
 
S17.T1.4: On ML-Certificate Linear Constraints for Rank Modulation with Linear Programming Decoding and its Application to Compact Graphs
         Manabu Hagiwara
 
S17.T1.5: Linear Programming Upper Bounds on Permutation Code Sizes From Coherent Configurations Related to the Kendall-Tau Distance Metric
         Fabian Lim
         Manabu Hagiwara
 

S17.T2: Communication and Computation over Multiple Access Channels

Time: Friday, July 6, 15:00 - 16:40
Location: Kresge Auditorium (109)
Session Chair: Ibrahim Abou-Faycal, American University of Beirut
 
S17.T2.1: Lossy Communication over Multiple-Access Channels with Feedback
         Paolo Minero
         Safitha Jayaraj
 
S17.T2.2: The Compute-and-Forward Transform
         Or Ordentlich
         Uri Erez
         Bobak Nazer
 
S17.T2.3: On Modulo-Sum Computation over an Erasure Multiple Access Channel
         Ashish Khisti
         Brett Hern
         Krishna Narayanan
 
S17.T2.4: Capacity Regions of Partly Asynchronous Multiple Access Channels
         Lóránt Farkas
         Tamás Kói
 

S17.T3: MIMO Equalization, Diversity and Optimization

Time: Friday, July 6, 15:00 - 16:40
Location: Stratton Sala de Puerto Rico (202)
Session Chair: B. Sundar Rajan, Indian Institute of Science, Bangalore
 
S17.T3.1: Performance of MIMO Single-Carrier Frequency Domain Zero-Forcing Equalizer
         Ahmed Mehana
         Aria Nosratinia
 
S17.T3.2: Matrix Exponential Learning: Distributed Optimization in MIMO systems
         Panayotis Mertikopoulos
         Elena Veronica Belmega
         Aris Moustakas
 
S17.T3.3: Asymptotic Data Rates of Receive-Diversity Systems with MMSE Estimation and Interferers at Correlated Locations
         Siddhartan Govindasamy
 
S17.T3.4: Connecting DMT of Division Algebra Space-Time Codes and Point Counting in Lie Groups
         Roope Vehkalahti
         Laura Luzzi
 
S17.T3.5: DMT-optimal, Low ML-Complexity STBC-Schemes for Asymmetric MIMO Systems
         Pavan Srinath
         B. Sundar Rajan
 

S17.T4: Communication Models

Time: Friday, July 6, 15:00 - 16:40
Location: Stratton 20 Chimneys (306)
Session Chair: Chao Tian, AT&T Labs - Research
 
S17.T4.1: Coordination via a Relay
         Farzin Haddadpour
         Mohammad Hossein Yassaee
         Amin Gohari
         Mohammad Reza Aref
 
S17.T4.2: Channel Simulation via Interactive Communications
         Mohammad Hossein Yassaee
         Amin Gohari
         Mohammad Reza Aref
 
S17.T4.3: Action Dependent Strictly Causal State Communication
         Chiranjib Choudhuri
         Urbashi Mitra
 
S17.T4.4: Multi-stage Coding for Channels With a Rewrite Option and Reversible Input
         Kittipong Kittichokechai
         Tobias Oechtering
         Mikael Skoglund
 
S17.T4.5: Amplification of the Hidden Gaussian Channel States
         Chao Tian
 

S17.T5: Cyclic and Quasicyclic LDPC Codes

Time: Friday, July 6, 15:00 - 16:40
Location: Kresge Little Theatre (035)
Session Chair: Dariush Divsalar, NASA - Jet Propulsion Lab
 
S17.T5.1: Low-Density Arrays of Circulant Matrices: Rank and Row-Redundancy, and QC-LDPC Codes
         Qin Huang
         Keke Liu
         Zulin Wang
 
S17.T5.2: On the Girth of Quasi Cyclic Protograph LDPC Codes
         Mehdi Karimi
         Amir Banihashemi
 
S17.T5.3: A Greedy Search for Improved QC LDPC Codes with Good Girth Profile and Degree Distribution
         Irina Bocharova
         Florian Hug
         Rolf Johannesson
         Boris Kudryashov
 
S17.T5.4: Trapping Set Structure of Finite Geometry LDPC Codes
         Qiuju Diao
         Ying Tai
         Shu Lin
         Khaled Abdel-Ghaffar
 
S17.T5.5: A New Parity Structure With Multi-Weight Circulants for QC LDPC Codes
         Hosung Park
         Seokbeom Hong
         Jong-Seon No
         Dong-Joon Shin
 

S17.T6: Codes over Rings

Time: Friday, July 6, 15:00 - 16:40
Location: Kresge Rehearsal A (033)
Session Chair: Aaron Gulliver, University of Victoria
 
S17.T6.1: Lagrange Interpolation Polynomials and Generalized Reed-Solomon Codes over Rings of Matrices
         Liping Wang
 
S17.T6.2: Extensions of Z2Z4-Additive Self-Dual Codes Preserving Their Properties
         Muhammad Bilal
         Joaquim Borges
         Steven Dougherty
         Cristina Fernández-Córdoba
 
S17.T6.3: Greedy Codes over Z_4
         Kenza Guenda
         T. Aaron Gulliver
         Arash Sheikholeslam
 
S17.T6.4: Construction of Barnes-Wall Lattices from Linear Codes over Rings
         J Harshan
         Emanuele Viterbo
         Jean-Claude Belfiore
 
S17.T6.5: On the algebraic representation of selected optimal non-linear binary codes
         Marcus Greferath
         Jens Zumbrägel
 

S17.T7: Interference Channels with Feedback

Time: Friday, July 6, 15:00 - 16:40
Location: Stratton (407)
Session Chair: Richard Wesel, University of California, Los Angeles
 
S17.T7.1: Full-duplex Transmitter Cooperation, Feedback, and the Degrees of Freedom of SISO Gaussian Interference and X Channels
         Mohammad Javad Abdoli
         Akbar Ghasemi
         Amir K. Khandani
 
S17.T7.2: Generalized Degrees of Freedom of the Symmetric K-user Interference Channel with Feedback
         Soheil Mohajer
         Ravi Tandon
         H. Vincent Poor
 
S17.T7.3: Feedback in the $K$-user Interference Channel
         Dimitris Papailiopoulos
         Changho Suh
         Alex Dimakis
 
S17.T7.4: The Generalized Multiplexing Gain Region of the Slow Fading MIMO Interference Channel and its Achievability with Limited Feedback
         Sanjay Karmakar
         Mahesh Varanasi
 
S17.T7.5: On the ARQ Protocols over the Z-interference Channels: Diversity-Multiplexing-Delay Tradeoff
         Mohamed Nafea
         Doha Hamza
         Karim Seddik
         Mohammed Nafie
         Hesham El Gamal