Effects of cyclic quantization of functions on rectangular lattices (a
liasing) are considered. To describe the complexity of the aliasing fo
rms the notion of aliasing dimension is introduced and analyzed. The f
initeness of aliasing dimension for polynomials is proved and effectiv
e bilateral bounds for this dimension are obtained. The results obtain
ed may be used for quantitative measurements of complexity of digital
images.