output
19922026
most citedA fast approach for overcomplete sparse decomposition based on smoothed L0 norm

1.1k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2012 · cs.ITShow all

8 papers · 2 filters

cs.IT2012★ 1 cited

Diffusion Based Nanonetworking: A New Modulation Technique and Performance Analysis

Hamidreza Arjmandi, Amin Gohari, Masoume Nasiri Kenari +1

In this letter, we propose a new molecular modulation scheme for nanonetworks. To evaluate the scheme we introduce a more realistic system model for molecule dissemination and prop…

cs.IT2012

Three-User Cognitive Interference Channel: Capacity Region with Strong Interference

Mahtab Mirmohseni, Bahareh Akhbari, Mohammad Reza Aref

This study investigates the capacity region of a three-user cognitive radio network with two primary users and one cognitive user. A three-user Cognitive Interference Channel (C-IF…

cs.IT2012★ 5 cited

Universal Bounds on the Scaling Behavior of Polar Codes

Ali Goli, S. Hamed Hassani, Rudiger Urbanke

We consider the problem of determining the trade-off between the rate and the block-length of polar codes for a given block error probability when we use the successive cancellatio…

cs.IT2012★ 5 cited

Coordination via a relay

Farzin Haddadpour, Mohammad Hossein Yassaee, Amin Gohari +1

In this paper, we study the problem of coordinating two nodes which can only exchange information via a relay at limited rates. The nodes are allowed to do a two-round interactive…

cs.IT2012

Channel simulation via interactive communications

Mohammad Hossein Yassaee, Amin Gohari, Mohammad Reza Aref

In this paper, we study the problem of channel simulation via interactive communication, known as the coordination capacity, in a two-terminal network. We assume that two terminals…

cs.IT2012★ 6 cited

Achievability proof via output statistics of random binning

Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin Gohari

This paper introduces a new and ubiquitous framework for establishing achievability results in \emph{network information theory} (NIT) problems. The framework uses random binning a…

cs.IT2012★ 1 cited

On Marton's inner bound for broadcast channels

Amin Gohari, Chandra Nair, Venkat Anantharam

Marton's inner bound is the best known achievable region for a general discrete memoryless broadcast channel. To compute Marton's inner bound one has to solve an optimization probl…

cs.IT2012

Successive Secret Key Agreement over Generalized Multiple Access and Broadcast Channels

Somayeh Salimi, Mikael Skoglund, Mahmoud Salmasizadeh +1

A secret key agreement framework between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers…