◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Wei Yang

24 papers hereh-index 161.9k citations93 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author13
  • middle author10
  • last author1

Across the 24 of 24 papers where every author was matched, so the position is known.

fields
  • cs.IT24
same name
  • Wei Yang — 29 papers, h 12
  • Wei Yang — 25 papers, h 18
  • Wei Yang — 23 papers, h 24
  • Wei Yang — 22 papers, h 30
  • Wei Yang — 18 papers, h 16
  • Wei Yang — 16 papers, h 4

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102022
most citedShort-Packet Communications over Multiple-Antenna Rayleigh-Fading Channels

222 citations · 291 across the 24 of their papers we have counts for

collaborators
Showing 2016Show all

4 papers · 1 filter

cs.IT2016

Nonasymptotic coding-rate bounds for binary erasure channels with feedback

Rahul Devassy, Giuseppe Durisi, Benjamin Lindqvist +2

We present nonasymptotic achievability and converse bounds on the maximum coding rate (for a fixed average error probability and a fixed average blocklength) of variable-length ful…

cs.IT2016

Common-Message Broadcast Channels with Feedback in the Nonasymptotic Regime: Stop Feedback

Kasper Fløe Trillingsgaard, Wei Yang, Giuseppe Durisi +1

We investigate the maximum coding rate for a given average blocklength and error probability over a K-user discrete memoryless broadcast channel for the scenario where a common mes…

cs.IT2016★ 3 cited

Finite-Blocklength Bounds for Wiretap Channels

Wei Yang, Rafael F. Schaefer, H. Vincent Poor

This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds…

cs.IT2016★ 1 cited

A Beta-Beta Achievability Bound with Applications

Wei Yang, Austin Collins, Giuseppe Durisi +2

A channel coding achievability bound expressed in terms of the ratio between two Neyman-Pearson β functions is proposed. This bound is the dual of a converse bound established ea…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.