Michael Gastpar

According to our database1, Michael Gastpar authored at least 197 papers between 2000 and 2020.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2017, "For contributions to network information theory".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Sum-Rate Capacity for Symmetric Gaussian Multiple Access Channels With Feedback.
IEEE Trans. Inf. Theory, 2020

Common Information Components Analysis.
CoRR, 2020

Robust Generalization via $α$-Mutual Information.
CoRR, 2020

Successive Refinement to Caching for Dynamic Requests.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Robust Generalization via f-Mutual Information.
Proceedings of the IEEE International Symposium on Information Theory, 2020

The Gaussian lossy Gray-Wyner network.
Proceedings of the 54th Annual Conference on Information Sciences and Systems, 2020

Converse for Multi-Server Single-Message PIR with Side Information.
Proceedings of the 54th Annual Conference on Information Sciences and Systems, 2020

2019
Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding.
IEEE Trans. Inf. Theory, 2019

The Optimal Memory-Rate Trade-Off for the Non-Uniform Centralized Caching Problem With Two Files Under Uncoded Placement.
IEEE Trans. Inf. Theory, 2019

Remote Source Coding Under Gaussian Noise: Dueling Roles of Power and Entropy Power.
IEEE Trans. Inf. Theory, 2019

Compute-Forward Multiple Access (CFMA): Practical Implementations.
IEEE Trans. Commun., 2019

Generalization Error Bounds Via Rényi-, f-Divergences and Maximal Leakage.
CoRR, 2019

A New Approach to Adaptive Data Analysis and Learning via Maximal Leakage.
CoRR, 2019

Quantifying High-order Interdependencies via Multivariate Extensions of the Mutual Information.
CoRR, 2019

Relaxed Wyner's Common Information.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Learning and Adaptive Data Analysis via Maximal Leakage.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Successive Refinement to Caching for Dynamic Content.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Towards an Algebraic Network Information Theory: Distributed Lossy Computation of Linear Functions.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Strengthened Information-theoretic Bounds on the Generalization Error.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
A Joint Typicality Approach to Compute-Forward.
IEEE Trans. Inf. Theory, 2018

Locally Differentially-Private Randomized Response for Discrete Distribution Learning.
CoRR, 2018

A Novel Centralized Strategy for Coded Caching with Non-uniform Demands.
CoRR, 2018

Increasing Availability in Distributed Storage Systems via Clustering.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Single-server Multi-user Private Information Retrieval with Side Information.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Computable Bounds on the Exploration Bias.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Single-server Multi-message Private Information Retrieval with Side Information.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Gaussian Multiple Access via Compute-and-Forward.
IEEE Trans. Inf. Theory, 2017

Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward.
IEEE Trans. Inf. Theory, 2017

Secure Transmission on the Two-Hop Relay Channel With Scaled Compute-and-Forward.
IEEE Trans. Inf. Theory, 2017

Information-Theoretic Caching: The Multi-User Case.
IEEE Trans. Inf. Theory, 2017

Compute-Forward Multiple Access (CFMA): Practical Code Design.
CoRR, 2017

On the duality between multiple-access codes and computation codes.
Proceedings of the 2017 Information Theory and Applications Workshop, 2017

Compute-forward multiple access (CFMA) with nested LDPC codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

GDSP: A graphical perspective on the distributed storage systems.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Towards an algebraic network information theory: Simultaneous joint typicality decoding.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Cooperative data exchange based on MDS codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Cooperative data exchange with weighted cost based on d-basis construction.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Information-Theoretic Caching: Sequential Coding for Computing.
IEEE Trans. Inf. Theory, 2016

Computation in Multicast Networks: Function Alignment and Converse Theorems.
IEEE Trans. Inf. Theory, 2016

Efficient Algorithms for the Data Exchange Problem.
IEEE Trans. Inf. Theory, 2016

A Joint Typicality Approach to Algebraic Network Information Theory.
CoRR, 2016

A new converse bound for coded caching.
Proceedings of the 2016 Information Theory and Applications Workshop, 2016

On the energy benefit of compute-and-forward for multiple unicasts.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Locally differentially-private distribution estimation.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Caching Gaussians: Minimizing total correlation on the Gray-Wyner network.
Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

K users caching two files: An improved achievable rate.
Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

Typical sumsets of linear codes.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

Total correlation of Gaussian vector sources on the Gray-Wyner network.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

