New Bounds and Constructions for Variable Packet-Error Coding
Abstract
In this paper, we consider the problem of variable packet-error coding, which emerges in network communication scenarios where a source transmits information to a destination through multiple disjoint paths. The objective is to design codes with dynamic error-correcting capabilities that adapt to varying numbers of errors. Specifically, we first provide several bounds on the rate--distortion trade-off for general variable packet-error coding schemes. Then, we present two explicit constructions of variable packet-error coding schemes. The first construction uses higher-order MDS codes and provides a coding scheme that achieves a better rate--distortion trade-off compared to known results for general parameter regimes. The second construction is based on a variant of the repetition code and yields a coding scheme with an optimal rate--distortion trade-off, with respect to our bound, for certain parameter regimes.
Cite
@article{arxiv.2506.15233,
title = {New Bounds and Constructions for Variable Packet-Error Coding},
author = {Xiangliang Kong and Xin Wang and Ron M. Roth and Itzhak Tamo},
journal= {arXiv preprint arXiv:2506.15233},
year = {2025}
}
Comments
20 pages, 3 figures, part of the work in this paper has been accepted for presentation at the 2025 IEEE International Symposium on Information Theory (ISIT)