activity
20172025
collaborators
Showing cs.ITShow all

7 papers · 1 filter

cs.IT2025

Design and Analysis of a Concatenated Code for Intersymbol Interference Wiretap Channels

Aria Nouri, Reza Asvadi, Jun Chen

We propose a two-stage concatenated coding scheme for reliable and secure communication over intersymbol interference wiretap channels. We first establish the secrecy capacity. The…

cs.IT2018

Successive Wyner-Ziv Coding for the Binary CEO Problem under Logarithmic Loss

Mahdi Nangir, Reza Asvadi, Jun Chen +2

The -link binary Chief Executive Officer (CEO) problem under logarithmic loss is investigated in this paper. A quantization splitting technique is applied to convert the problem…

cs.IT2018

Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss

Mahdi Nangir, Reza Asvadi, Mahmoud Ahmadian-Attari +1

An -link binary CEO problem is considered in this paper. We present a practical encoding and decoding scheme for this problem employing the graph-based codes. A successive codin…

cs.IT2018

LDPC Codes over Gaussian Multiple Access Wiretap Channel

Sahar Shahbaz, Bahareh Akhbari, Reza Asvadi

We study the problem of two-user Gaussian multiple access channel (GMAC) in the presence of an external eavesdropper. In this problem, an eavesdropper receives a signal with a lowe…

cs.IT2018

Binary CEO Problem under Log-Loss with BSC Test-Channel Model

Mahdi Nangir, Reza Asvadi, Mahmoud Ahmadian-Attari +1

In this paper, we propose an efficient coding scheme for the two-link binary Chief Executive Officer (CEO) problem under logarithmic loss criterion. The exact rate-distortion bound…

cs.IT2018

Analysis and Code Design for the Binary CEO Problem under Logarithmic Loss

Mahdi Nangir, Reza Asvadi, Mahmoud Ahmadian-Attari +1

In this paper, we propose an efficient coding scheme for the binary Chief Executive Officer (CEO) problem under logarithmic loss criterion. Courtade and Weissman obtained the exact…