Multi-library coded caching.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

Typical sumsets of lattice points.
Proceedings of the 50th Asilomar Conference on Signals, Systems and Computers, 2016

2015
Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages.
IEEE Trans. Inf. Theory, 2015

Interactive Computation of Type-Threshold Functions in Collocated Gaussian Networks.
IEEE Trans. Inf. Theory, 2015

Random Access With Physical-Layer Network Coding.
IEEE Trans. Inf. Theory, 2015

Polar Codes for Broadcast Channels.
IEEE Trans. Inf. Theory, 2015

Compute-and-forward using nested linear codes for the Gaussian MAC.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Secure transmission using an untrusted relay with scaled compute-and-forward.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Coding theorems via linear codes: Joint decoding rate regions.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

On lattice codes for Gaussian interference channels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Information-theoretic caching.
Proceedings of the IEEE International Symposium on Information Theory, 2015

A unified view on nearest-neighbor decoding rates for noncoherent and semicoherent fading channels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

A joint typicality approach to compute-forward.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
Information Measures of Redundancy and Synergy in Neural Activity.
Proceedings of the Encyclopedia of Computational Neuroscience, 2014

Directed Information Flow and Causality in Neural Systems.
Proceedings of the Encyclopedia of Computational Neuroscience, 2014

Integer-Forcing Linear Receivers.
IEEE Trans. Inf. Theory, 2014

Functional Forwarding of Channel State Information.
IEEE Trans. Inf. Theory, 2014

Computation Over Gaussian Networks With Orthogonal Components.
IEEE Trans. Inf. Theory, 2014

Approximate Ergodic Capacity of a Class of Fading Two-User Two-Hop Networks.
IEEE Trans. Inf. Theory, 2014

Capacity Scaling of Cognitive Networks: Beyond Interference-Limited Communication.
IEEE Trans. Inf. Theory, 2014

Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback.
IEEE Trans. Inf. Theory, 2014

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast.
IEEE Commun. Lett., 2014

Multiple Access via Compute-and-Forward.
CoRR, 2014

Asymmetric Compute-and-Forward with CSIT.
CoRR, 2014

New Shortest Lattice Vector Problems of Polynomial Complexity.
CoRR, 2014

Compute-and-forward for discrete memoryless networks.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Gaussian (dirty) multiple access channels: A compute-and-forward perspective.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On distributed successive refinement with lossless recovery.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Compute-and-Forward: Finding the best equation.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds.
IEEE Trans. Inf. Theory, 2013

Feedback Communication and Control Over a Single Channel.
IEEE Trans. Inf. Theory, 2013

Linear Function Computation in Networks: Duality and Constant Gap Results.
IEEE J. Sel. Areas Commun., 2013

Function Identification in Neuron Populations via Information Bottleneck.
Entropy, 2013

Interactive Computation of Type-Threshold Functions in Collocated Broadcast-Superposition Networks.
CoRR, 2013

Network decomposition for function computation.
Proceedings of the 14th IEEE Workshop on Signal Processing Advances in Wireless Communications, 2013

Lattice codes for many-to-one cognitive interference networks.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Multi-round computation of type-threshold functions in collocated Gaussian networks.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Interactive function computation.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Compute-and-Forward: Multiple bi-directional sessions on the line network.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Physical-layer network coding on the random-access channel.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Brain-machine interface control using broadband spectral power from local field potentials.
Proceedings of the 35th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2013

2012
Reduced-Dimension Linear Transform Coding of Correlated Signals in Networks.
IEEE Trans. Signal Process., 2012

List-Decoding for the Arbitrarily Varying Channel Under State Constraints.
IEEE Trans. Inf. Theory, 2012

The Sampling Rate-Distortion Tradeoff for Sparsity Pattern Recovery in Compressed Sensing.
IEEE Trans. Inf. Theory, 2012

Ergodic Interference Alignment.
IEEE Trans. Inf. Theory, 2012

Redundant information encoding in primary motor cortex during natural and prosthetic motor control.
J. Comput. Neurosci., 2012

A Survey on Interference Networks: Interference Alignment and Neutralization.
Entropy, 2012

Relaxing the Gaussian AVC
CoRR, 2012

Minimum Cost Multicast with Decentralized Sources
CoRR, 2012

Real-time prediction of fast and slow delivery of mental commands in a motor imagery BCI: An entropy-based approach.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2012

