State Estimation over Worst-Case Erasure and Symmetric Channels with Memory

2019/02/02 by Amir Hossein Saberi, Farhad Farokhi, Saberi, Amir +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #Cellular Automata and Applications #DNA and Biological Computing #Error Correcting Code Techniques #FOS: Computer and information sciences #FOS: Electrical engineering #Information Theory (cs.IT) #Signal Processing (eess.SP) #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.1902.00726

openalex publication_date 2019/02/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Worst-case models of erasure and symmetric channels are investigated, in which the number of channel errors occurring in each sliding window of a given length is bounded. Upper and lower bounds on their zero-error capacities are derived, with the lower bounds revealing a connection with the topological entropy of the channel dynamics. Necessary and sufficient conditions for linear state estimation with bounded estimation errors via such channels are then obtained, by extending previous results for non-stochastic memoryless channels to those with finite memory. These estimation conditions involve the topological entropies of the linear system and the channel.

Related

• Bounded State Estimation over Finite-State Channels: Relating Topological Entropy and Zero-Error Capacity
• Metric and topological entropy bounds for optimal coding of stochastic\n dynamical systems
• Upper Bounds on the Feedback Error Exponent of Channels With States and Memory
• Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost
• On the Capacity of Memoryless Channels with Synchronization Errors