Solution to Cover’s Problem in the Gaussian Case. Information Theory 60 Information Theory 64 2: Our approach is geometric and builds on an extension we develop for the isoperimetric inequality on a high-dimensional sphere. Multicoding Schemes for Interference Channels. Bernoulli Energy Harvesting Channels. State-dependent multiple-access channels with partially cribbing encoders.

A Geometric Approach to two Problems in Networks: Communication With Crystal-Free Radios. Fong , Vincent Y. Geometry of sets on the hamming sphere. On feedback in Gaussian multi-hop networks. Motivated by this trend, we consider the problem of estimating high-dimensional distributions and parameters in a distributed network, where each node in the network observes an independent sample from the underlying distribution and can communicate it to a central processor by writing at most k bits on a public blackboard. The geometry of the relay channel.

## Ayfer Ozgur

In andshe was a post-doctoral scholar at the same institution. Information-theoretic operating regimes of large wireless networks.

Sparse group testing codes for low-energy massive random access. Capacity of the energy harvesting channel with a finite battery. Online Power Control for Block i. Graph-based codes for Quantize-Map-and-Forward relaying.

Communication With Crystal-Free Radios. Learning Distributions from their Samples under Communication Constraints.

# Ayfer Ozgur — Information Theory Society

The cut-set bound developed by Cover and El Gamal in has since remained the best known upper bound on the capacity of the Gaussian relay channel. NSF names grads to research-funding The key ingredient in our proof is a geometric characterization of Fisher information from quantized samples.

Fast near-optimal subnetwork selection in layered relay networks. Skip to main content. Universally near-optimal online power control for energy harvesting nodes.

We use measure concentration to analyze the probabilistic geometric relations between the typical sets of the n-letter random variables associated with a reliable code, which translate to new entropy inequalities between the random variables involved in the problem.

Information Theory 64 3: Graduate School awards hhesis for Operating Regimes of Large Wireless Networks.

# dblp: Ayfer Özgür

On Feedback in Gaussian Multihop Networks. Information Theory 62 7: Trier 1 Trier 2. Minimax Learning for Remote Prediction.

Her research interests include distributed communication and learning, wireless systems, and information theory. Terms of Use Privacy Policy Imprint. Deterministic Z-interference channels with unidirectional partial cribbing.

Improved capacity approximations for Gaussian relay networks.

## Ayfer Ozgur (Stanford)

Telescopic beamforming for large wireless networks. Her research interests are in wireless and network communication, information and coding theory.

Information Theory 62 3: Capacity of the energy harvesting Gaussian MAC. Motivated by this trend, we consider the problem of estimating high-dimensional distributions and parameters in a distributed network, where each node in the network observes an independent sample from the underlying distribution and can communicate it to a central processor by writing at most k bits on a public blackboard. Optimal Cooperation in Large Wireless Networks.

Multicoding Schemes for Interference Channels. Information Theory 60 The Gaussian diamond network with multiple antennas.