Amin Gohari

Orcid: 0000-0002-9667-7627

Affiliations:
  • Sharif University of Technology, Department of Electrical Engineering, Tehran, Iran


According to our database1, Amin Gohari authored at least 111 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Inductive Biases of Demographic Parity-based Fair Learning Algorithms.
CoRR, 2024

2023
f-Divergences and Their Applications in Lossy Compression and Bounding Generalization Error.
IEEE Trans. Inf. Theory, December, 2023

Relative Fractional Independence Number and Its Applications.
CoRR, 2023

A Study of Chemical Reactions in Point-to-Point Diffusion-Based Molecular Communication.
IEEE Access, 2023

An Upper Bound on Secret Key Rates for General Multiterminal Wiretap Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2023

A Proof of the Noiseberg Conjecture for the Gaussian Z-Interference Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Outer Bounds for Multiuser Settings: The Auxiliary Receiver Approach.
IEEE Trans. Inf. Theory, 2022

A Strengthened Cutset Upper Bound on the Capacity of the Relay Channel and Applications.
IEEE Trans. Inf. Theory, 2022

Supermodular f-divergences and bounds on lossy compression and generalization error with mutual f-information.
CoRR, 2022

Rate-Distortion Theoretic Generalization Bounds for Stochastic Learning Algorithms.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Transmission of a Bit Over a Discrete Poisson Channel With Memory.
IEEE Trans. Inf. Theory, 2021

An Analytical Model for Molecular Communication Over a Non-Linear Reaction-Diffusion Medium.
IEEE Trans. Commun., 2021

Simulation of a Random Variable and its Application to Game Theory.
Math. Oper. Res., 2021

Strengthened Cutset Upper Bounds on the Capacity of the Relay Channel and Applications.
CoRR, 2021

Achievable Rates for the Relay Channel with Orthogonal Receiver Components.
Proceedings of the IEEE Information Theory Workshop, 2021

Learning under Distribution Mismatch and Model Misspecification.
Proceedings of the IEEE International Symposium on Information Theory, 2021

An Information Inequality Motivated by the Gaussian Z-Interference Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Timing Modulation for Macro-Scale Molecular Communication.
IEEE Wirel. Commun. Lett., 2020

Coding for Positive Rate in the Source Model Key Agreement Problem.
IEEE Trans. Inf. Theory, 2020

On Zero-Error Molecular Communication With Multiple Molecule Types.
IEEE Trans. Commun., 2020

An Upper Bound for Wiretap Multi-way Channels.
CoRR, 2020

Multi-Way Number Partitioning: an Information-Theoretic View.
CoRR, 2020

New Outer Bounds for the Two-Receiver Broadcast Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Molecular Communication over a Non-linear Reaction-Diffusion Medium: A Tractable Model.
Proceedings of the IEEE Global Communications Conference, 2020

2019
A Correlation Measure Based on Vector-Valued L<sub>p</sub>-Norms.
IEEE Trans. Inf. Theory, 2019

On the Evaluation of Marton's Inner Bound for Two-Receiver Broadcast Channels.
IEEE Trans. Inf. Theory, 2019

On Medium Chemical Reaction in Diffusion-Based Molecular Communication: A Two-Way Relaying Example.
IEEE Trans. Commun., 2019

A Square Root Sampling Law for Signal Recovery.
IEEE Signal Process. Lett., 2019

Playing games with bounded entropy.
Games Econ. Behav., 2019

Playing Games with Bounded Entropy: Convergence Rate and Approximate Equilibria.
CoRR, 2019

A Correlation Measure Based on Vector-Valued Lp Norms.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Diffusion-Based Molecular Communication With Limited Molecule Production Rate.
IEEE Trans. Mol. Biol. Multi Scale Commun., 2018

On the Capacity of a Class of Signal-Dependent Noise Channels.
IEEE Trans. Inf. Theory, 2018

How Compressible Are Innovation Processes?
IEEE Trans. Inf. Theory, 2018

Φ-Entropic Measures of Correlation.
IEEE Trans. Inf. Theory, 2018

Type-Based Sign Modulation and Its Application for ISI Mitigation in Molecular Communication.
IEEE Trans. Commun., 2018

Diffusion Based Molecular Communication with Limited Molecule Production Rate.
CoRR, 2018

Zero-error codes for multi-type molecular communication in random delay channel.
Proceedings of the Iran Workshop on Communication and Information Theory, 2018

On Achieving a Positive Rate in the Source Model Key Agreement Problem.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
ISI-Avoiding Modulation for Diffusion-Based Molecular Communication.
IEEE Trans. Mol. Biol. Multi Scale Commun., 2017

Perfectly Secure Index Coding.
IEEE Trans. Inf. Theory, 2017

Simulation of a Channel With Another Channel.
IEEE Trans. Inf. Theory, 2017

Comments On "Information-Theoretic Key Agreement of Multiple Terminals - Part I".
IEEE Trans. Inf. Theory, 2017

Information Theoretic Cutting of a Cake.
IEEE Trans. Inf. Theory, 2017

High-Probability Guarantees in Repeated Games: Theory and Applications in Information Theory.
Proc. IEEE, 2017

Existence and Continuity of Differential Entropy for a Class of Distributions.
IEEE Commun. Lett., 2017

How Compressible are Sparse Innovation Processes?
CoRR, 2017

The Value of Help Bits in Randomized and Average-Case Complexity.
Comput. Complex., 2017

On the capacity of signal dependent noise channels.
Proceedings of the Iran Workshop on Communication and Information Theory, 2017

