Soheil Mohajer

Orcid: 0000-0003-2254-1652

According to our database1, Soheil Mohajer authored at least 108 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
Cache-Aided K-User Broadcast Channels With State Information at Receivers.
IEEE Trans. Inf. Theory, April, 2024

On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs.
IEEE Trans. Inf. Theory, 2024

Sparsity-Constrained Community-Based Group Testing.
CoRR, 2024

Coded Multi-User Information Retrieval with a Multi-Antenna Helper Node.
CoRR, 2024

Few-Shot Channel-Agnostic Analog Coding: A Near-Optimal Scheme.
CoRR, 2024

2023
Distributed Optimization Over Time-Varying Graphs With Imperfect Sharing of Information.
IEEE Trans. Autom. Control., July, 2023

DIMIX: Diminishing Mixing for Sloppy Agents.
SIAM J. Optim., June, 2023

Secure Determinant Codes for Distributed Storage Systems.
IEEE Trans. Inf. Theory, March, 2023

Improved Bounds For Efficiently Decodable Probabilistic Group Testing With Unreliable Items.
Proceedings of the IEEE Information Theory Workshop, 2023

Distributed Fact Checking.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Probabilistic Group Testing in Distributed Computing with Attacked Workers.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Optimality of Energy-Efficient Scheduling and Relaying for Half-Duplex Relay Networks.
IEEE J. Sel. Areas Inf. Theory, 2022

Channel Aware Greedy Algorithm for MISO Cache-Aided Communication.
Proceedings of the 23rd IEEE International Workshop on Signal Processing Advances in Wireless Communication, 2022

Identifying Reliable Machines for Distributed Matrix-Vector Multiplication.
Proceedings of the IEEE International Symposium on Information Theory, 2022

The Optimal Sample Complexity of Matrix Completion with Hierarchical Similarity Graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Distributed Optimization over Time-Varying Networks: Imperfect Information with Feedback is as Good as Perfect Information.
Proceedings of the American Control Conference, 2022

2021
Gaussian Half-Duplex Diamond Networks: Ratio of Capacity the Best Relay Can Achieve.
IEEE Trans. Wirel. Commun., 2021

On the Sum Capacity of Dual-Class Parallel Packet-Erasure Broadcast Channels.
IEEE Trans. Commun., 2021

Low-Complexity MISO Cache-Aided Communication via Meta-User Scheduling.
Proceedings of the 25th International ITG Workshop on Smart Antennas, 2021

When an Energy-Efficient Scheduling is Optimal for Half-Duplex Relay Networks?
Proceedings of the IEEE International Symposium on Information Theory, 2021

Adaptive Bit Allocation for Communication-Efficient Distributed Optimization.
Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

2020
Deterministic Shuffling Networks to Implement Stochastic Circuits in Parallel.
IEEE Trans. Very Large Scale Integr. Syst., 2020

Parallel Unary Computing Based on Function Derivatives.
ACM Trans. Reconfigurable Technol. Syst., 2020

Cascade Codes for Distributed Storage Systems.
IEEE Trans. Inf. Theory, 2020

On the Fundamental Limits of Coded Data Shuffling for Distributed Machine Learning.
IEEE Trans. Inf. Theory, 2020

Cooperative Wireless Mobile Caching: A Signal Processing Perspective.
IEEE Signal Process. Mag., 2020

Best Relay Selection in Gaussian Half-Duplex Diamond Networks.
CoRR, 2020

Resource Provisioning for Virtual Network Function Deployment with In-Subnetwork Processing.
Proceedings of the 21st IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2020

Practical scheme for MISO Cache-Aided Communication.
Proceedings of the 21st IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2020

Matrix Completion with Hierarchical Graph Side Information.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Operating Half-Duplex Diamond Networks with Two Interfering Relays.
Proceedings of the IEEE Information Theory Workshop, 2020

Secure Determinant Codes: Type-II Security.
Proceedings of the IEEE International Symposium on Information Theory, 2020

On the Fraction of Capacity One Relay can Achieve in Gaussian Half-Duplex Diamond Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2020

MISO Cache-Aided Communication with Reduced Subpacketization.
Proceedings of the 2020 IEEE International Conference on Communications, 2020

Joint Resource Allocation and Routing for Service Function Chaining with In-Subnetwork Processing.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Simple Caching Schemes for Non-homogeneous MISO Cache-Aided Communication via Convexity.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2019
Bandwidth Adaptive & Error Resilient MBR Exact Repair Regenerating Codes.
IEEE Trans. Inf. Theory, 2019

Determinant Codes With Helper-Independent Repair for Single and Multiple Failures.
IEEE Trans. Inf. Theory, 2019

Non-Colluding Attacks Identification in Distributed Computing.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Subspace Coding for Coded Caching: Decentralized and Centralized Placements Meet for Three Users.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Cache-Aided Two-User Broadcast Channels with State Information at Receivers.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Secure Determinant Codes: A Class of Secure Exact-Repair Regenerating Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On Simple Scheduling in Half-Duplex Relay Diamond Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Product Matrix MSR Codes With Bandwidth Adaptive Exact Repair.
IEEE Trans. Inf. Theory, 2018

Cache-Aided Communications With Multiple Antennas at Finite SNR.
IEEE J. Sel. Areas Commun., 2018

On the Fundamental Limits of Coded Data Shuffling for Distributed Learning Systems.
CoRR, 2018

