Multidimensional permanents in enumrative problems

A permanent is an effective tool that can be used for solving a series of enumerative combinatorial problems. This theory is well-developed [1, 3] and has many applications. In this paper a problem of calculation of the number of 1-perfect binary codes is reduced to calculation of a generalized permanent of a specially constructed multidimensional matrix. Bibl. 3.