Problems (inherent in compound hierarchical representations) of preserving information on the structure of coded data and methods of solving them by “binding” of information substructures are discussed. A type of distributed representations is considered in which data are coded by multidimensional binary sparse vectors. The constraints imposed on a binding procedure are formulated and its implementation is provided. Some examples of representation of structured data are considered.