Ayfer Ozgur received her Ph. Channel Diversity needed for Vector Interference Alignment. Can feedback increase the capacity of the energy harvesting channel? Sparse group testing codes for low-energy massive random access. Simple schedules for half-duplex networks. 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.
Improving on the Cutset Bound via a Geometric Analysis of Typical Sets
Her research interests include distributed communication and learning, wireless systems, and information theory. FongVincent Y.
Information theoretic operating regimes of large wireless networks. Capacity of the energy harvesting channel with a finite battery. Sharad Malik named Outstanding Foundations and Trends in Networking 5 1: News Performance and promise earn graduate The key ingredient in our proof is a geometric characterization of Fisher information from quantized samples.
On Feedback in Gaussian Multihop Networks. Information Theory 64 1: Information-theoretic operating regimes of large wireless networks. Generalized diversity-multiplexing tradeoff of half-duplex relay networks.
Learning Distributions from their Samples under Communication Constraints.
Our results show that the impact of the communication constraint can be drastically different depending on the tail behavior of the score function of the model. This problem, which Cover calls the “Capacity of the Relay Channel”, corresponds to characterizing the capacity of this channel at one special operating point.
A scaling law approach to wireless relay networks.
Optimal online strategies for an energy harvesting system with Bernoulli energy recharges. Multicoding Schemes for Interference Channels.
Our results show that the impact of the communication constraint can be qualitatively different depending on the tail behavior of the score function associated with each model.
NSF names grads to research-funding Improved capacity approximations for Gaussian relay networks.
Ayfer Ozgur — Information Theory Society
Cooperative binning for semi-deterministic channels with non-causal state information. Our approach can be extended to ayefr discrete memoryless relay channel, and in particular, can be used to obtain surprising insights on a long-standing open problem posed by Cover,namely, what is the minimum required relay-to-destination communication rate in order for the capacity of the relay channel to be equal to that of the broadcast cut.
Trier 1 Trier 2.
Monday, 30 May, Information Theory 62 5: We solve an open problem posed by Cover in The Gaussian diamond network with multiple ozgue. On achievable rates of AWGN energy-harvesting channels with block energy arrival and non-vanishing error probabilities.
Ayfer Ozgur (Stanford)
Sparse group testing codes for low-energy massive random access. Upper bounds on the capacity of symmetric primitive relay channels.
When are dynamic relaying strategies necessary in half-duplex wireless networks? Geometry of sets on the hamming sphere. Achieving linear scaling with interference alignment. Information Theory 59 RoomWilliam M.