2 papers
cs.IT2025
New Bounds and Constructions for Variable Packet-Error Coding
Xiangliang Kong, Xin Wang, Ron M. Roth +1
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 throu…
cs.IT2024
On Nearly Perfect Covering Codes
Avital Boruchovsky, Tuvi Etzion, Ron M. Roth
Nearly perfect packing codes are those codes that meet the Johnson upper bound on the size of error-correcting codes. This bound is an improvement to the sphere-packing bound. A re…