On the equivalency of reliability and security metrics for wireline networks.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Information Theory of Molecular Communication: Directions and Challenges.
IEEE Trans. Mol. Biol. Multi Scale Commun., 2016

Adaptive Transmission Rate With a Fixed Threshold Decoder for Diffusion-Based Molecular Communication.
IEEE Trans. Commun., 2016

Maximal Rank Correlation.
IEEE Commun. Lett., 2016

Phi-Entropic Measures of Correlation.
CoRR, 2016

Type based sign modulation for molecular communication.
Proceedings of the Iran Workshop on Communication and Information Theory, 2016

Physical layer network coding in molecular two-way relay networks.
Proceedings of the Iran Workshop on Communication and Information Theory, 2016

2015
Capacity of Diffusion-Based Molecular Communication Networks Over LTI-Poisson Channels.
IEEE Trans. Mol. Biol. Multi Scale Commun., 2015

Channel Simulation via Interactive Communications.
IEEE Trans. Inf. Theory, 2015

Monotone Measures for Non-Local Correlations.
IEEE Trans. Inf. Theory, 2015

Critical Graphs in Index Coding.
IEEE J. Sel. Areas Commun., 2015

Recovery From Random Samples in a Big Data Set.
IEEE Commun. Lett., 2015

On ISI-free Modulations for Diffusion based Molecular Communication.
CoRR, 2015

On Körner-Marton's sum modulo two problem.
Proceedings of the Iran Workshop on Communication and Information Theory, 2015

Two-way channel simulation.
Proceedings of the Iran Workshop on Communication and Information Theory, 2015

The value of information-theoretic content of help bits for computation.
Proceedings of the Iran Workshop on Communication and Information Theory, 2015

Zero error coordination.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

On the duality of additivity and tensorization.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Adaptive molecule transmission rate for diffusion based molecular communication.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

Capacity of LTI-Poisson channel for diffusion based molecular communication.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014
Achievability Proof via Output Statistics of Random Binning.
IEEE Trans. Inf. Theory, 2014

On Marton's Inner Bound for the General Broadcast Channel.
IEEE Trans. Inf. Theory, 2014

Infeasibility Proof and Information State in Network Information Theory.
IEEE Trans. Inf. Theory, 2014

On Marton's Inner Bound and Its Optimality for Classes of Product Broadcast Channels.
IEEE Trans. Inf. Theory, 2014

Quantum Achievability Proof via Collision Relative Entropy.
IEEE Trans. Inf. Theory, 2014

On Dimension Bounds for Auxiliary Quantum Systems.
IEEE Trans. Inf. Theory, 2014

Receivers for Diffusion-Based Molecular Communication: Exploiting Memory and Sampling Rate.
IEEE J. Sel. Areas Commun., 2014

Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources.
Electron. Colloquium Comput. Complex., 2014

Wiring of No-Signaling Boxes Expands the Hypercontractivity Ribbon.
CoRR, 2014

Diffusion based molecular communication: A simple near optimal receiver.
Proceedings of the Iran Workshop on Communication and Information Theory, 2014

From source model to quantum key distillation: An improved upper bound.
Proceedings of the Iran Workshop on Communication and Information Theory, 2014

On hypercontractivity and a data processing inequality.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding With Correlated Sources.
IEEE Trans. Inf. Theory, 2013

Diffusion-Based Nanonetworking: A New Modulation Technique and Performance Analysis.
IEEE Commun. Lett., 2013

On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover
CoRR, 2013

Secure noisy network coding.
Proceedings of the Iran Workshop on Communication and Information Theory, 2013

On dimension bounds for quantum systems.
Proceedings of the Iran Workshop on Communication and Information Theory, 2013

When is it possible to simulate a DMC channel from another?
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Non-asymptotic output statistics of Random Binning and its applications.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

A technique for deriving one-shot achievability results in network information theory.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Improved cardinality bounds on the auxiliary random variables in Marton's inner bound.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On hypercontractivity and the mutual information between Boolean functions.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Evaluation of Marton's Inner Bound for the General Broadcast Channel.
IEEE Trans. Inf. Theory, 2012

Information Theoretic Benefit of Entanglement in Classical Communication Settings
CoRR, 2012

Secure channel simulation.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Transmission of non-linear binary input functions over a CDMA system.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Coordination via a relay.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On Marton's inner bound for broadcast channels.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
The capacity region of classes of product broadcast channels
CoRR, 2011

Generating dependent random variables over networks.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Beyond the cut-set bound: Uncertainty computations in network coding with correlated sources.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

The capacity region for two classes of product broadcast channels.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Results and Techniques in Multiuser Information Theory.
PhD thesis, 2010

Information-theoretic key agreement of multiple terminal: part II: channel model.
IEEE Trans. Inf. Theory, 2010

Information-theoretic key agreement of multiple terminals: part I.
IEEE Trans. Inf. Theory, 2010

On an outer bound and an inner bound for the general broadcast channel.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Guessing facets: polytope structure and improved LP decoder.
IEEE Trans. Inf. Theory, 2009

A generalized cut-set bound.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
New bounds on the information-theoretic key agreement of multiple terminals.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

An outer bound to the admissible source region of broadcast channels with arbitrarily correlated sources and channel variations.
Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007
Guessing Facets: Polytope Structure and Improved LP Decoding
CoRR, 2007

Communication For Omniscience by a Neutral Observer and Information-Theoretic Key Agreement of Multiple Terminals.
Proceedings of the IEEE International Symposium on Information Theory, 2007


  Loading...