default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYanyan Dong 0002
Person information
- affiliation: Chinese University of Hong Kong, School of Science and Engineering, Shenzhen, China
- affiliation (2022-2023): National University of Singapore, Singapore
Other persons with the same name
- Yanyan Dong (aka: Yan Yan Dong) — disambiguation page
- Yanyan Dong 0001
![[0000-0002-1430-7930]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1430-7930")
(aka: Yan Yan Dong 0001) — Yancheng Teachers University, School of Mathematics and Statistics, Yancheng, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j6]Yanyan Dong, Shenghao Yang:
On Optimal Finite-Length Block Codes of Size Four for Binary Symmetric Channels. IEEE Trans. Inf. Theory 71(1): 138-166 (2025)- [c6]Mo Li, Yanyan Dong, Ximing Fu:
Synchronous BFT Under an Information Theoretic Setting with Private Observations. ISIT 2025: 1-6 - 2024
- [j5]Jie Wang, Shenghao Yang, Yanyan Dong, Yiheng Zhang:
On Achievable Rates of Line Networks With Generalized Batched Network Coding. IEEE J. Sel. Areas Commun. 42(5): 1316-1328 (2024) - [j4]Yanyan Dong, Shenghao Yang, Jie Wang, Fan Cheng:
Throughput and Latency Analysis for Line Networks With Outage Links. IEEE J. Sel. Areas Inf. Theory 5: 464-477 (2024) - [j3]Yanyan Dong, Vincent Y. F. Tan:
Adversarial Combinatorial Bandits With Switching Costs. IEEE Trans. Inf. Theory 70(7): 5213-5227 (2024) - [c5]Yanyan Dong, Shenghao Yang, Jie Wang, Fan Cheng:
Throughput and Latency of Network Coding in Line Networks with Outages. ISIT 2024: 2216-2221 - 2023
- [j2]Licheng Mao, Shenghao Yang, Xuan Huang, Yanyan Dong:
Design and Analysis of Systematic Batched Network Codes. Entropy 25(7): 1055 (2023) - [c4]Yanyan Dong, Shenghao Yang:
Characterization of All Optimal Finite-length Codes of Size Four for Binary Symmetric Channels. ISIT 2023: 2135-2140 - 2021
- [j1]Yanyan Dong, Sheng Jin, Yanzuo Chen, Shenghao Yang, Hoover H. F. Yin:
Utility Maximization for Multihop Wireless Networks Employing BATS Codes. IEEE J. Sel. Areas Inf. Theory 2(4): 1120-1134 (2021) - [i3]Yanyan Dong, Sheng Jin, Yanzuo Chen, Shenghao Yang, Hoover H. F. Yin:
Utility Maximization for Multihop Wireless Networks Employing BATS Codes. CoRR abs/2105.07605 (2021) - [i2]Shenghao Yang, Jie Wang, Yanyan Dong, Yiheng Zhang:
Capacity Scalability of Line Networks with Batched Codes. CoRR abs/2105.07669 (2021) - 2020
- [c3]Yanyan Dong, Sheng Jin, Shenghao Yang, Hoover H. F. Yin:
Network Utility Maximization for BATS Code Enabled Multihop Wireless Networks. ICC 2020: 1-6 - [c2]Yanyan Dong, Shenghao Yang:
On Optimal Finite-length Binary Codes of Four Codewords for Binary Symmetric Channels. ISITA 2020: 146-150 - [i1]Yanyan Dong, Shenghao Yang:
On Optimal Finite-length Binary Codes of Four Codewords for Binary Symmetric Channels. CoRR abs/2006.07603 (2020)
2010 – 2019
- 2019
- [c1]Shenghao Yang, Jie Wang, Yanyan Dong, Yiheng Zhang:
On the Capacity Scalability of Line Networks with Buffer Size Constraints. ISIT 2019: 1507-1511
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-02-09 23:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