Network coding with computation alignment.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Approximate ergodic capacity of a class of fading 2 × 2 × 2 Networks.
Proceedings of the 2012 Information Theory and Applications Workshop, 2012

Compute-and-forward on wireless lattice networks with local interference.
Proceedings of the 2012 International Symposium on Wireless Communication Systems (ISWCS), 2012

Approximate feedback capacity of the Gaussian multicast channel.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Data exchange problem with helpers.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Approximate ergodic capacity of a class of fading 2-user 2-hop networks.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Degrees of freedom of sparsely connected wireless networks.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Integer-forcing architectures: An overview.
Proceedings of the 5th International Symposium on Communications, 2012

Compressed sensing phase transitions: Rigorous bounds versus replica predictions.
Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

Efficient algorithms for the data exchange problem under fairness constraints.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Compute-and-Forward: Harnessing Interference Through Structured Codes.
IEEE Trans. Inf. Theory, 2011

Line and Lattice Networks Under Deterministic Interference Models.
IEEE Trans. Inf. Theory, 2011

Reliable Physical Layer Network Coding.
Proceedings of the IEEE, 2011

Introduction to the Issue on Gossiping Algorithms Design and Applications.
IEEE J. Sel. Top. Signal Process., 2011

Local Interference Can Accelerate Gossip Algorithms.
IEEE J. Sel. Top. Signal Process., 2011

Cognitive Radio Through Primary Control Feedback.
IEEE J. Sel. Areas Commun., 2011

Optimal Deterministic Polynomial-Time Data Exchange for Omniscience
CoRR, 2011

A compressed sensing wire-tap channel.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

New achievable rates for the Gaussian broadcast channel with feedback.
Proceedings of the 8th International Symposium on Wireless Communication Systems, 2011

Mitigating interference with integer-forcing architectures.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the role of diversity in sparsity estimation.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Practical code design for compute-and-forward.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Deterministic algorithm for the cooperative data exchange problem.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Assessing directed information as a method for inferring functional connectivity in neural ensembles.
Proceedings of the 33rd Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2011

Function computation in networks: Duality and constant gap results.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Recursive implementation of the distributed Karhunen-Loève transform.
IEEE Trans. Signal Process., 2010

Rateless codes for AVC models.
IEEE Trans. Inf. Theory, 2010

On the broadcast capacity of wireless networks with cooperative relays.
IEEE Trans. Inf. Theory, 2010

Anthropic correction of information estimates and its application to neural coding.
IEEE Trans. Inf. Theory, 2010

Zero-rate feedback can achieve the empirical capacity.
IEEE Trans. Inf. Theory, 2010

Distributed Sensor Perception via Sparse Representation.
Proceedings of the IEEE, 2010

A little feedback can simplify sensor network cooperation.
IEEE J. Sel. Areas Commun., 2010

Fundamental Tradeoffs for Sparsity Pattern Recovery
CoRR, 2010

When Feedback Doubles the Prelog in AWGN Networks
CoRR, 2010

Integer-Forcing Linear Receivers: A New Low-Complexity MIMO Architecture.
Proceedings of the 72nd IEEE Vehicular Technology Conference, 2010

On LP decoding of polar codes.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

"Compressed" compressed sensing.
Proceedings of the IEEE International Symposium on Information Theory, 2010

The role of game theory in key agreement over a public channel.
Proceedings of the IEEE International Symposium on Information Theory, 2010

A greedy approach to the distributed Karhunen-Loève transform.
Proceedings of the IEEE International Conference on Acoustics, 2010

On decoding equations with partial channel state information.
Proceedings of the 44th Annual Conference on Information Sciences and Systems, 2010

2009
Anthropic correction of information estimates.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

MIMO compute-and-forward.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Some observations on limited feedback for multiaccess channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Structured superposition for backhaul constrained cellular uplink.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Secure communication using an untrusted relay via sources and channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Linear compressive networks.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Neighborhood gossip: Concurrent averaging through local interference.
Proceedings of the IEEE International Conference on Acoustics, 2009

Distributed Karhunen-Loève Transform with nested subspaces.
Proceedings of the IEEE International Conference on Acoustics, 2009

Distributed Source Coding - Theory, Algorithms and Applications.
Academic Press, ISBN: 978-0-12-374485-2, 2009

