2000 character limit reached
On recovering missing values for sequences in a pathwise setting (1604.04967v6)
Published 18 Apr 2016 in cs.IT, math.IT, math.ST, and stat.TH
Abstract: The paper suggests a frequency criterion of error-free recoverability of a missing value for sequences, i.e. discrete time processes, in a pathwise setting without probabilistic assumptions. The paper establishes error-free recoverability for classes of square-summable sequences with Z-transform vanishing at isolated points with a mild rate; the case of non-summable sequences is not excluded. The transfer functions for recovering algorithm are presented explicitly. Some robustness with respect to noise contamination is established for the suggested recovering algorithm.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.