◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

V. Tan

151 papers hereh-index 375.4k citations293 works total

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

author position
  • sole author6
  • first author10
  • middle author46
  • last author87

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

fields
  • cs.IT101
  • cs.LG24
  • stat.ML14
  • math.OC3
  • quant-ph3
  • math.CO2
same name
  • V. Tan — 2 papers, h 47
  • V. Tan — 2 papers, h 1
  • V. Tan — 1 paper, h 19
  • V. Tan — 1 paper, h 3
  • V. Tan — 1 paper, h 5

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
20092023
most citedOn the Dispersions of Three Network Information Theory Problems

138 citations · 1.5k across the 136 of their papers we have counts for

collaborators
Showing 2013 · cs.ITShow all

4 papers · 2 filters

cs.IT2013★ 27 cited

Second-Order Asymptotics for the Gaussian MAC with Degraded Message Sets

Jonathan Scarlett, Vincent Y. F. Tan

This paper studies the second-order asymptotics of the Gaussian multiple-access channel with degraded message sets. For a fixed average error probability ε∈(0,1) an…

cs.IT2013★ 45 cited

Second-Order Coding Rates for Channels with State

Marco Tomamichel, Vincent Y. F. Tan

We study the performance limits of state-dependent discrete memoryless channels with a discrete state available at both the encoder and the decoder. We establish the epsilon-capaci…

cs.IT2013★ 18 cited

On the Reliability Function of the Discrete Memoryless Relay Channel

Vincent Y. F. Tan

Bounds on the reliability function for the discrete memoryless relay channel are derived using the method of types. Two achievable error exponents are derived based on partial deco…

cs.IT2013★ 11 cited

Non-Asymptotic and Second-Order Achievability Bounds for Coding With Side-Information

Shun Watanabe, Shigeaki Kuzuoka, Vincent Y. F. Tan

We present novel non-asymptotic or finite blocklength achievability bounds for three side-information problems in network information theory. These include (i) the Wyner-Ahlswede-K…

◍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.