Paper Info
Title
On the representation of band limited functions using finitely many bits
Abstract
In this paper, we consider the question of representing an entire function of finite order and type in terms of finitely many bits, and reconstructing the function from these. Instead of making any further assumptions about the function, we measure the error in reconstruction in a suitably weighted Lp norm. The optimal number of bits in order to obtain a given accuracy is given by the Kolmogorov entropy. We determine this entropy in the case of certain compact subsets of these weighted Lp spaces and obtain constructive algorithms to determine the asymptotically optimal bit representation from finitely many samples of the function. Our theory includes both equidistant and non-uniform sampling. The reconstructions are polynomials, having several other optimality properties.
Year
DOI
Venue
2002
10.1006/jcom.2001.0637
J. Complexity
Keywords
DocType
Volume
finite order,Kolmogorov entropy,asymptotically optimal bit representation,constructive algorithm,non-uniform sampling,optimal number,entire function,certain compact subsets,suitably weighted Lp norm,band limited function,weighted Lp space
Journal
18
Issue
ISSN
Citations 
2
Journal of Complexity
7
PageRank 
References 
Authors
0.85
1
1
Name
Order
Citations
PageRank
Hrushikesh Narhar Mhaskar125761.07