Protograph-Based Batched Network Codes
<|reference_start|>Protograph-Based Batched Network Codes: Batched network codes (BNCs) are a low-complexity solution for communication through networks with packet loss. Although their belief propagation (BP) performance is proved to approach capacity in the asymptotic regime, there is no evidence indicating that their BP performance is as good as expected in the finite-length regime. In this paper, we propose a protograph-based construction for BNCs, referred to as protograph-based BNCs (P-BNCs), which significantly differs from existing BNCs in three aspects: 1) Unlike traditional constructions where the degree of variable nodes is random, P-BNCs have a highly structured Tanner graph with specified degree distributions for both variable nodes and check nodes. 2) Traditional BNCs use a fixed degree distribution to generate all batches, making their performance highly sensitive to channel conditions, but P-BNCs achieve good performance under varying channel conditions due to their rate-compatible structures. 3) The construction of PBNCs takes into account joint BP decoding with a sparse precode, whereas traditional constructions typically do not consider a precode, or assume the presence of a precode that can recover a certain fraction of erasures. Thanks to these three improvements, P-BNCs not only have higher achievable rates under varying channel conditions, but more importantly, their finite-length BP performance is significantly improved.<|reference_end|>
@article{zhu2024protograph-based,
    title={Protograph-Based Batched Network Codes},
    author={Mingyang Zhu and Ming Jiang and Chunming Zhao},
    journal={arXiv preprint arXiv:2408.16365},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.16365},
    primaryClass={cs.IT math.IT}
}