You are here
Authors Index
A B C D E F G H I J K L M N O P R S T U V W X Y Z
Author | Session | Start page | Title |
---|---|---|---|
A A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Abbe, Emmanuel | TuC1.1 | Polar Coding for Secret-Key Generation | |
Afşer, Hüseyin | TuC1.3 | Channel Polarization with Higher Order Memory | |
Agustin, Adrian | ThC3.1 | Degrees of Freedom of the Rank-Deficient MIMO X channel | |
Ahmadian, Mahmoud | ThB3.4 | On the Reliable Transmission of Correlated Sources over Two-Relay Network | |
Aihara, Kazuyuki | ThC2.3 | Signals that can be easily time-frequency synchronized from their ambiguity function | |
Akhbari, Bahareh | ThB3.4 | On the Reliable Transmission of Correlated Sources over Two-Relay Network | |
Aksoylar, Cem | FrC2.3 | Sparse Signal Processing with Linear and Non-Linear Observations: A Unified Shannon Theoretic Approach | |
Akyol, Emrah | ThE3.3 | A Deterministic Annealing Approach to Optimization of Zero-delay Source-Channel Codes | |
Alkhouli, Tamer | ThC2.4 | Novel Tight Classification Error Bounds under Mismatch Conditions based on $f$-Divergence | |
Alnuweiri, Hussein | FrC2.2 | Distortion Minimization in Layered Broadcast Transmission of a Gaussian Source Over Rayleigh Channels | |
Alon, Noga | ThB2.1 | From Bandits to Experts: A Tale of Domination and Independence | |
Alsan, Mine | TuB1.2 | A Lower Bound on Achievable Rates by Polar Codes with Mismatch Polar Decoding | |
Amjad, Rana Ali | FrB2.3 | Fixed-to-Variable Length Resolution Coding for Target Distributions | |
Aref, Mohammad Reza | ThB3.4 | On the Reliable Transmission of Correlated Sources over Two-Relay Network | |
FrB2.1 | When is it possible to simulate a DMC channel from another? | ||
Asadi, Meysam | ThE2.4 | Estimation of transition and stationary probabilities of slow mixing Markov processes | |
Asnani, Himanshu | TuB2.4 | Operational Extremality of Gaussianity in Network Compression, Communication, and Coding | |
Atia, George | FrC2.3 | Sparse Signal Processing with Linear and Non-Linear Observations: A Unified Shannon Theoretic Approach | |
Avestimehr, Salman | TuB2.4 | Operational Extremality of Gaussianity in Network Compression, Communication, and Coding | |
Awan, Zohaib Hassan | TuC3.3 | Secure Degrees of Freedom of MIMO X-Channels with Output Feedback and Delayed CSI | |
Ayday, Erman | TuE2.2 | Iterative Similarity Inference via Message Passing in Factor Graphs for Collaborative Filtering | |
B A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Bai, Bao-Ming | ThB1.3 | New Geometrical Spectra of Linear Codes with Applications to Performance Analysis | |
TuF1.2 | Nonbinary LDPC-Coded Differential Modulation: Performance and Decoding Algorithm | ||
Bakshi, Mayank | TuE2.3 | Stochastic Threshold Group Testing | |
Banerjee, Siddhartha | WeB3.1 | Linear Network Coding for Multiple Groupcast Sessions: An Interference Alignment Approach | |
Barbier, Jean | WeB1.3 | Robust error correction for real-valued signals via message-passing decoding and spatial coupling | |
Barron, Andrew | TuF2.3 | Asymptotically Minimax Regret by Bayes Mixtures for Non-exponential Families | |
Bazarsky, Alex | TuF1.3 | Design of Non-Binary Quasi-Cyclic LDPC codes by ACE optimization | |
Beck, Eugen | ThC2.4 | Novel Tight Classification Error Bounds under Mismatch Conditions based on $f$-Divergence | |
Behroozi, Hamid | ThC3.2 | Interference Neutralization using Lattice Codes | |
Belfiore, Jean-Claude | WeC1.3 | Enabling Multiplication in Lattice Codes via Construction A | |
Benammar, Meryem | ThF3.4 | On the Role of Interference Decoding in Simultaneous Broadcast Channels | |
Bernal, José Joaquín | ThB1.1 | Computing the Camion's multivariate BCH bound | |
Bhattacharya, Chiranjib | ThF2.2 | Lovasz theta, SVMs and Applications | |
Bitouzé, Nicolas | TuB3.4 | Protecting Data Against Unwanted Inferences | |
Bloch, Matthieu | TuC1.1 | Polar Coding for Secret-Key Generation | |
FrB2.2 | Joint Channel Intrinsic Randomness and Channel Resolvability | ||
Boche, Holger | TuF3.4 | On the Weakest Resource for Coordination in AV-MACs with Conferencing Encoders | |
Böcherer, Georg | FrB2.3 | Fixed-to-Variable Length Resolution Coding for Target Distributions | |
Bossert, Martin | WeB2.3 | On the Noise Sensitivity and Mutual Information of (Nested-) Canalizing Boolean Functions | |
Brito, Cesar | TuC1.2 | On Polarization for the Linear Operator Channel | |
Bueno-Carreño, Diana | ThB1.1 | Computing the Camion's multivariate BCH bound | |
Bunte, Christoph | FrC1.1 | On the Average-Listsize Capacity and the Cutoff Rate of Discrete Memoryless Channels with Feedback | |
Burnashev, Marat | TuE1.1 | Thresholds of Spatially Coupled Systems via Lyapunov's Method | |
C A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Cai, Sheng | TuE2.3 | Stochastic Threshold Group Testing | |
Caire, Giuseppe | TuE2.4 | Optimal Binary Measurement Matrices for Compressed Sensing | |
TuE3.1 | Fundamental Limits of Distributed Caching in D2D Wireless Networks | ||
TuE3.2 | Analog Index Coding over Block-Fading MISO Broadcast Channels with Feedback | ||
FrB3.3 | Two-Unicast Two-Hop Interference Network: Finite-Field Model | ||
Calderbank, Robert | TuF2.2 | Information-theoretic Limits on the Classification of Gaussian Mixtures: Classification on the Grassmann Manifold | |
Campello, Antonio | WeB1.2 | Projections, Dissections and Bandwidth Expansion Mappings | |
Cardone, Martina | FrC3.2 | Gaussian Half-Duplex Relay Networks: Improved Gap and a Connection with the Assignment Problem | |
Cesa-Bianchi, Nicolò | ThB2.1 | From Bandits to Experts: A Tale of Domination and Independence | |
Chakraborty, Supriyo | TuB3.4 | Protecting Data Against Unwanted Inferences | |
Chan, Chun Lam | TuE2.3 | Stochastic Threshold Group Testing | |
Chan, Chung | WeB3.3 | Combinatorial Flow over Cyclic Linear Networks | |
Chan, Terence | TuB2.2 | Characterising Correlation via Entropy Functions | |
Chen, Jun | TuB2.1 | On Symmetric Multiple Description Coding | |
Chen, Qi | FrB1.2 | Two-Partition-Symmetrical Entropy Function Regions | |
Chen, Xu | TuF3.2 | Gaussian Many-Access Channels: Definition and Symmetric Capacity | |
Chern, Bobbie | FrB3.2 | On information flow and feedback in relay networks | |
Chou, Remi | TuC1.1 | Polar Coding for Secret-Key Generation | |
Cohen, Asaf | TuF3.3 | MAC Capacity Under Distributed Scheduling of Multiple Users and Linear Decorrelation | |
Costa, Sueli | WeB1.2 | Projections, Dissections and Bandwidth Expansion Mappings | |
Costello, Daniel | TuE1.4 | A Finite Length Performance Analysis of LDPC Codes Constructed by Connecting Spatially Coupled Chains | |
Crespo, Pedro | TuF2.4 | Asymptotically equivalent sequences of matrices and relative entropy | |
Cuff, Paul | ThC1.4 | The Likelihood Encoder for Source Coding | |
TuC3.2 | Secrecy in Cascade Networks | ||
ThF1.4 | A Connection between Good Rate-distortion Codes and Backward DMCs | ||
Czap, László | TuC3.1 | Exploiting Common Randomness: a Resource for Network Secrecy | |
D A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Das, Abhik | WeB3.1 | Linear Network Coding for Multiple Groupcast Sessions: An Interference Alignment Approach | |
Das, Niladri | WeB3.2 | On the capacity of $ms/3t$ and $3s/nt$ sum-networks | |
Dean, Thomas | TuB3.2 | Physical-Layer Cryptography Through Massive MIMO | |
Deliç, Hakan | TuC1.3 | Channel Polarization with Higher Order Memory | |
Devroye, Natasha | WeC3.3 | The Sum-Capacity of different $K$-user Cognitive Interference Channels in Strong Interference | |
Diggavi, Suhas | TuC3.1 | Exploiting Common Randomness: a Resource for Network Secrecy | |
WeC3.4 | On Degrees-of-Freedom of Full-Duplex Uplink/Downlink Channel | ||
Dimakis, Alexandros | TuE2.4 | Optimal Binary Measurement Matrices for Compressed Sensing | |
Do, Hieu | FrC3.3 | Capacity Region of a Class of Interfering Relay Channels | |
Dolecek, Lara | TuB3.4 | Protecting Data Against Unwanted Inferences | |
ThE1.3 | Constrained Rank Modulation Schemes | ||
Duan, Ruchen | ThC3.4 | State-Dependent Gaussian Z-Channel with Mismatched Side-Information and Interference | |
Dubhashi, Devdatt | ThF2.2 | Lovasz theta, SVMs and Applications | |
Duchi, John | ThF2.3 | Local Privacy, Quantitative Data Processing Inequalities, and Statistical Minimax Rates | |
E A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Effros, Michelle | WeC3.2 | Zero vs.\ $\varepsilon$ Error in Interference Channels | |
WeB3.4 | Outer Bounds and a Functional Study of the Edge Removal Problem | ||
ThE3.4 | Capacity Region of Multi-Resolution Streaming in Peer-to-Peer Networks | ||
Einolghozati, Arash | TuE2.2 | Iterative Similarity Inference via Message Passing in Factor Graphs for Collaborative Filtering | |
El Gamal, Hesham | FrC3.4 | The Deterministic Capacity of Relay Networks with Relay Private Messages | |
El-Khatib, Rafah | TuE1.2 | Displacement Convexity -- A Useful Framework for the Study of Spatially Coupled Codes | |
Emad, Amin | ThE2.2 | MCUIUC - A New Framework for Metagenomic Read Compression | |
FrC2.1 | Compression of Noisy Signals with Information Bottlenecks | ||
Ephremides, Anthony | ThB3.3 | The Stability Region of the Two-User Interference Channel | |
FrB3.1 | On the Stability Region of a Relay-Assisted Multiple Access Scheme | ||
Erez, Uri | WeC1.2 | Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap | |
Ernvall, Toni | ThE1.1 | Exact-Regenerating Codes between MBR and MSR Points | |
F A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Farnoud (Hassanzadeh), Farzad | TuE2.1 | Aggregating Rankings with Positional Constraints | |
Feder, Meir | ThB2.4 | Prediction of Individual Sequences with Finite-Memory Universal Predictors | |
Fekri, Faramarz | TuE2.2 | Iterative Similarity Inference via Message Passing in Factor Graphs for Collaborative Filtering | |
Fernandes, Winston | WeC2.2 | A Phase Transition for the Uniform Distribution in the Pattern Maximum Likelihood Problem | |
Ferreira, Hendrik | ThB1.4 | Concatenated Permutation Block Codes based on Set Partitioning for Substitution and Deletion Error-Control | |
Fitzek, Frank | TuC2.4 | Network Coding Designs Suited for the Real World: What works, What doesn't, What's Promising | |
Fragouli, Christina | TuC3.1 | Exploiting Common Randomness: a Resource for Network Secrecy | |
G A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Gan, Lu | ThC1.3 | Lattice Quantization Noise Revisited | |
Garivier, Aurélien | ThE2.1 | Informational Confidence Bounds for Self-Normalized Averages and Applications | |
Geiger, Bernhard | WeB2.2 | Information-Preserving Markov Aggregation | |
Geng, Chunhua | ThB3.1 | Multilevel Topological Interference Management | |
Gentile, Claudio | ThB2.1 | From Bandits to Experts: A Tale of Domination and Independence | |
Ghasemi-Goojani, Shahab | ThC3.2 | Interference Neutralization using Lattice Codes | |
Girnyk, Maksym | ThF3.2 | Multi-Cell Cooperation with Random User Locations under Arbitrary Signaling | |
Gohari, Amin | FrB2.1 | When is it possible to simulate a DMC channel from another? | |
Goldsmith, Andrea | TuB3.2 | Physical-Layer Cryptography Through Massive MIMO | |
ThB3.2 | On the Interference Channel with Common Messages and the role of Rate-Sharing | ||
TuE3.4 | A General Framework for Statistically Characterizing the Dynamics of MIMO Channels | ||
Grant, Alex | TuB2.2 | Characterising Correlation via Entropy Functions | |
Gripon, Vincent | ThE1.4 | Maximum Likelihood Associative Memories | |
Guan, Yong Liang | ThF1.3 | On the Mutual Information between Random Variables in Networks | |
Guo, Dongning | TuF3.2 | Gaussian Many-Access Channels: Definition and Symmetric Capacity | |
Gurewitz, Omer | TuF3.3 | MAC Capacity Under Distributed Scheduling of Multiple Users and Linear Decorrelation | |
Gutiérrez-Gutiérrez, Jesús | TuF2.4 | Asymptotically equivalent sequences of matrices and relative entropy | |
H A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Haddadpour, Farzin | FrB2.1 | When is it possible to simulate a DMC channel from another? | |
Hassani, S. Hamed | ThF1.1 | The Least Degraded and the Least Upgraded Channel with respect to a Channel Family | |
TuB1.3 | Scaling Exponent of List Decoders with Applications to Polar Codes | ||
Heymann, Reolyn | ThB1.4 | Concatenated Permutation Block Codes based on Set Partitioning for Substitution and Deletion Error-Control | |
Ho, Tracey | ThE3.4 | Capacity Region of Multi-Resolution Streaming in Peer-to-Peer Networks | |
Hong, SongNam | FrB3.3 | Two-Unicast Two-Hop Interference Network: Finite-Field Model | |
Huang, Sheng | ThE3.1 | On Existence of Optimal Linear Encoders over Non-field Rings for Data Compression with Application to Computing | |
Huang, Yu-Chih | WeC1.1 | Lattice Codes Based on Product Constructions over $\mathbb{F}_q^2$ with Applications to Compute-and-Forward | |
Høst-Madsen, Anders | WeC2.1 | Information Theory for Atypical Sequences | |
I A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Ishwar, Prakash | TuF2.1 | An Impossibility Result for High Dimensional Supervised Learning | |
J A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Jafar, Syed | ThB3.1 | Multilevel Topological Interference Management | |
Jaggi, Sidharth | TuE2.3 | Stochastic Threshold Group Testing | |
Jethava, Vinay | ThF2.2 | Lovasz theta, SVMs and Applications | |
Ji, Mingyue | TuE3.1 | Fundamental Limits of Distributed Caching in D2D Wireless Networks | |
Jitsumatsu, Yutaka | ThC2.3 | Signals that can be easily time-frequency synchronized from their ambiguity function | |
Jordan, Michael | ThF2.3 | Local Privacy, Quantitative Data Processing Inequalities, and Statistical Minimax Rates | |
K A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Kampeas, Joseph | TuF3.3 | MAC Capacity Under Distributed Scheduling of Multiple Users and Linear Decorrelation | |
Karagoz, Batuhan | ThE3.4 | Capacity Region of Multi-Resolution Streaming in Peer-to-Peer Networks | |
Karbasi, Amin | WeB2.4 | Coupled Neural Associative Memories | |
Karl, William | TuF2.1 | An Impossibility Result for High Dimensional Supervised Learning | |
Kashyap, Navin | WeC2.2 | A Phase Transition for the Uniform Distribution in the Pattern Maximum Likelihood Problem | |
ThF1.2 | On 2-D Non-Adjacent-Error Channel Models | ||
Khisti, Ashish | TuC2.2 | Source Broadcasting over Erasure Channels: Distortion Bounds and Code Design | |
ThC3.4 | State-Dependent Gaussian Z-Channel with Mismatched Side-Information and Interference | ||
Khoshnevisan, Mostafa | TuF3.1 | Achievable Rates for Intermittent Multi-Access Communication | |
Kim, Minji | ThE2.2 | MCUIUC - A New Framework for Metagenomic Read Compression | |
Kliewer, Joerg | TuC1.2 | On Polarization for the Linear Operator Channel | |
Klotz, Johannes | WeB2.3 | On the Noise Sensitivity and Mutual Information of (Nested-) Canalizing Boolean Functions | |
Knopp, Raymond | FrC3.2 | Gaussian Half-Duplex Relay Networks: Improved Gap and a Connection with the Assignment Problem | |
Kobayashi, Mari | TuE3.2 | Analog Index Coding over Block-Fading MISO Broadcast Channels with Feedback | |
Koga, Hiroki | FrB1.4 | Characterization of the Smooth Rényi Entropy Using Majorization | |
Kohda, Tohru | ThC2.3 | Signals that can be easily time-frequency synchronized from their ambiguity function | |
Kolte, Ritesh | FrC3.1 | Improved Capacity Approximations for Gaussian Relay Networks | |
Kontoyiannis, Ioannis | WeC2.4 | The Entropy of Sums and Rusza's Divergence on Abelian Groups | |
Kostina, Victoria | ThC1.1 | Nonasymptotic Noisy Source Coding | |
Kountouris, Marios | ThB3.3 | The Stability Region of the Two-User Interference Channel | |
FrB3.1 | On the Stability Region of a Relay-Assisted Multiple Access Scheme | ||
Koyluoglu, Onur Ozan | TuB1.4 | Polar Coding for Fading Channels | |
Krzakala, Florent | WeB1.3 | Robust error correction for real-valued signals via message-passing decoding and spatial coupling | |
Kunimatsu, Shohei | FrB2.4 | A New Unified Method for Intrinsic Randomness Problems of General Sources | |
L A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Labeau, Fabrice | TuB3.3 | Secrecy & Rate Adaptation for Secure HARQ Protocols | |
Laneman, J. Nicholas | TuF3.1 | Achievable Rates for Intermittent Multi-Access Communication | |
Langberg, Michael | WeC3.2 | Zero vs.\ $\varepsilon$ Error in Interference Channels | |
WeB3.4 | Outer Bounds and a Functional Study of the Edge Removal Problem | ||
Lapidoth, Amos | FrC1.1 | On the Average-Listsize Capacity and the Cutoff Rate of Discrete Memoryless Channels with Feedback | |
Le Treust, Mael | TuB3.3 | Secrecy & Rate Adaptation for Secure HARQ Protocols | |
Lee, Eun Jee | WeB3.4 | Outer Bounds and a Functional Study of the Edge Removal Problem | |
Lelarge, Marc | ThF2.1 | Bypassing Correlation Decay for Matchings with an Application to XORSAT | |
TuB3.1 | Spectrum Bandit Optimization | ||
WeB2.1 | Reconstruction in the Labeled Stochastic Block Model | ||
Levi, Ilia | WeC3.2 | Zero vs.\ $\varepsilon$ Error in Interference Channels | |
Li, Minghua | TuF1.2 | Nonbinary LDPC-Coded Differential Modulation: Performance and Decoding Algorithm | |
Li, Yao | TuC2.2 | Source Broadcasting over Erasure Channels: Distortion Bounds and Code Design | |
Li, Ying | TuF1.1 | Design of Masking Matrix for QC-LDPC Codes | |
Liang, Yingbin | ThC3.4 | State-Dependent Gaussian Z-Channel with Mismatched Side-Information and Interference | |
Ligo, Jonathan | ThE2.2 | MCUIUC - A New Framework for Metagenomic Read Compression | |
Ling, Cong | ThC1.3 | Lattice Quantization Noise Revisited | |
Litsyn, Simon | TuF1.3 | Design of Non-Binary Quasi-Cyclic LDPC codes by ACE optimization | |
Liu, Jia | ThB1.3 | New Geometrical Spectra of Linear Codes with Applications to Performance Analysis | |
Liu, Wei | ThF1.1 | The Least Degraded and the Least Upgraded Channel with respect to a Channel Family | |
Liu, Yang | TuF1.1 | Design of Masking Matrix for QC-LDPC Codes | |
Liu, Yunshu | FrB1.3 | Bounding the Entropic Region via Information Geometry | |
Lopez-Martinez, Francisco Javier | TuE3.4 | A General Framework for Statistically Characterizing the Dynamics of MIMO Channels | |
Loyka, Sergey | TuC3.4 | The Secrecy Capacity of a Compound MIMO Gaussian Channel | |
Lucani, Daniel | TuC2.4 | Network Coding Designs Suited for the Real World: What works, What doesn't, What's Promising | |
Luzzi, Laura | WeB1.1 | A new design criterion for spherically-shaped division algebra-based space-time codes | |
M A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
M. Olmos, Pablo | TuE1.4 | A Finite Length Performance Analysis of LDPC Codes Constructed by Connecting Spatially Coupled Chains | |
TuE1.3 | A Closed-Form Scaling Law for Convolutional LDPC Codes Over the BEC | ||
Ma, Xiao | TuF1.2 | Nonbinary LDPC-Coded Differential Modulation: Performance and Decoding Algorithm | |
ThB1.3 | New Geometrical Spectra of Linear Codes with Applications to Performance Analysis | ||
Maamari, Diana | WeC3.3 | The Sum-Capacity of different $K$-user Cognitive Interference Channels in Strong Interference | |
Macris, Nicolas | TuE1.2 | Displacement Convexity -- A Useful Framework for the Study of Spatially Coupled Codes | |
Madiman, Mokshay | WeC2.4 | The Entropy of Sums and Rusza's Divergence on Abelian Groups | |
Maier, Henning | FrB3.4 | Cyclic Interference Neutralization on the $2\times 2\times 2$ Full-Duplex Two-Way Relay-Interference Channel | |
Manickam, Shivkumar | ThF1.2 | On 2-D Non-Adjacent-Error Channel Models | |
Mansour, Yishay | ThB2.1 | From Bandits to Experts: A Tale of Domination and Independence | |
Martos-Naya, Eduardo | TuE3.4 | A General Framework for Statistically Characterizing the Dynamics of MIMO Channels | |
Mashiach, Adam | ThE3.2 | Sampling versus Random Binning for Multiple Descriptions of a Bandlimited Source | |
Massoulié, Laurent | WeB2.1 | Reconstruction in the Labeled Stochastic Block Model | |
Mathar, Rudolf | FrB3.4 | Cyclic Interference Neutralization on the $2\times 2\times 2$ Full-Duplex Two-Way Relay-Interference Channel | |
Mehmetoglu, Mustafa | ThE3.3 | A Deterministic Annealing Approach to Optimization of Zero-delay Source-Channel Codes | |
Merhav, Neri | TuB2.3 | Erasure/List Exponents for Slepian-Wolf Decoding | |
Mesbah, Wessam | FrC2.2 | Distortion Minimization in Layered Broadcast Transmission of a Gaussian Source Over Rayleigh Channels | |
Milenkovic, Olgica | ThE2.2 | MCUIUC - A New Framework for Metagenomic Read Compression | |
Milenkovic, Olgica | TuE2.1 | Aggregating Rankings with Positional Constraints | |
FrC2.1 | Compression of Noisy Signals with Information Bottlenecks | ||
Mili, Lamine | WeB1.4 | Packing Tubes on Tori: An Efficient Method for Low SNR Analog Error Correction | |
Miloslavskaya, Vera | TuB1.1 | Polar Codes with Dynamic Frozen Symbols and Their Decoding by Directed Search | |
Mitchell, David | TuE1.4 | A Finite Length Performance Analysis of LDPC Codes Constructed by Connecting Spatially Coupled Chains | |
Mohasseb, Yahya | FrC3.4 | The Deterministic Capacity of Relay Networks with Relay Private Messages | |
Molisch, Andreas | TuE3.1 | Fundamental Limits of Distributed Caching in D2D Wireless Networks | |
Mondelli, Marco | TuB1.3 | Scaling Exponent of List Decoders with Applications to Polar Codes | |
Muramatsu, Jun | TuE3.3 | Equivalence of Inner Regions for Broadcast Channel Coding | |
N A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Nafie, Mohammed | FrC3.4 | The Deterministic Capacity of Relay Networks with Relay Private Messages | |
Narayanan, Krishna | WeC1.1 | Lattice Codes Based on Product Constructions over $\mathbb{F}_q^2$ with Applications to Compute-and-Forward | |
WeC1.4 | Spatially-Coupled Low Density Lattices based on Construction A with Applications to Compute-and-Forward | ||
Nasiraee, Mohammad | ThB3.4 | On the Reliable Transmission of Correlated Sources over Two-Relay Network | |
Ney, Hermann | ThC2.4 | Novel Tight Classification Error Bounds under Mismatch Conditions based on $f$-Divergence | |
Nokleby, Matthew | TuF2.2 | Information-theoretic Limits on the Classification of Gaussian Mixtures: Classification on the Grassmann Manifold | |
Nussbaum-Thom, Markus | ThC2.4 | Novel Tight Classification Error Bounds under Mismatch Conditions based on $f$-Divergence | |
O A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Oechtering, Tobias | FrC3.3 | Capacity Region of a Class of Interfering Relay Channels | |
Oggier, Frederique | WeC1.3 | Enabling Multiplication in Lattice Codes via Construction A | |
Ordentlich, Or | WeC1.2 | Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap | |
Orten, Birant | TuF2.1 | An Impossibility Result for High Dimensional Supervised Learning | |
Özgür, Ayfer | FrB3.2 | On information flow and feedback in relay networks | |
FrC3.1 | Improved Capacity Approximations for Gaussian Relay Networks | ||
P A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Palguna, Deepan | ThC2.1 | Non-Parametric Prediction of the Mid-Price Dynamics in a Limit Order Book | |
Pappas, Nikolaos | FrB3.1 | On the Stability Region of a Relay-Assisted Multiple Access Scheme | |
ThB3.3 | The Stability Region of the Two-User Interference Channel | ||
Parada, Patricio | WeC2.3 | Shannon Entropy Estimation from Convergence Results in the Countable Alphabet Case | |
Paravi Torghabeh, Ramezan | ThE2.4 | Estimation of transition and stationary probabilities of slow mixing Markov processes | |
Paris, Jose Francisco | TuE3.4 | A General Framework for Statistically Characterizing the Dynamics of MIMO Channels | |
Pedersen, Morten | TuC2.4 | Network Coding Designs Suited for the Real World: What works, What doesn't, What's Promising | |
Pei ying, Zhang | TuF1.2 | Nonbinary LDPC-Coded Differential Modulation: Performance and Decoding Algorithm | |
Pfister, Henry | WeC1.4 | Spatially-Coupled Low Density Lattices based on Construction A with Applications to Compute-and-Forward | |
Piantanida, Pablo | TuE3.2 | Analog Index Coding over Block-Fading MISO Broadcast Channels with Feedback | |
ThF3.4 | On the Role of Interference Decoding in Simultaneous Broadcast Channels | ||
Pierrot, Alex | FrB2.2 | Joint Channel Intrinsic Randomness and Channel Resolvability | |
Pitaval, Renaud-Alexandre | ThB1.2 | Flag Orbit Codes and Their Expansion to Stiefel Codes | |
Pollak, Ilya | ThC2.1 | Non-Parametric Prediction of the Mid-Price Dynamics in a Limit Order Book | |
Prabhakaran, Vinod | TuC3.1 | Exploiting Common Randomness: a Resource for Network Secrecy | |
Presman, Noam | TuF1.3 | Design of Non-Binary Quasi-Cyclic LDPC codes by ACE optimization | |
Proutiere, Alexandre | TuB3.1 | Spectrum Bandit Optimization | |
R A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Rabbat, Michael | ThE1.4 | Maximum Likelihood Associative Memories | |
Raginsky, Maxim | ThB2.3 | Learning Joint Quantizers for Reconstruction and Prediction | |
Rai, Brijesh | WeB3.2 | On the capacity of $ms/3t$ and $3s/nt$ sum-networks | |
Rakhlin, Alexander | ThB2.2 | On Semi-Probabilistic Universal Prediction | |
Rasmussen, Lars K. | ThF3.2 | Multi-Cell Cooperation with Random User Locations under Arbitrary Signaling | |
Rini, Stefano | ThB3.2 | On the Interference Channel with Common Messages and the role of Rate-Sharing | |
Rodrigues, Miguel | TuF2.2 | Information-theoretic Limits on the Classification of Gaussian Mixtures: Classification on the Grassmann Manifold | |
Rohban, Mohammad Hossein | TuF2.1 | An Impossibility Result for High Dimensional Supervised Learning | |
Rondao Alface, Patrice | TuC2.3 | Impact of Random and Burst Packet Losses on H.264 Scalable Video Coding | |
Rose, Kenneth | ThE3.3 | A Deterministic Annealing Approach to Optimization of Zero-delay Source-Channel Codes | |
S A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Saber Tehrani, Arash | TuE2.4 | Optimal Binary Measurement Matrices for Compressed Sensing | |
Sabeti, Elyas | WeC2.1 | Information Theory for Atypical Sequences | |
Sabharwal, Ashutosh | WeC3.4 | On Degrees-of-Freedom of Full-Duplex Uplink/Downlink Channel | |
Sahai, Achaleshwar | WeC3.4 | On Degrees-of-Freedom of Full-Duplex Uplink/Downlink Channel | |
Sala, Frederic | ThE1.3 | Constrained Rank Modulation Schemes | |
Salavati, Amir Hesam | WeB2.4 | Coupled Neural Associative Memories | |
Saligrama, Venkatesh | TuE2.3 | Stochastic Threshold Group Testing | |
TuF2.1 | An Impossibility Result for High Dimensional Supervised Learning | ||
FrC2.3 | Sparse Signal Processing with Linear and Non-Linear Observations: A Unified Shannon Theoretic Approach | ||
Salim, Umer | FrC3.2 | Gaussian Half-Duplex Relay Networks: Improved Gap and a Connection with the Assignment Problem | |
Santhanam, Narayana Prasad | ThE2.4 | Estimation of transition and stationary probabilities of slow mixing Markov processes | |
Savard, Anne | TuF1.4 | Improved decoding for binary source coding with coded side information | |
Schaefer, Rafael | TuC3.4 | The Secrecy Capacity of a Compound MIMO Gaussian Channel | |
Schieler, Curt | ThF1.4 | A Connection between Good Rate-distortion Codes and Backward DMCs | |
Schlegel, Christian | TuE1.1 | Thresholds of Spatially Coupled Systems via Lyapunov's Method | |
Schlüter, Ralf | ThC2.4 | Novel Tight Classification Error Bounds under Mismatch Conditions based on $f$-Divergence | |
Schober, Steffen | WeB2.3 | On the Noise Sensitivity and Mutual Information of (Nested-) Canalizing Boolean Functions | |
Schouhamer Immink, Kees | ThE1.2 | Prefixless $q$-ary Balanced Codes with ECC | |
Sefidgaran, Milad | FrB1.1 | Distributed Function Computation Over a Tree Network | |
Shahbaz Badr, Arash | TuC2.4 | Network Coding Designs Suited for the Real World: What works, What doesn't, What's Promising | |
Shamai, Shlomo (Shitz) | ThC3.4 | State-Dependent Gaussian Z-Channel with Mismatched Side-Information and Interference | |
TuC3.3 | Secure Degrees of Freedom of MIMO X-Channels with Output Feedback and Delayed CSI | ||
ThC3.3 | Cognitive Cooperative Communications on the Multiple Access Channel | ||
Shao, Shuo | TuB2.1 | On Symmetric Multiple Description Coding | |
Shaqfeh, Mohammad | FrC2.2 | Distortion Minimization in Layered Broadcast Transmission of a Gaussian Source Over Rayleigh Channels | |
Shimonovich, Jonathan | ThC3.3 | Cognitive Cooperative Communications on the Multiple Access Channel | |
Shokrollahi, Amin | WeB2.4 | Coupled Neural Associative Memories | |
Shomorony, Ilan | TuB2.4 | Operational Extremality of Gaussianity in Network Compression, Communication, and Coding | |
Shum, Kenneth | WeB3.3 | Combinatorial Flow over Cyclic Linear Networks | |
Si, Hongbo | TuB1.4 | Polar Coding for Fading Channels | |
Silva, Jorge | WeC2.3 | Shannon Entropy Estimation from Convergence Results in the Countable Alphabet Case | |
Simón, Juan | ThB1.1 | Computing the Camion's multivariate BCH bound | |
Skoglund, Mikael | FrC3.3 | Capacity Region of a Class of Interfering Relay Channels | |
ThE3.1 | On Existence of Optimal Linear Encoders over Non-field Rings for Data Compression with Application to Computing | ||
Soljanin, Emina | TuC2.1 | Some Coding and Information Theoretic Problems in Contemporary (Video) Content Delivery | |
TuC2.2 | Source Broadcasting over Erasure Channels: Distortion Bounds and Code Design | ||
Somekh-Baruch, Anelia | ThC3.3 | Cognitive Cooperative Communications on the Multiple Access Channel | |
Song, Chen | ThC1.4 | The Likelihood Encoder for Source Coding | |
Song, Lin | TuB2.1 | On Symmetric Multiple Description Coding | |
Sridharan, Karthik | ThB2.2 | On Semi-Probabilistic Universal Prediction | |
Srivastava, Mani | TuB3.4 | Protecting Data Against Unwanted Inferences | |
Sun, Hua | ThB3.1 | Multilevel Topological Interference Management | |
Sun, Qifu | WeB3.3 | Combinatorial Flow over Cyclic Linear Networks | |
Swart, Theo | ThB1.4 | Concatenated Permutation Block Codes based on Set Partitioning for Substitution and Deletion Error-Control | |
ThE1.2 | Prefixless $q$-ary Balanced Codes with ECC | ||
Szczecinski, Leszek | TuB3.3 | Secrecy & Rate Adaptation for Secure HARQ Protocols | |
Sznajdman, Jacob | ThF2.2 | Lovasz theta, SVMs and Applications | |
Sørensen, Chres | TuC2.4 | Network Coding Designs Suited for the Real World: What works, What doesn't, What's Promising | |
T A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Takeuchi, Junichi | TuF2.3 | Asymptotically Minimax Regret by Bayes Mixtures for Non-exponential Families | |
Talebi, M. Sadegh | TuB3.1 | Spectrum Bandit Optimization | |
Tan, Louis | TuC2.2 | Source Broadcasting over Erasure Channels: Distortion Bounds and Code Design | |
Tan, Vincent | FrC1.3 | $\varepsilon$-Capacity and Strong Converse for Channels with General State | |
Tang, Siyu | TuC2.3 | Impact of Random and Burst Packet Losses on H.264 Scalable Video Coding | |
Tatikonda, Sekhar | ThE2.3 | Sparse Regression Codes: Recent Results and Future Directions | |
FrC1.2 | Improved Capacity Lower Bounds for Channels with Deletions and Insertions | ||
Taylor, Robert | WeB1.4 | Packing Tubes on Tori: An Efficient Method for Low SNR Analog Error Correction | |
Tchamkerten, Aslan | FrB1.1 | Distributed Function Computation Over a Tree Network | |
Temmel, Christoph | WeB2.2 | Information-Preserving Markov Aggregation | |
Thakor, Satyajit | ThF1.3 | On the Mutual Information between Random Variables in Networks | |
TuB2.2 | Characterising Correlation via Entropy Functions | ||
Thathachar, Jayram | ThF2.4 | On the Information Complexity of Cascaded Norms with Small Domains | |
Timo, Roy | ThC1.2 | The Heegard-Berger Problem with Common Receiver Reconstructions | |
Tirkkonen, Olav | ThB1.2 | Flag Orbit Codes and Their Expansion to Stiefel Codes | |
Tomamichel, Marco | FrC1.3 | $\varepsilon$-Capacity and Strong Converse for Channels with General State | |
Toumpakaris, Dimitris | ThF3.1 | Uplink Multi-Cell Processing: Approximate Sum Capacity under a Sum Backhaul Constraint | |
Traganitis, Apostolos | FrB3.1 | On the Stability Region of a Relay-Assisted Multiple Access Scheme | |
Trifonov, Peter | TuB1.1 | Polar Codes with Dynamic Frozen Symbols and Their Decoding by Directed Search | |
Truhachev, Dmitri | TuE1.4 | A Finite Length Performance Analysis of LDPC Codes Constructed by Connecting Spatially Coupled Chains | |
Tunali, Nihat | WeC1.4 | Spatially-Coupled Low Density Lattices based on Construction A with Applications to Compute-and-Forward | |
Tuninetti, Daniela | WeC3.3 | The Sum-Capacity of different $K$-user Cognitive Interference Channels in Strong Interference | |
FrC3.2 | Gaussian Half-Duplex Relay Networks: Improved Gap and a Connection with the Assignment Problem | ||
Tutuncuoglu, Kaya | WeC3.1 | Cooperative Energy Harvesting Communications with Relaying and Energy Sharing | |
U A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Urbanke, Ruediger | TuB1.3 | Scaling Exponent of List Decoders with Applications to Polar Codes | |
TuE1.2 | Displacement Convexity -- A Useful Framework for the Study of Spatially Coupled Codes | ||
TuE1.3 | A Closed-Form Scaling Law for Convolutional LDPC Codes Over the BEC | ||
ThF1.1 | The Least Degraded and the Least Upgraded Channel with respect to a Channel Family | ||
Uyematsu, Tomohiko | FrB2.4 | A New Unified Method for Intrinsic Randomness Problems of General Sources | |
V A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Vaishampayan, Vinay | WeB1.2 | Projections, Dissections and Bandwidth Expansion Mappings | |
Vandendorpe, Luc | TuC3.3 | Secure Degrees of Freedom of MIMO X-Channels with Output Feedback and Delayed CSI | |
Veeravalli, Venugopal | ThE2.2 | MCUIUC - A New Framework for Metagenomic Read Compression | |
Vehkalahti, Roope | WeB1.1 | A new design criterion for spherically-shaped division algebra-based space-time codes | |
Vehkaperä, Mikko | ThF3.2 | Multi-Cell Cooperation with Random User Locations under Arbitrary Signaling | |
Vellambi, Badri | ThC1.2 | The Heegard-Berger Problem with Common Receiver Reconstructions | |
Venkataramanan, Ramji | FrC1.2 | Improved Capacity Lower Bounds for Channels with Deletions and Insertions | |
ThE2.3 | Sparse Regression Codes: Recent Results and Future Directions | ||
Verdú, Sergio | ThC1.1 | Nonasymptotic Noisy Source Coding | |
Vidal, Josep | ThC3.1 | Degrees of Freedom of the Rank-Deficient MIMO X channel | |
Vilenchik, Danny | WeC3.2 | Zero vs.\ $\varepsilon$ Error in Interference Channels | |
Vishwanath, Sriram | WeB3.1 | Linear Network Coding for Multiple Groupcast Sessions: An Interference Alignment Approach | |
Vishwanath, Sriram | TuB1.4 | Polar Coding for Fading Channels | |
Vu, Mai | FrC3.3 | Capacity Region of a Class of Interfering Relay Channels | |
W A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Wainwright, Martin | ThF2.3 | Local Privacy, Quantitative Data Processing Inequalities, and Statistical Minimax Rates | |
Walsh, John | FrB1.3 | Bounding the Entropic Region via Information Geometry | |
Walton, Chad | WeC2.1 | Information Theory for Atypical Sequences | |
Warsi, Naqueeb | ThC2.2 | One-shot bounds for various information theoretic problems using smooth min and max Rényi divergences | |
Watanabe, Kazuho | FrC2.4 | Rate-Distortion Bounds for an Epsilon-Insensitive Distortion Measure | |
Weber, Jos | ThB1.4 | Concatenated Permutation Block Codes based on Set Partitioning for Substitution and Deletion Error-Control | |
Weidmann, Claudio | TuF1.4 | Improved decoding for binary source coding with coded side information | |
Weissman, Tsachy | TuB2.4 | Operational Extremality of Gaussianity in Network Compression, Communication, and Coding | |
Wiese, Moritz | TuF3.4 | On the Weakest Resource for Coordination in AV-MACs with Conferencing Encoders | |
Wigger, Michele | ThF3.3 | Any positive feedback rate increases the capacity of strictly less-noisy broadcast channels | |
Wu, Youlong | ThF3.3 | Any positive feedback rate increases the capacity of strictly less-noisy broadcast channels | |
X A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Xu, Jiaming | WeB2.1 | Reconstruction in the Labeled Stochastic Block Model | |
Xu, Xiaoli | ThF1.3 | On the Mutual Information between Random Variables in Networks | |
Y A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Yassaee, Mohammad Hossein | FrB2.1 | When is it possible to simulate a DMC channel from another? | |
Yavuz, Semih | ThE3.4 | Capacity Region of Multi-Resolution Streaming in Peer-to-Peer Networks | |
Yener, Aylin | WeC3.1 | Cooperative Energy Harvesting Communications with Relaying and Energy Sharing | |
Yeung, Raymond W. | FrB1.2 | Two-Partition-Symmetrical Entropy Function Regions | |
Yu, Wei | ThF3.1 | Uplink Multi-Cell Processing: Approximate Sum Capacity under a Sum Backhaul Constraint | |
Z A B C D E F G H I J K L M N O P R S T U V W X Y Z | |||
Zaghloul, Amir | WeB1.4 | Packing Tubes on Tori: An Efficient Method for Low SNR Analog Error Correction | |
Zaidi, Abdellatif | TuC3.3 | Secure Degrees of Freedom of MIMO X-Channels with Output Feedback and Delayed CSI | |
Zamir, Ram | ThE3.2 | Sampling versus Random Binning for Multiple Descriptions of a Bandlimited Source | |
Zdeborova, Lenka | WeB1.3 | Robust error correction for real-valued signals via message-passing decoding and spatial coupling | |
Zewail, Ahmed | FrC3.4 | The Deterministic Capacity of Relay Networks with Relay Private Messages | |
Zhang, Pan | WeB1.3 | Robust error correction for real-valued signals via message-passing decoding and spatial coupling | |
Zhou, Yuhan | ThF3.1 | Uplink Multi-Cell Processing: Approximate Sum Capacity under a Sum Backhaul Constraint | |
Zhuang, Qiutao | ThB1.3 | New Geometrical Spectra of Linear Codes with Applications to Performance Analysis | |
Zou, Jun | TuE2.2 | Iterative Similarity Inference via Message Passing in Factor Graphs for Collaborative Filtering | |
Østergaard, Jan | ThE3.2 | Sampling versus Random Binning for Multiple Descriptions of a Bandlimited Source |