Optimal Power Allocation in MISO Cache-Aided Communication.
Proceedings of the 19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2018

Tier-Code: An XOR-Based RAID-6 Code with Improved Write and Degraded-Mode Read Performance.
Proceedings of the 2018 IEEE International Conference on Networking, 2018

Erasure Coding for Decentralized Coded Caching.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

A Cascade Code Construction for (n, k, d) Distributed Storage Systems.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

On the Fundamental Limits of Coded Data Shuffling.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Routing Magic: Performing Computations Using Routing Networks and Voting Logic on Unary Encoded Data.
Proceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, 2018

Low latency parallel implementation of traditionally-called stochastic circuits using deterministic shuffling networks.
Proceedings of the 23rd Asia and South Pacific Design Automation Conference, 2018

2017
abSNP: RNA-Seq SNP Calling in Repetitive Regions via Abundance Estimation.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

Product matrix minimum storage regenerating codes with flexible number of helpers.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Coding across heterogeneous parallel erasure broadcast channels is useful.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Active Learning for Top-K Rank Aggregation from Noisy Comparisons.
Proceedings of the 34th International Conference on Machine Learning, 2017

Scalable (n, k, d) exact-repair regenerating codes with small repair bandwidth.
Proceedings of the IEEE International Conference on Communications, 2017

Exact-repair trade-off for (n, k = d - 1, d) regenerating codes.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Determinant Coding: A Novel Framework for Exact-Repair Regenerating Codes.
IEEE Trans. Inf. Theory, 2016

Role of a Relay in Bursty Multiple Access Channels.
CoRR, 2016

Bandwidth adaptive & error resilient regenerating codes with minimum repair bandwidth.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Role of a relay in bursty networks with correlated transmissions.
Proceedings of the IEEE International Symposium on Information Theory, 2016

New exact-repair codes for distributed storage systems using matrix determinant.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Active top-K ranking from noisy comparisons.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Exact repair for distributed storage systems: Partial characterization via new bounds.
Proceedings of the 2015 Information Theory and Applications Workshop, 2015

New bounds on the (n, k, d) storage systems with exact repair.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Linear exact repair rate region of (k + 1, k, k) distributed storage systems: A new approach.
Proceedings of the IEEE International Symposium on Information Theory, 2015

A probabilistic approach towards exact-repair regeneration codes.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
New bounds for distributed storage systems with secure repair.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

Group testing with unreliable elements.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Smart Meter Privacy: A Theoretical Framework.
IEEE Trans. Smart Grid, 2013

Degrees of Freedom Region of the MIMO Interference Channel With Output Feedback and Delayed CSIT.
IEEE Trans. Inf. Theory, 2013

On the Symmetric Feedback Capacity of the $K$-User Cyclic Z-Interference Channel.
IEEE Trans. Inf. Theory, 2013

On the Feedback Capacity of the Fully Connected $K$-User Interference Channel.
IEEE Trans. Inf. Theory, 2013

Reference-based DNA shotgun sequencing: Information theoretic limits.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On convergence rate of scalar Hegselmann-Krause dynamics.
Proceedings of the American Control Conference, 2013

2012
Tight Bounds on the Redundancy of Huffman Codes.
IEEE Trans. Inf. Theory, 2012

Graph-Constrained Group Testing.
IEEE Trans. Inf. Theory, 2012

On X-channels with feedback and delayed CSI.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Generalized degrees of freedom of the symmetric K-user interference channel with feedback.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Feedback and delayed CSI can be as good as perfect CSI.
Proceedings of IEEE International Conference on Communications, 2012

2011
On the Capacity of Noncoherent Network Coding.
IEEE Trans. Inf. Theory, 2011

Approximate Capacity of a Class of Gaussian Interference-Relay Networks.
IEEE Trans. Inf. Theory, 2011

Anti-uniform huffman codes.
IET Commun., 2011

On Interference Networks with Feedback and Delayed CSI
CoRR, 2011

Smart meter privacy: A utility-privacy framework.
Proceedings of the IEEE Second International Conference on Smart Grid Communications, 2011

Randomized Algorithms for Comparison-based Search.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Cascade source coding with erased side information.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the parallel relay wire-tap network.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Approximation for Problems in Multi-User Information Theory.
PhD thesis, 2010

Asymmetric multilevel diversity coding and asymmetric Gaussian multiple descriptions.
IEEE Trans. Inf. Theory, 2010

Approximate Capacity of Gaussian Interference-Relay Networks with Weak Cross Links
CoRR, 2010

Gaussian diamond network with adversarial jammer.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2009
Approximating the Gaussian multiple description rate region under symmetric distortion constraints.
IEEE Trans. Inf. Theory, 2009

An Estimation Theoretic Approach for Sparsity Pattern Recovery in the Noisy Setting
CoRR, 2009

On the capacity of multisource non-coherent network coding.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Capacity of deterministic Z-chain relay-interference network.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

A deterministic approach to wireless network error correction.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

On the capacity of non-coherent network coding.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Approximate capacity of a class of Gaussian relay-interference networks.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Support recovery in compressed sensing: An estimation theoretic approach.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Asymmetric Gaussian multiple descriptions and asymmetric multilevel diversity coding.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

On the Symmetric Gaussian Multiple Description Rate-Distortion Function.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Asymmetric Multi-level Diversity Coding.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Tight bounds on the AUH codes.
Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

Transmission techniques for relay-interference networks.
Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007
Tight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes
CoRR, 2007


  Loading...