activity
20062023
most citedMacroscopic Invisibility Cloak for Visible Light

393 citations · 684 across the 70 of their papers we have counts for

collaborators
Showing cs.ITShow all

17 papers · 1 filter

cs.IT2023

On Strong Secrecy for Multiple Access Channels with States and Causal CSI

Yiqi Chen, Tobias Oechtering, Mikael Skoglund +1

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by d…

cs.IT2023

On Strong Secrecy for Multiple Access Channel with States and Causal CSI

Yiqi Chen, Tobias Oechtering, Mikael Skoglund +1

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by d…

cs.IT2019

Finite Blocklength Analysis of Gaussian Random Coding in AWGN Channels under Covert Constraint

Xinchun Yu, Shuangqin Wei, Yuan Luo

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems fro…

cs.IT2019★ 2 cited

Capacity of Distributed Storage Systems with Clusters and Separate Nodes

Jingzhao Wang, Tinghan Wang, Yuan Luo +1

In distributed storage systems (DSSs), the optimal tradeoff between node storage and repair bandwidth is an important issue for designing distributed coding strategies to ensure la…

cs.IT2018★ 1 cited

Correct Undetected Errors with List Decoding in ARQ Error-control Systems

Jingzhao Wang, Yuan Luo

Undetected errors are important for linear codes, which are the only type of errors after hard decision and automatic-repeat-request (ARQ), but do not receive much attention on the…

cs.IT2018★ 5 cited

Optimal locally repairable codes of distance and via cyclic codes

Yuan Luo, Chaoping Xing, Chen Yuan

Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code {\it optimal} if it achieves the Singleton-type bound).…