2008
Uncoded Transmission Is Exactly Optimal for a Simple Gaussian "Sensor" Network.
IEEE Trans. Inf. Theory, 2008

The case for structured random codes in network capacity theorems.
Eur. Trans. Telecommun., 2008

Theory and Applications in Multiuser/Multiterminal Communications.
EURASIP J. Wirel. Commun. Netw., 2008

Bits through ARQs
CoRR, 2008

The pre-log of Gaussian broadcast with feedback can be two.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Arbitrarily dirty paper coding and applications.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Sampling bounds for sparse support recovery in the presence of noise.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Compute-and-forward: Harnessing interference with structured codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Achievable rates for conferencing multiway channels.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Sufficient-Statistics Based Multiple Access over Wireless Fading Channels.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

Adversarial interference models for multiantenna cooperative systems.
Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

2007
Computation Over Multiple-Access Channels.
IEEE Trans. Inf. Theory, 2007

Introduction to the Special Issue on Models, Theory, and Codes for Relaying and Cooperation in Communication Networks [Guest Editorial].
IEEE Trans. Inf. Theory, 2007

On Capacity Under Receive and Spatial Spectrum-Sharing Constraints.
IEEE Trans. Inf. Theory, 2007

Deterministic list codes for state-constrained arbitrarily varying channels
CoRR, 2007

Rateless coding with partial state information at the decoder
CoRR, 2007

Limited feedback achieves the empirical capacity
CoRR, 2007

Channels with nosy "noise".
Proceedings of the IEEE International Symposium on Information Theory, 2007

Computation over Gaussian Multiple-Access Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Using zero-rate feedback on binary additive channels with individual noise sequences.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Bits through ARQs: Spectrum Sharing with a Primary Packet System.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
The Distributed Karhunen-Loève Transform.
IEEE Trans. Inf. Theory, 2006

Dependence Balance and the Gaussian Multiaccess Channel with Feedback.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

On The Significance Of Binning In A Scaling-law Sense.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Randomization bounds on Gaussian arbitrarily varying channels.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Computing over Multiple-Access Channels with Connections to Wireless Network Coding.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

On the Performance of Independently Designed LDPC Codes for the Relay Channel.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Sensing and Communication With and Without Bits.
Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006

2005
Cooperative Strategies and Capacity Theorems for Relay Network.
IEEE Trans. Inf. Theory, 2005

On the capacity of large Gaussian relay networks.
IEEE Trans. Inf. Theory, 2005

Power, spatio-temporal bandwidth, and distortion in large sensor networks.
IEEE J. Sel. Areas Commun., 2005

Boosting reliability over AWGN networks with average power constraints and noiseless feedback.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Discriminatory source coding for a noiseless broadcast channel.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On the quadratic AWGN CEO problem and non-gaussian sources.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Fading observation alignment via feedback.
Proceedings of the Fourth International Symposium on Information Processing in Sensor Networks, 2005

2004
The Wyner-Ziv Problem With Multiple Sources.
IEEE Trans. Inf. Theory, 2004

Gaussian multiple-access channels under received-power constraints.
Proceedings of the 2004 IEEE Information Theory Workshop, 2004

A lower bound to the scaling behavior of sensor networks.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Cut-set arguments for source-channel networks.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Power-bandwidth-distortion scaling laws for sensor networks.
Proceedings of the Third International Symposium on Information Processing in Sensor Networks, 2004

On compression using the distributed Karhunen-Loeve transform.
Proceedings of the 2004 IEEE International Conference on Acoustics, 2004

Distributed source-channel coding for wireless sensor networks.
Proceedings of the 2004 IEEE International Conference on Acoustics, 2004

2003
To code, or not to code: lossy source-channel communication revisited.
IEEE Trans. Inf. Theory, 2003

Source-channel communication with feedback.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

Source-Channel Communication in Sensor Networks.
Proceedings of the Information Processing in Sensor Networks, 2003

Distributed signal processing and communications: on the interaction of sources and channels.
Proceedings of the 2003 IEEE International Conference on Acoustics, 2003

On Source-Channel Communication in Networks.
Proceedings of the Advances in Network Information Theory, 2003

The Distributed, Partial, And Conditional Karhunen-Loève Transforms.
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

2002
On the capacity of wireless networks: The relay case.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2000
On the necessary density for spectrum-blind nonuniform sampling subject to quantization.
Proceedings of the IEEE International Conference on Acoustics, 2000


  Loading...