activity
20152023
most citedAn Improved Linear Programming Bound on the Average Distance of a Binary Code

7 citations · 41 across the 23 of their papers we have counts for

collaborators
Showing 2018Show all

9 papers · 1 filter

cs.IT2018

Exact Channel Synthesis

Lei Yu, Vincent Y. F. Tan

We consider the exact channel synthesis problem. This problem concerns the determination of the minimum amount of information required to create exact correlation remotely when the…

cs.IT2018

Corrections to "Wyner's Common Information under Rényi Divergence Measures"

Lei Yu, Vincent Y. F. Tan

In this correspondence, we correct an erroneous result on the achievability part of the Rényi common information with order in [1]. The new achievability result (uppe…

cs.IT2018

On Exact and -Rényi Common Informations

Lei Yu, Vincent Y. F. Tan

Recently, two extensions of Wyner's common information\textemdash exact and Rényi common informations\textemdash were introduced respectively by Kumar, Li, and El Gamal (KLE), and…

cs.IT2018

Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems

Mladen Kovačević, Vincent Y. F. Tan

A (tandem) duplication of length is an insertion of an exact copy of a substring of length next to its original position. This and related types of impairments are of r…

cs.IT2018

Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network

Daming Cao, Lin Zhou, Vincent Y. F. Tan

By proving a strong converse, we strengthen the weak converse result by Salehkalaibar, Wigger and Wang (2017) concerning hypothesis testing against independence over a two-hop netw…

cs.IT2018

Distributed Hypothesis Testing with Privacy Constraints

Atefeh Gilani, Selma Belhadj Amor, Sadaf Salehkalaibar +1

We revisit the distributed hypothesis testing (or hypothesis testing with communication constraints) problem from the viewpoint of privacy. Instead of observing the raw data direct…