2024/01/19 by Christina Hamilton, Evans Nyanney, Hamilton, Christina +5
Computer Science · #60Exx #94A34 #Advanced Data Compression Techniques #FOS: Mathematics #Probability (math.PR)
paper · pdf · doi:10.48550/arxiv.2401.10987
openalex publication_date 2024/01/19 · openalex created_date 2024/01/25 · openalex updated_date 2026/07/28
In this paper, we have considered a uniform distribution on a regular polygon with k-sides for some k≥ 3 and the set of all its k vertices as a conditional set. For the uniform distribution under the conditional set first, for all positive integers n≥ k, we obtain the conditional optimal sets of n-points and the nth conditional quantization errors, and then we calculate the conditional quantization dimension and the conditional quantization coefficient in the unconstrained scenario. Then, for the uniform distribution on the polygon taking the same conditional set, we investigate the conditional constrained optimal sets of n-points and the conditional constrained quantization errors for all n ≥ 6, taking the constraint as the circumcircle, incircle, and then the different diagonals of the polygon.