No label defined (Q4037199)

[For the entire collection see Zbl 0755.00006.] From author's introduction: ``By optimal coding in mathematics we mean a mapping of a mathematical object into \(\mathbb{R}^ n\) with a minimal information loss. The information loss in this mapping is measured by the diameter of the original. The necessity of replacing a certain mathematical object (for example, a function) by a scalar vector appears when we have to put this object into a technical device that uses a discrete information (like in mathematical simulation, image processing and so on)... The purpose of this paper is to give a survey on the most interesting results, from our point of view, on optimal coding. In section 2 we formula problems concerning optimal coding of elements in a metric space and give some general relations. Sections 3 and 4 are a survey on the results about the optimal coding of functions with a priori information specified by a bound on the norm of the \(r\)th derivative or on the modulus of continuity of the function itself or of its derivative... In section 5 we consider the problem of optimal coding of vector-functions and in particular, of plane curves under a restriction on the rate of change of the tangent slope. Section 6 contains the formulation of some new problems''.