1 citations · 2 across the 5 of their papers we have counts for
5 papers
A machine-checked proof of the Dong-Yang classification of optimal (n,4) binary codes for BSCs
Shenghao Yang, Yanyan Dong
We present a machine-checked Lean~4 formalization of Dong and Yang's classification of optimal finite-length binary block codes for binary symmetric channels. The formaliza…
Adversarial Combinatorial Bandits with Switching Costs
Yanyan Dong, Vincent Y. F. Tan
We study the problem of adversarial combinatorial bandit with a switching cost for a switch of each selected arm in each round, considering both the bandit feedback and semi-ba…
On Achievable Rates of Line Networks with Generalized Batched Network Coding
Jie Wang, Shenghao Yang, Yanyan Dong +1
To better understand the wireless network design with a large number of hops, we investigate a line network formed by general discrete memoryless channels (DMCs), which may not be…
Utility Maximization for Multihop Wireless Networks Employing BATS Codes
Yanyan Dong, Sheng Jin, Yanzuo Chen +2
BATS (BATched Sparse) codes are a class of efficient random linear network coding variation that has been studied for multihop wireless networks mostly in scenarios of a single com…
On Optimal Finite-length Block Codes of Size Four for Binary Symmetric Channels
Yanyan Dong, Shenghao Yang
A binary code of blocklength and codebook size is called an code, which is studied for memoryless binary symmetric channels (BSCs) with the maximum likelihood (ML)…