On the asymptotic quantization error for the doubling measures on Moran sets
Sanguo Zhu

TL;DR
This paper investigates the asymptotic behavior of quantization errors for doubling measures supported on Moran sets, establishing a weak form of Gersho's conjecture under certain conditions.
Contribution
It proves that for doubling measures on Moran sets, the minimal and maximal integral quantities are asymptotically proportional to the quantization error, confirming a weak version of Gersho's conjecture.
Findings
Asymptotic equivalence between integral quantities and quantization error.
Validation of a weak Gersho's conjecture for Moran set measures.
Establishment of proportionality under open set condition.
Abstract
We study the quantization errors for the doubling probability measures which are supported on a class of Moran sets . For each , let be an arbitrary -optimal set for of order and an arbitrary Voronoi partition with respect to . We denote by the integral and define \begin{eqnarray*} \underline{J}(\alpha_n,\mu):=\min\limits_{a\in\alpha_n}I_a(\alpha_n,\mu),\; \overline{J}(\alpha_n,\mu):=\max\limits_{a\in\alpha_n}I_a(\alpha_n,\mu). \end{eqnarray*} Let denote the th quantization error for of order . Assuming a version of the open set condition for , we prove that \[ \underline{J}(\alpha_n,\mu),\overline{J}(\alpha_n,\mu)\asymp\frac{1}{n}e_{n,r}^r(\mu). \] This result shows that, for the doublingβ¦
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Compression Techniques Β· Mathematical Analysis and Transform Methods Β· Mathematical Dynamics and Fractals
On the asymptotic quantization error for the doubling measures on Moran sets
Sanguo Zhu
School of Mathematics and Physics, Jiangsu University of Technology
Changzhou 213001, China.
Abstract.
We study the quantization errors for the doubling probability measures which are supported on a class of Moran sets . For each , let be an arbitrary -optimal set for of order and an arbitrary Voronoi partition with respect to . We denote by the integral and define
[TABLE]
Let denote the th quantization error for of order . Assuming a version of the open set condition for , we prove that
[TABLE]
This result shows that, for the doubling measures on Moran sets , a weak version of Gershoβs conjecture holds.
Key words and phrases:
Moran sets, doubling measures, quantization error, Voronoi partition
2000 Mathematics Subject Classification:
Primary 28A80, 28A78; Secondary 94A15
1. Introduction
One of the main objectives of the quantization problem is to study the error in the approximation of a given probability measures with discrete measures of finite support. We refer to [11] for the deep background of this problem and [7, 9] for rigorous mathematical foundations of quantization theory.
For each , we write . Let be a Borel probability measure on . Let denote the metric induced by an arbitrary norm on (in the following, we work with the Euclidean norm). The th quantization error for of order can be defined by
[TABLE]
By [7, Lemma 3.4], the quantization error is equal to the minimum error in approximation of with discrete probability measures which are supported on at most points in the -metric.
If the infimum in (1.1) is attained at some , we call an -optimal set for of order . Let us call points of -optimal points for of order . By [7, Theorem 4.12], the collection of all the -optimal set for of order is non-empty whenever the th moment is finite.
The asymptotic properties for the -th quantization error for of order have been deeply studied for absolutely continuous measures and some singular measures which are supported on fractals (cf. [2, 7, 8, 19, 21, 15, 18, 24, 30]). Next, let us recall a significant concern in quantization theory.
Let be a finite set. A Voronoi partition (VP) with respect to is a Borel partition of which satisfies
[TABLE]
We write and define
[TABLE]
A famous conjecture of Gersho (cf. [5, 10]) suggests that for and an arbitrary VP with respect to , the following holds:
[TABLE]
Here, means as . This conjecture is significant for all probability measures with finite th moment. However, up to now, it has been proved true only for some special classes of one-dimensional probability distributions (cf. [4, 10, 16]).
In 2012, Graf, Luschgy and PagΓ¨s proved that, for a large class of absolutely continuous measures on , a weak version of Gershoβs conjecture holds [10]:
[TABLE]
where indicates that for all . For general measures on , it is very difficult even to examine whether (1.2) holds or not. Therefore, it is significant to ask, for what measures (1.2) holds.
In the study of the above question, the following quantity for bounded Borel sets often plays a significant role:
[TABLE]
where denotes the diameter of the set . Roughly speaking, we often expect that, for well-behaved probability measures (cf. Lemma 2.4), the optimal points βshouldβ, in some sense, be distributed according to the size of . With the above idea in mind, the author proved (1.2) for Ahlfors-David measures on (see [31]). Recall that a Borel measure is called an -dimensional Ahlfors-David measure if there exist constants such that
[TABLE]
for every and . Here and hereafter, denotes the closed ball of radius which is centered at a point .
In [32], the author proved that (1.2) is true for the Moran measures on . The Moran measures are the image measures of infinite product measures on the corresponding coding space under the natural projection. The advantage of these measures is, that an interval can always be excluded from its complement by its two endpoints, so that when we adjust the number of prospective optimal points in , its complement would not be affected unfavorably. However, this is not applicable for Moran measures in higher-dimensional spaces. One of the major obstacles is that, for a given cylinder set (see Definition 1.1), we are unable to estimate the number of the cylinder sets , with non-overlapping and , whose -neighborhoods intersect that of , no matter how small is. Hence, a significant direction of effort is to seek some conditions, under which the above-mentioned numbers are bounded by some constant and then manage to apply the covering technique as descried in [17] by KessebΓΆhmer and Zhu.
In the present paper, we will prove that, (1.2) holds for the doubling measures on Moran sets in . We will assume a version of the open set condition which allows cylinder sets to touch one another.
Let be a sequence of positive integers with . For every , let , be real numbers in such that
[TABLE]
We denote the empty word by . We write
[TABLE]
Let denote the closure and interior in of a set respectively. For , and , we write for the concatenation of and .
Definition 1.1**.**
Let be a nonempty compact subset of with . Let . Let , be subsets of such that
- (i)
the sets are geometrically similar to and ; 2. (ii)
for every pair .
Let us call the sets cylinder sets of order one. Assume that , are defined. For each , let , be subsets of such that
- (1)
they are geometrically similar to and ; 2. (2)
for every pair .
Inductively, is well defined for all . We call , cylinder sets of order . We define
[TABLE]
We call the set a Moran set associated with and \big{(}(c_{k,j})_{j=1}^{n_{k}}\big{)}_{k\geq 1}.
Moran sets are important objects in fractal geometry. In the past decades, this type of sets and the measures supported on them have been of great interest to mathematicians (cf. [1, 12, 20, 22, 28]).
Note that is a compact doubling metric space: there exists some integer such that for every and every ball in the sub-metric space can be covered by at most balls of radii in . This can be seen by considering a maximal family of pairwise disjoint balls of radii which are centered in and estimating the volumes. Therefore, by [26] (see also [14, 25]), carries a doubling measureβa Borel measure such that, for some constant ,
[TABLE]
From (1.4), we know that is the topological support of , and since is bounded and for every , we also have that . Thus, always carries a doubling probability measure. Next, let us make some remarks on the doubling measures on .
First, by Proposition 4.9 of [3], if is an -dimensional Ahlfors-David measure with , then is an -set, that is, the -dimensional Hausdorff measure of is both positive and finite. However, according to Theorem 1.1 of [12], a Moran set is not necessarily an -set even if (1.3) is assumed. Thus, may not support an Ahlfors-David measure, but as we mentioned above, it always supports a doubling probability measure.
Secondly, let , be contractive similitudes on . By [13], there exists a unique non-empty compact set which satisfies . The set is called the self-similar set associated with . We say that satisfies the open set condition (OSC), if there exists a non-empty bounded open set such that and for every pair . With the assumption of the OSC, is a Moran set as defined above (cf. [6]). Now let be a probability vector. There exists a unique Borel probability measure which satisfies . The measure is called the self-similar measure associated with and .
In [29], with the assumption of the OSC, Young established a necessary and sufficient condition for a self-similar measure to be doubling on . By Proposition 1.5 of [29], one can see that a doubling measure carried by needs not to be an Ahlfors-David measure, although it is well known that under the OSC, is an -set and the normalized -dimensional Hausdorff measure is an -dimensional Ahlfors-David measure. One may also see [27] for characterizations for the doubling measures carried by some Moran sets.
Further, if satisfies the strong separation condition, namely, , , are pairwise disjoint, then by Olsen [23], we know that all self-similar measures on are doubling.
Now we are able to state our main result. Let denote the boundary (in ) of a set . We further assume that there exists some constants and such that, for every , there exists some with which satisfies
[TABLE]
When is a self-similar set, the condition (1.5) is guaranteed by the OSC (cf. Proposition 3.4 of [6]). This condition will enable us to estimate the -measure of the boundary of for every . By the assumption , (1.5) and the construction of , it is not difficult to see that (cf. [12])
[TABLE]
As the main result of the present paper, we will prove that, (1.2) holds for the doubling measures on . That is,
Theorem 1.2**.**
Let be a Moran set satisfying (1.5) and a doubling probability measure satisfying (1.4). For each , let be an arbitrary element of and an arbitrary VP with respect to . Then
[TABLE]
The remaining part of the paper is organized as follows. In section 2, we will establish some basic facts for the measure and some auxiliary measures. Using these facts, we define, in section 3, some auxiliary integers. In section 4, we use these integers to establish estimates for the number of optimal points lying in the suitably chosen neighborhoods of cylinders, which may intersect one another. Finally, based on the estimates in section 4, we apply [7, Theorem 4.1] and some results in [31] to complete the proof of the theorem.
2. Preliminary lemmas
Let , we define . For , we write
[TABLE]
If , we define ; if , we define . For and , we write if . We say that are incomparable if we have neither nor . By the construction of , for every pair of incomparable words, we have .
A subset of is called an antichain if the words in are pairwise incomparable; is called a maximal finite antichain if it is a finite antichain and for every , there exists some such that . Without loss of generality, in the following, we assume that . Then
[TABLE]
For every , we define in the same manner as we did for words in . Let , we denote by the largest integer not exceeding . Next, we will establish some basic properties for the measure .
Lemma 2.1**.**
There exists a constant such that
[TABLE]
Proof.
Let be given. Fix an arbitrary . By (1.5), we have . It follows that
[TABLE]
Let and . Then . Hence,
[TABLE]
Thus, by (1.4), we obtain
[TABLE]
Hence, the lemma follows by defining .
β
Lemma 2.2**.**
For every , we have . As a consequence, we have for every pair of incomparable words in .
Proof.
Note that . By Lemma 2.1, we obtain
[TABLE]
Now for every , we apply (2.2) to and get
[TABLE]
Note that . We obtain
[TABLE]
By induction, we deduce that for all . Thus, we conclude that . For every pair of incomparable words , we know that . Hence, . β
Lemma 2.3**.**
There exists a number such that
[TABLE]
for every and .
Proof.
Let and . Let be an arbitrary point of . Note that . Using (1.5), we deduce
[TABLE]
We write . Then we have
[TABLE]
Let . Then by (1.4), we deduce
[TABLE]
We define . Then the first inequality in (2.3) is fulfilled. By our assumption, we have ; thus, by Lemma 2.2, we obtain the second inequality in (2.3). This completes the proof of the lemma. β
For every and , we write
[TABLE]
Our next lemma connects the quantity with some integrals over . It will be used to establish estimates for the quantization error for .
Lemma 2.4**.**
Let be an integer with . Let and . Let be a subset of with . Then
[TABLE]
Proof.
By the hypothesis, for every , we have
[TABLE]
It follows that . It remains to give an estimate in the reverse direction. Note that . There exists some such that . Hence, by (1.5), we obtain
[TABLE]
On the other hand, by Lemmas 2.1 and 2.3, we have
[TABLE]
By using (2.5) and (2.6), we deduce
[TABLE]
This completes the proof of the lemma. β
Let . By Lemma 2.3, we know that
[TABLE]
This allows us to define the following finite maximal antichain in :
[TABLE]
Remark 2.5**.**
We have , where
[TABLE]
This can be seen as follows. For every , by Lemma 2.3 and (2.7),
[TABLE]
Note that for all . We deduce that . For every and , again, by Lemma 2.3 and (2.7), we have
[TABLE]
This and (1.6) implies that .
For a set and , we write for the closed -neighborhood of . For every , we define
[TABLE]
One can see that if and only if .
Lemma 2.6**.**
There exists constants and such that for every pair with , we have
[TABLE]
Proof.
Let and . It suffices to show that there exists a constant such that whenever , we have . Assume that . Let be an arbitrary point in . Then by (1.5), we have
[TABLE]
Let . By (1.4), we deduce
[TABLE]
Now by (2.7), we know that . It follows that
[TABLE]
The first part of (2.9) follows by defining . To see the second, we define . Then by the first part of (2.9) and (2.7), we have
[TABLE]
This completes the proof of the lemma. β
With the above preparations, we are now able to establish an upper bound for the numbers as defined in (2.8).
Lemma 2.7**.**
There exists a constant such that .
Proof.
For every , we fix an arbitrary and an arbitrary . By (2.8) and Lemma 2.6, we have
[TABLE]
Since the words in are pairwise incomparable, the balls , , are mutually disjoint. Hence, by estimating the volumes, we obtain
[TABLE]
By defining , the lemma follows. β
Remark 2.8**.**
The boundedness of the set will be very crucial for us to establish a characterization for the optimal sets. Unfortunately, without the doubling property, we are unable to obtain this boundedness even for self-similar measures with the assumption of the OSC.
Next, we define some auxiliary measures which are image measures of the conditional measures of on cylinder sets . On one hand, these auxiliary measures will allow us to extract the crucial quantity ; on the other hand, as we will see, they share some basic properties which will be very helpful for the characterizations for the optimal sets.
For every , let be an arbitrary similitude with similarity ratio . Let denote the conditional probability measure of on . We define
[TABLE]
Then one can see that and . We have
Lemma 2.9**.**
There exist constants and such that, for every and , we have .
Proof.
Let . By Lemmas 2.3, (2.10) and (1.3), we have
[TABLE]
The lemma can be proved by using (2.12), (2.12) and the same argument as that in the proof for [9, Proposition 5.1]. β
Remark 2.10**.**
Let . Then can be covered by closed balls of radii which are centered in . In fact, we may consider the largest number of closed balls of radii which are centered in , and then double the radii and obtain a cover for . By estimating the volumes, one can see that .
Remark 2.11**.**
Let be a nonempty finite set and . Let denote the set of the centers of some closed balls of radii which are centered in and cover . For , we have . Thus, by triangle inequality, one can see that for every , we have
[TABLE]
Thus, if we replace with , only the points in might be affected unfavorably.
For every , let be as defined in (2.8) and . Motivated by Remark 2.11, we define
[TABLE]
Lemma 2.12**.**
There exists a constant such that, for every , the following holds:
[TABLE]
Proof.
[TABLE]
We define . The lemma follows. β
Let be an arbitrary similitude with similarity ratio . We define
[TABLE]
Lemma 2.13**.**
There exists a constant such that, for every and , we have .
Proof.
Let and . Using (2.10), (2.13) and Lemma 2.2, we deduce
[TABLE]
By Lemma 2.6 and (2.8), for every , we have
[TABLE]
Let . By (2.14), (2.15) and Lemma 2.9, we obtain
[TABLE]
This completes the proof of the lemma. β
3. Auxiliary integers
First, we select three integers , which will be used to establish a lower bound for the number of optimal points lying in . The following Lemmas 3.1-3.6 are devoted to this goal.
Lemma 3.1**.**
Let and . Assume that there exists some point in such that . Then for and , we have
[TABLE]
Proof.
By the hypothesis, for every , we have . Note that for every , we have
[TABLE]
Therefore, there exists some such that . Hence, for every , we have . It follows that
[TABLE]
Using this and Lemma 2.3, we deduce
[TABLE]
This completes the proof of the lemma. β
The next lemma is an easy consequence of the definition of the quantization errors and some covering techniques.
Lemma 3.2**.**
(see [31, Lemma 2.2]) Let be a Borel probability measure on with compact support . Then for every , there exists an integer depending only on and , such that implies
[TABLE]
Lemma 3.3**.**
There exists a smallest integer such that, for every ,
[TABLE]
In particular, for every , we have
[TABLE]
Proof.
Let and . Note that . By Lemma 3.2, for , we obtain
[TABLE]
Now let . By Lemma 2.12, we have
[TABLE]
This completes the proof of the lemma. β
Let be as defined in Remark 2.10 and . We have
Lemma 3.4**.**
Let and . If , then
[TABLE]
Proof.
Let and . We write
[TABLE]
We have the following two cases:
Case (a1): . In this case, we have for every . Note that . It follows that
[TABLE]
Case (a2) . Then by Lemmas 3.1 and 3.3, we obtain
[TABLE]
The lemma follows by combining the above analysis. β
Lemma 3.5**.**
(see [31, Lemma 2.3]) Let be a Borel probability measure on with support . Assume that and there exist constants such that . Then there exists a depending only on and such that .
Lemma 3.6**.**
There exists an integer such that for and every pair , the following holds:
[TABLE]
In particular, for every and , we have
[TABLE]
Proof.
Note that . We set
[TABLE]
Then by Lemmas 3.2 and 3.5, for all , we obtain
[TABLE]
Let and . Using Lemma 2.12 and (2.7), we deduce
[TABLE]
This completes the proof of the lemma. β
Remark 3.7**.**
Let be as defined in Remark 2.5. We define
[TABLE]
For every , there exists a unique , such that
[TABLE]
By Remark 2.5, we know that . Thus, we have
[TABLE]
In the following, we will use Lemmas 3.8-3.11 to select three more integers . These integers will be used to establish an upper bound for the numbers of -optimal points lying in .
Lemma 3.8**.**
Let be an integer. Then there exists a constant which depends on and , such that, for every , we have
[TABLE]
Proof.
Let . Let . By Lemma 2.9, we have
[TABLE]
As a consequence of (1.1) and (3.3), we obtain
[TABLE]
By defining , the proof of the lemma is complete. β
Lemma 3.9**.**
Let . There exists a constant such that for every with , we have
[TABLE]
Proof.
By the assumption (1.5), we have . We write
[TABLE]
We distinguish between the following two cases.
Case (b1): . In this case, we have
[TABLE]
By Lemma 3.8, we have . This and (3.4) yield
[TABLE]
Case (b2): . Fix an arbitrary point . By (1.5), we have
[TABLE]
Thus, we have d\big{(}B(x_{0},4^{-1}\delta s_{\sigma}),\alpha\big{)}>4^{-1}\delta s_{\sigma}. Let . Then for every , we have . Therefore, there exists some with such that
[TABLE]
Using this and Lemma 2.3, we deduce
[TABLE]
Combining (3.5) and (3.6), the lemma follows by defining
[TABLE]
β
Lemma 3.10**.**
There exists a constant such that, for every and . In particular, for every and , we have
[TABLE]
Proof.
By Lemma 3.2, it suffices to define and . β
Lemma 3.11**.**
There exists a smallest integer such that for and , the following holds:
[TABLE]
In particular, for every and , we have
[TABLE]
Proof.
By Lemmas 3.2, 2.12 and (2.7), it suffices to define
[TABLE]
β
4. A characterization of the -optimal sets
We always assume that and satisfies (3.2). We denote by the set of the centers of some balls of radii which are centered in and cover . We define
[TABLE]
In the following, we will use three lemmas to establish upper and lower estimates for the numbers . The first lemma can be proved by using the argument in the proof for [31, Lemma 3.1].
Lemma 4.1**.**
We have \kappa_{c}:={\rm card}\big{(}\alpha_{n}\setminus\big{(}\bigcup_{\sigma\in\Lambda_{k,r}}(J_{\sigma})_{\frac{s_{\sigma}}{8}}\big{)}\big{)}\leq L_{0}\phi_{k,r}.
Using Lemmas 4.1 and 3.3-3.6, we are able to give a lower bound for for all . That is,
Lemma 4.2**.**
For every , we have .
Proof.
Assume that for some . By (3.2) and Lemma 4.1,
[TABLE]
Therefore, there exists some such that . Let
[TABLE]
Then we have . By Remark 2.11, we obtain,
[TABLE]
In the following, we distinguish between two cases.
Case (c1): . In this case, we have . Note that . By Lemmas 3.4, 3.6 and (2.7), we deduce
[TABLE]
From (4.1)-(4.3), we obtain that , a contradiction.
Case (c2): . In this case, . Using (4.2) and (4.3), we deduce
[TABLE]
Combining this and (4.1), we deduce that , a contradiction. β
Next, by Lemmas 3.10-3.11, we establish an upper bound for for all . This will be used to establish a lower bound for .
Lemma 4.3**.**
For every , we have .
Proof.
Assume that for some . Next, we will deduce a contradiction. Note that and . Further, for every , we have . Thus,
[TABLE]
Since (Lemma 2.7), we obtain . Further, for distinct words , we have . Thus, there exists some such that . Let and
[TABLE]
Then . Again, by Remark 2.11, we have
[TABLE]
[TABLE]
Using this and (4.4), we obtain , a contradiction. β
Next we give an estimate for the distance between and an arbitrary point in . The integer is defined mainly for this purpose.
Lemma 4.4**.**
For every , we have . In particular,
[TABLE]
Proof.
Assume that, for some and . Next, we deuce a contradiction. By the assumption and Lemma 3.1, we have
[TABLE]
Let . We define a set with :
[TABLE]
By Remark 2.11, we obtain
[TABLE]
By Lemma 4.2, we have, . Thus, by Lemma 3.3, we obtain
[TABLE]
Combining (4.5)-(4.6), we obtain that . This contradicts the optimality of and the lemma follows. β
5. Proof of the main result
As in section 4, we assume that , and satisfies (3.2). Let be a VP with respect to The following lemma gives a characterization for the geometric structure of the elements of .
Lemma 5.1**.**
For every and , we have
[TABLE]
Proof.
Let be an arbitrary point of . Then by Lemma 4.4, there exists some such that . Note that for every , we have . Hence, for every and every , we have . By Lemma 4.4, we obtain that, and (5.1) follows. (5.2) is an easy consequence of Lemmas 4.3 and 4.4. β
Using Lemma 5.1 and [7, Theorem 4.1], we are able to reduce the quantization problem with respect to an arbitrarily large to that with respect to some bounded numbers. We need to consider the union of some bounded number of elements of . Let be an arbitrary point in . Then for some . We define
[TABLE]
By Lemma 4.3, . By Lemma 5.1, we obtain
[TABLE]
Let and be an enumeration of . For every , let be a subset of . We write
[TABLE]
One can see that for some and some choice of and
[TABLE]
In order to obtain a lower estimate for , we need to consider the conditional measure of on and apply [31, Lemma 2.4]. For this reason, we select an arbitrary similitude of similarity ratio and define
[TABLE]
By (2.8) and Lemma 2.6, one may find a constant such that
[TABLE]
Lemma 5.2**.**
Let be as given in Lemma 2.9. There exists a constant such that, for every and every , we have
[TABLE]
Proof.
Let and . By (5.6) and Lemma 2.2, we have
[TABLE]
Thus, by (5) and Lemmas 2.6 and 2.7, we further deduce
[TABLE]
Note that and . By (5.7), (5.9), Lemmas 2.9, 2.13, we obtain
[TABLE]
It is sufficient to define . β
For two -valued variables , we write () if there exists some constant such that (). Our next lemma provides us with estimates for in terms of .
Lemma 5.3**.**
We have .
Proof.
By Lemmas 2.2 and 4.4 and (2.7), we obtain
[TABLE]
By applying Lemma 2.4 with , we obtain
[TABLE]
Combining (5.10) and (5.11), the lemma follows. β
Lemma 5.4**.**
(cf. [31, Lemma 2.4]) Let be a Borel probability measure on with compact support such that for every . Assume that . Then for every , there exists a number which depends on , such that
[TABLE]
Proof of Theorem 1.2 Let be an arbitrary point of . By Lemma 5.1, we have for some . Thus, by Lemmas 4.4 and 5.3,
[TABLE]
Let be as defined in (5.3). Then (see (5.4)) for some and some . By [7, Theorem 4.1], we have
[TABLE]
From the similarity of , we deduce that . Using (5.5), Lemmas 5.2, 5.4 and the similarity of , we deduce
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R.Cawley, R.D. Mauldin, Multifractal decompositions of Moran fractals. Adv. Math.92 (1992), 196-236
- 2[2] M. Dai, X. Tan, Quantization dimension of random self-similar measures. J. Math. Anal. Appl. 362 (2010), 471-475
- 3[3] K. J. Falconer, Fractal geometry: mathematical foundations and applications, John Wiley & Sons, 2004.
- 4[4] J. C. Fort and G. Pagès, Aymptotics of optimal quantizers for some scalar distributions, J. Comp. Appl. Mathematics, 146 (2002), 253-275.
- 5[5] A. Gersho, Asymptotically optimal block quantization. IEEE Trans. Inform. Theory, 25, 373-380 (1979)
- 6[6] S. Graf, On Bandtβs tangential distribution for self-similar measures. Monatsh. Math. 120, 223-246.
- 7[7] S. Graf and H. Luschgy, Foundations of quantization for probability distributons, Lecture Notes in Math. vol. 1730, Springer, 2000.
- 8[8] S. Graf and H. Luschgy, The point density measure in the quantization of self-similar probabilities. Math. Proc. Camb. Phil. Soc.138, 513-531
