English

Distributionally Robust Degree Optimization for BATS Codes

Information Theory 2024-05-15 v1 math.IT

Abstract

Batched sparse (BATS) code is a network coding solution for multi-hop wireless networks with packet loss. Achieving a close-to-optimal rate relies on an optimal degree distribution. Technical challenges arise from the sensitivity of this distribution to the often empirically obtained rank distribution at the destination node. Specifically, if the empirical distribution overestimates the channel, BATS codes experience a significant rate degradation, leading to unstable rates across different runs and hence unpredictable transmission costs. Confronting this unresolved obstacle, we introduce a formulation for distributionally robust optimization in degree optimization. Deploying the resulting degree distribution resolves the instability of empirical rank distributions, ensuring a close-to-optimal rate, and unleashing the potential of applying BATS codes in real-world scenarios.

Keywords

Cite

@article{arxiv.2405.08194,
  title  = {Distributionally Robust Degree Optimization for BATS Codes},
  author = {Hoover H. F. Yin and Jie Wang and Sherman S. M. Chow},
  journal= {arXiv preprint arXiv:2405.08194},
  year   = {2024}
}

Comments

8 pages, accepted by 2024 IEEE International Symposium on Information Theory

R2 v1 2026-06-28T16:26:06.714Z