2022/01/14 by Jan Østergaard, Østergaard, Jan
Computer Science · Mathematics · #Advanced Data Storage Technologies #Cooperative Communication and Network Coding #Error Correcting Code Techniques #cs.IT #math.IT #math.OC
paper · pdf · doi:10.48550/arxiv.2201.05488
Accepted and presented at the IEEE 60th Conference on Decision and Control (CDC). arXiv admin note: substantial text overlap with arXiv:2112.11717
arxiv created 2022/01/14 · arxiv updated 2022/01/17
We propose (k,k') stabilizing codes, which is a type of delayless error correction codes that are useful for control over networks with erasures. For each input symbol, k output symbols are generated by the stabilizing code. Receiving any k' of these outputs guarantees stability. Thus, the system to be stabilized is taken into account in the design of the erasure codes. Our focus is on LTI systems, and we construct codes based on independent encodings and multiple descriptions. The theoretical efficiency and performance of the codes are assessed, and their practical performances are demonstrated in a simulation study. There is a significant gain over other delayless codes such as repetition codes.